Combinatorics online worldwide

combinatorics online around the world

On this page we will post the list of closest online events that take place in different Universities. Full information is in the Princeton list of online seminars
June 29, Mon
16.00 (MSK)
Extremal and probabilistic combinatorics webinar
Anton Bernshteyn (CMU)
A fast distributed algorithm for (Δ + 1)-edge-coloring
June 29, Mon
19.00 (MSK)
Webinar in additive combinatorics
Zachary Chase (Oxford)
A random analogue of Gilbreath's conjecture
June 30, Tue
16.00 (MSK)
NE combinatorics network colloquium
Cheryl Praeger (U. W. Australia)
Diagonal structures and permutation groups
July 1, Wed
10.00 (MSK)
CMSA seminar
Tibor Szabó (Berlin)
Turán numbers, norm graphs, quasirandomness
July 2, Thu
11.00 (MSK)
SCMS combinatorics seminar
Bojan Mohar (Simon Fraser)
Can the genus of a graph be approximated?
July 2, Thu
19.00 (MSK)
József Balogh (Illinois)
Independent sets in regular graphs
July 3, Fri
15.00 (MSK)
Bordeaux graph seminar
Torsten Ueckerdt (Karlsruhe)
Page numbers: old and new
July 6, Mon
16.00 (MSK)
Extremal and probabilistic combinatorics webinar
József Balogh (Illinois)
Extensions of Mantel’s theorem
July 6, Mon
19.00 (MSK)
Webinar in additive combinatorics
Sophie Stevens (RICAM)
An update on the sum-product problem
July 9, Tue
05.00 (MSK)
SCMS combinatorics seminar
Yifan Jing (Illinois)
Structures of sets with minimum measure growth
July 9, Thu
19.00 (MSK)
Fedor Petrov (Steklov Mathematical Institute)
List colorings of direct products