Combinatorics Lectures Online

Organizers: Jacob Fox and Paul Seymour .


Forthcoming talks

Tue May 26, 04:30 ET (= 09:30 BST), Catherine Greenhill (UNSW), ``The small subgraph conditioning method and hypergraphs'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue May 26, 06:00 ET (= 11:00 BST), David Wood (Monash), ``Subgraph densities in a surface '', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue May 26, 09:00 ET (= 14:00 BST): Iddo Tzameret (Royal Holloway), ``Semi-algebraic proofs and the tau-conjecture: can a natural number be negative?'', abstract (Warwick DIMAP Seminar), Zoom link

Wed May 27, 09:00 ET (= 14:00 BST): Peleg Michaeli (Tel Aviv), ``Greedy maximal independent sets via local limits'', abstract (Warwick combinatorics seminar), Zoom link .

Thu May 28, 11:00 ET (= 17:00 Bergen time): Daniel Marx, (Max-Planck-Institut für Informatik), `` Incompressibility of H-free edge modification problems: Towards dichotomy'', abstract (Frontiers of parameterized complexity seminar), Zoom link , password name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.

Thu May 28, 12:00 ET: David Conlon (Caltech), ``Recent progress in extremal graph theory'', abstract (Moscow Inst. of Physics and Tech.), Zoom link , password the first six digits of pi after the decimal point.

Thu May 28, 12:00 ET: Ashwin Sah (MIT), ``Diagonal Ramsey via effective quasirandomness'', abstract (Webinar in additive combinatorics), login for Zoom link.

Thu May 28, 13:00 ET (= 10:00 PT): Matija Bucić (ETH Zürich), ``Large cliques and independent sets all over the place'', abstract (Stanford combinatorics seminar), Zoom link , password will be mailed to the CLO mailing list.

Thu May 28, 14:00 ET: Carla Groenland (Oxford), ``Reconstruction from small cards'', abstract (WinCom colloquium), Zoom link .

Fri May 29, 08:00 ET (= 14:00 CEST): Anurag Bishnoi (U. Western Australia), ``Clique-free pseudorandom graphs'', abstract (Optimization seminar TU Delft), Zoom link .

Mon Jun 1, 12:00: Jozsef Solymosi (UBC), ``Sums and products along edges of sparse graphs'', abstract (Webinar in additive combinatorics), login for Zoom link.

Mon Jun 1, 15:00 ET (= 20:00 BST): Iain Moffatt (Royal Holloway University), ``The Tutte polynomial of a delta-matroid and the world of graph polynomials'', abstract (Matroid Union seminar), Zoom link, password will be mailed to the CLO list, or email rose.mccarty~at~uwaterloo~.~ca.

Mon Jun 1, 18:00 ET (= Jun 2, 08:00 Melbourne time): Maria Chudnovsky (Princeton), ``Holes with hats and the Erdős-Hajnal conjecture'', abstract, (MATRIX online seminar), registration (required).

Tue Jun 2, 09:00 ET (= 14:00 BST): Wojciech Samotij (Tel Aviv), ``An entropy proof of the Erdős-Kleitman-Rothschild theorem'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue Jun 2, 10:30 ET (= 15:30 BST): Jean Bertoin (Zürich), ``Scaling exponents of step-reinforced random walks'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue Jun 2, 11:00 ET (= 16:00 BST): Meirav Zehavi (Ben-Gurion U.), ``Parameterized analysis, graph minors and planar disjoint paths'', abstract (Warwick DIMAP Seminar), Zoom link

Wed Jun 3, 02:00 ET (= 16:00 AEST): John Bamberg (U. Western Australia), ``Vanishing Krein parameters in finite geometry'' abstract (CMSA seminar), Zoom link , password will be mailed to the CLO list.

Wed Jun 3, 09:00 ET (= 14:00 BST): Yifan Jing (UIUC), ``TBA'', abstract (Warwick combinatorics seminar), Zoom link .

Thu Jun 4, 11:00 ET (= 17:00 Bergen time): Hans Bodlaender (Utrecht), ``Typical sequences revisited - computing width parameters of graphs'', abstract (Frontiers of parameterized complexity seminar), Zoom link , password name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.

Thu Jun 4, 12:00 ET (= 17:00 BST): Ashwin Sah (MIT), ``Diagonal Ramsey via effective quasirandomness'', abstract, (LSE CGO seminar) Zoom link, password concatenate the first 6 primes, hence obtaining an 8-digit password.

