Round the world relay in combinatorics

External homepage

combinatorics probability

Audience: Researchers in the discipline
Conference date: 08-Jun-2021
Organizers: Jan Hladky*, Alex Scott*
*contact for this listing

A series of 22 talks organized by combinatorics groups worldwide.

Upcoming talks
Past talks
Your timeSpeakerTitle
TueJun 0823:00Ron GouldChorded cycles
TueJun 0822:00Andrew SukTurán-type problems for point-line incidences
TueJun 0821:00Fan ChungTrees and forests in Green's functions of a graph
TueJun 0820:00David ConlonRandom multilinear maps and the Erdős box problem
TueJun 0819:00Jim GeelenHomomorphisms and colouring for graphs and binary matroids
TueJun 0818:00Marcelo CamposThe singularity probability of a random symmetric matrix is exponentially small
TueJun 0817:00Allan SlySpread of infections in random walkers
TueJun 0816:00Jacob FoxRemoval lemmas
TueJun 0815:00James DaviesColouring circle graphs and their generalisations
TueJun 0814:00Dhruv MubayiThe feasible region of hypergraphs
TueJun 0813:00Deepak BalSize Ramsey numbers of paths and cycles
TueJun 0812:00Carla GroenlandUniversal Graphs and Labelling Schemes
TueJun 0811:00László LovászOrthogonal representations and graph limits
TueJun 0810:00Noga AlonSplitting Random Necklaces
TueJun 0809:00Annika HeckelHow does the chromatic number of a random graph vary?
TueJun 0808:00Heng GuoA Markov chain approach towards the sampling Lovász local lemma
TueJun 0807:00Bartosz WalczakColoring polygon visibility graphs and their generalizations
TueJun 0806:00O-joung KwonClasses of intersection digraphs with good algorithmic properties
TueJun 0805:00Gordon RoyleReal chromatic roots of planar graphs
TueJun 0804:00Jeroen SchillewaertConstructing highly regular expanders from hyperbolic Coxeter groups
TueJun 0803:00Baogang XuOn coloring of graphs of girth 2l+1 without longer odd holes
TueJun 0802:00David WoodUniversality in Minor-Closed Graph Classes
MonJun 0823:00Ron GouldChorded cycles
MonJun 0822:00Andrew SukTurán-type problems for point-line incidences
MonJun 0821:00Fan ChungTrees and forests in Green's functions of a graph
MonJun 0820:00David ConlonRandom multilinear maps and the Erdős box problem
MonJun 0819:00Jim GeelenHomomorphisms and colouring for graphs and binary matroids
MonJun 0818:00Marcelo CamposThe singularity probability of a random symmetric matrix is exponentially small
MonJun 0817:00Allan SlySpread of infections in random walkers
MonJun 0816:00Jacob FoxRemoval lemmas
MonJun 0815:00James DaviesColouring circle graphs and their generalisations
MonJun 0814:00Dhruv MubayiThe feasible region of hypergraphs
MonJun 0813:00Deepak BalSize Ramsey numbers of paths and cycles
MonJun 0812:00Carla GroenlandUniversal Graphs and Labelling Schemes
MonJun 0811:00László LovászOrthogonal representations and graph limits
MonJun 0810:00Noga AlonSplitting Random Necklaces
MonJun 0809:00Annika HeckelHow does the chromatic number of a random graph vary?
MonJun 0808:00Heng GuoA Markov chain approach towards the sampling Lovász local lemma
MonJun 0807:00Bartosz WalczakColoring polygon visibility graphs and their generalizations
MonJun 0806:00O-joung KwonClasses of intersection digraphs with good algorithmic properties
MonJun 0805:00Gordon RoyleReal chromatic roots of planar graphs (CMSA seminar)
MonJun 0804:00Jeroen SchillewaertConstructing highly regular expanders from hyperbolic Coxeter groups
MonJun 0803:00Baogang XuOn coloring of graphs of girth 2l+1 without longer odd holes
MonJun 0802:00David WoodUniversality in Minor-Closed Graph Classes
Embed this schedule
Export series to