Past Events

2018-2019

May 02

Guy Moshkovitz, IAS

New results on projections
Fine Hall 224 / -
Apr 04

Daniel Reichman, Princeton University

Contagious sets in bootstrap percolation
Fine Hall 224 / -
Mar 28

David Harris, University of Maryland

Oblivious resampling oracles and parallel algorithms for the Lopsided Lovasz Local Lemma
Fine Hall 224 / -
Mar 14

Martin Loebl (Charles U, Prague)

Cut-obstacles and robust ear decompositions
Fine Hall 224 / -
Mar 07

Jeroen Zuiddam, IAS

The asymptotic spectrum of graphs: duality for Shannon capacity
Fine Hall 224 / -
Feb 28

Omri Ben-Eliezer, Tel Aviv

Finding patterns in permutations
Fine Hall 224 / -
Feb 21

Michael Krivelevich, Tel Aviv

Complete minors in graphs without sparse cuts
Fine Hall 224 / -
Feb 14

Ron Aharoni, Technion, Haifa

Rainbow independent sets and collapsibility
Fine Hall 224 / -
Feb 05

Pawel Rzazewski, University of Warsaw

Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs
Fine Hall 224 / -
Dec 13

Sebastian Cioaba, University of Delaware

The smallest eigenvalues of Hamming, Johnson and other graphs
Fine Hall 224 / -
Dec 11

Guangming Jing, Georgia State University

The Goldberg-Seymour conjecture on the edge-coloring of multigraphs
Fine Hall 224 / -
Dec 06

Colin Defant, Princeton University

Structure in stack-sorting
Fine Hall 224 / -
Nov 15

Gal Kronenberg, Tel Aviv University

TBD
Fine Hall 224 / -
Nov 15

Gal Kronenberg, Tel Aviv University

The chromatic index of random multigraphs
Fine Hall 224 / -
Nov 08

Alex Scott. Oxford University

Induced trees and Erdos-Hajnal
Fine Hall 224 / -
Oct 25

Ben Lund, Princeton University

Erdos' distinct distance problem in finite fields
Fine Hall 224 / -
Oct 18

Clara Shikhelman, Princeton University

Generalized Turan-type problems for random graphs
Fine Hall 224 / -
Oct 11

Jinyoung Park, Rutgers University

The number of 4-colorings of the Hamming cube
Fine Hall 224 / -
Oct 04

Michael Simkin, Hebrew University

Perfect matchings in random subgraphs of regular bipartite graphs
Fine Hall 224 / -
Sep 27

Margaret Readdy, University of Kentucky

Geometric proofs of some combinatorial identities of Morel
Fine Hall 224 / -
Sep 20

Ehud Friedgut, Weizmann Institute

The sharp threshold criterion and the container method; chisel and hammer
Fine Hall 224 / -
Sep 13

Muli Safra, U. Tel Aviv

The 2-to-2 Games Conjecture via expansion on the Grassmann graph
Fine Hall 224 / -