Fri Jun 5, 08:00 ET (= 14:00 CEST): Paul Seymour (Princeton), ``Pure pairs of vertex-subsets'', abstract (Equipe Comb. et Alg. du LaBRI), joining link.

Mon Jun 8, 12:00 ET: Dimitris Koukoulopoulos (Montreal), ``TBA'', abstract (Webinar in additive combinatorics), login for Zoom link.

Tue Jun 9, 09:00 ET (= 14:00 BST), Dana Randall (Georgia Tech), ``TBA'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue Jun 9, 09:00 ET (= 14:00 BST): Alexandr Andoni (Columbia), ``TBA'', abstract, (Warwick DIMAP Seminar), Zoom link.

Tue Jun 9, 10:00 ET (= 15:00 BST), Will Perkins (Illinois), ``First-order phase transitions and efficient sampling algorithms'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Tue Jun 9, 10:00 ET (= 15:00 BST), Allan Sly (Princeton), ``TBA'', abstract (Oxford Discrete Mathematics and Probability Seminar), Zoom link TBA (on the website).

Wed Jun 10, 09:00 ET (= 14:00 BST): Yahav Alon (Tel Aviv), ``Hitting time of disjoint Hamilton cycles in random subgraph processes'', abstract (Warwick combinatorics seminar), Zoom link .

Thu Jun 11, 11:00 ET (= 17:00 Bergen time): Edith Elkind (Oxford), ``TBA'', abstract (Frontiers of parameterized complexity seminar), Zoom link , password name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.

Mon Jun 15, 12:00 ET: Ben Green (Oxford), ``On a conjecture of Gowers and Long'', abstract (Webinar in additive combinatorics), lonin for Zoom link.

Tue Jun 16, 11:00 ET (= 16:00 BST): Krzysztof Onak (IBM), ``TBA'', abstract (Warwick DIMAP seminar), Zoom link.

Wed Jun 17, 03:00 ET (= 17:00 AEST): Fiona Skerman (Uppsala) ``Branching processes with merges and locality of hypercube’s critical percolation'' abstract (CMSA seminar), Zoom link , password will be mailed to the CLO list.

Wed Jun 17, 09:00 ET (= 14:00 BST): Andrzej Grzesik (Jagiellonian), ``TBA'', abstract (Warwick combinatorics seminar), Zoom link .

Thu Jun 18, 11:00 ET (= 17:00 Bergen time): Martin Grohe (RWTH Aachen U.), ``Polylogarithmic parameterized algorithms for the graph isomorphism problem: from bounded degree to excluded minors'', abstract (Frontiers of parameterized complexity seminar), Zoom link , password name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.

Mon Jun 22, 12:00 ET: Marina Iliopoulou (Kent), ``TBA'', abstract (Webinar in additive combinatorics), lonin for Zoom link.

Tue Jun 23, 09:00 ET (= 14:00 BST): Victor Zamaraev (Liverpool), ``TBA'', abstract (Warwick DIMAP Seminar), Zoom link .

Wed Jun 24, 09:00 ET (= 14:00 BST): Bjarne Schülke (Hamburg), ``Extremal problems concerning the traces of sets'', abstract (Warwick combinatorics seminar), Zoom link .

Mon Jun 29, 12:00 ET: Zachary Chase (Oxford), ``A random analogue of Gilbreath's conjecture'', abstract (Webinar in additive combinatorics), login for Zoom link.

Wed Jul 1, 03:00 ET (= 17:00 AEST): Tibor Szabó (Berlin), ``TBA'' abstract (CMSA seminar), Zoom link , password will be mailed to the CLO list.



This is a list of online talks in combinatorics, to be held in the near future. If you have a talk that you would like to be listed here, please send to Paul Seymour (pds@math.princeton.edu) the title, day, time and time-zone, name and affiliation of the speaker, name of hosting institution, and the link to join the meeting (and a link to the abstract; not the abstract itself).

There is also a mailing list, to which we will email this week's activities, perhaps twice a week. If you would like to be added or removed from the list, please send email to pds@math.princeton.edu with a university email address, or a one-line description of who you are. Because of the danger of Zoom-bombing, we recommend that lecture organizers use the ``waiting room'' option, or set a password. If you let us know the password, we will mail it out to the people on the mailing list.

See also Virtual Combinatorics Colloquium, Oxford Discrete Mathematics and Probability Seminar, and CS Theory Online Talks.

free Counters