Warwick Combinatorics Seminar

combinatorics

Audience:	Researchers in the topic
Seminar series time:	Wednesday 13:00-14:00 in your time zone, UTC
Organizers:	Jan Grebik, Oleg Pikhurko
Curator:	Hong Liu*
	*contact for this listing

This is the online combinatorics seminar at Warwick.

Upcoming talks

Past talks

Your time			Speaker	Title
Wed	Jun 22	13:00	Miek Messerschmidt	Compact packings of the plane with discs
Wed	Jun 15	13:00	Gal Kronenberg	Independent sets in random subgraphs of the hypercube
Wed	May 25	13:00	Richard Montgomery	On the Ryser-Brualdi-Stein conjecture
Wed	May 11	13:00	Péter Pál Pach	The Alon-Jaeger-Tarsi conjecture via group ring identities
Wed	May 04	13:00	Alistair Benford	Trees in tournaments
Wed	Apr 27	13:00	Xizhi Liu	The feasible region of induced graphs
Wed	Mar 16	16:00	Victor Chepoi	Labeled sample compression schemes for complexes of oriented matroids
Wed	Mar 09	14:00	Ján Špakula	On measured expanders
Wed	Mar 02	16:00	Mikolaj Fraczyk	Stationary random graphs and groups
Wed	Feb 23	14:00	Stijn Cambie	Packing list-colourings
Wed	Feb 09	16:00	Rachel Greenfeld	Decidability and periodicity of translational tilings
Wed	Feb 02	14:00	Michelle Delcourt	Recent Progress on Hadwiger's Conjecture
Wed	Jan 26	16:00	Andy Zucker	Big Ramsey degrees in binary free amalgamation classes
Wed	Jan 19	14:00	Jane Gao	Perfect matchings and sandwich conjectures of random regular graphs
Wed	Jan 12	16:00	Yinon Spinka	A tale of two balloons
Wed	Dec 08	14:00	George Kontogeorgiou	Equivariant Cayley Complex Embeddings
Wed	Dec 01	14:00	Martin Winter	Some modern open problems on polytopes with symmetries and regularities
Wed	Nov 24	14:00	Carla Groenland	Asymptotic dimension of graph classes
Wed	Nov 17	16:00	Natasha Morrison	Uncommon systems of equations
Wed	Nov 10	14:00	Łukasz Grabowski	Directed analogues of expander graphs and random compact subsets of $\mathbb{R}^n$
Wed	Nov 03	14:00	Joseph Hyde	Progress on the Kohayakawa-Kreuter conjecture
Wed	Oct 27	13:00	Rob Silversmith	Cross-ratios and perfect matchings
Wed	Oct 20	13:00	Henry Towsner	Regularity Lemmas as Structured Decompositions
Wed	Oct 06	13:00	Allan Sly	Factor of IID for the Ising model on the tree
Fri	Jul 02	13:00	Will Perkins	Polymer models, cluster expansion, and local limit theorems: counting independent sets in the hypercube
Fri	Jun 25	13:00	Tom Kelly	A proof of the Erdős–Faber–Lovász conjecture
Fri	Jun 18	13:00	Vishesh Jain	Towards the sampling Lovász Local Lemma
Fri	Jun 11	13:00	Nicholas Cook	Regularity method and large deviation principles for the Erdős–Rényi hypergraph
Fri	Jun 04	13:00	Gabor Kun	Graphings without measurable perfect matchings
Fri	May 28	13:00	Pierre-Loïc Méliot	Dependency graphs, upper bounds on cumulants and singular graphons
Fri	May 21	13:00	Gabor Elek	Uniform amenability
Fri	May 14	13:00	Pascal Schweitzer	Automorphisms of graphs with a forbidden minor
Fri	May 07	16:30	Gwen McKinley	Counting integer partitions with the method of maximum entropy
Fri	Apr 30	13:00	Agnes Backhausz	Typicality and entropy of processes on infinite trees
Fri	Mar 19	17:30	Daniel Spielman	Finite Free Probability and Ramanujan Graphs
Fri	Mar 12	14:00	Annie Raymond	Graph Density Inequalities, Sums of Squares and Tropicalization
Fri	Mar 05	13:30	Louis Esperet	Asymptotic dimension of graphs
Fri	Feb 26	14:00	Lutz Warnke	Prague dimension of random graphs
Fri	Feb 19	14:00	Jan Kurkofka	Every infinitely edge-connected graph contains the Farey graph or $T_{\aleph_0}*t$ as a minor
Fri	Feb 12	14:00	Gábor Pete	The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generating set
Fri	Jan 29	14:00	Lisa Sauermann	On polynomials that vanish to high order on most of the hypercube
Fri	Jan 22	17:30	Alexander Razborov	Theons and quasirandomness
Fri	Jan 15	14:00	Pál Galicza	Sparse reconstruction for iid variables
Fri	Dec 11	14:00	Hong Liu	Extremal density for sparse minors and subdivisions
Fri	Dec 04	14:00	Bhargav Narayanan	Homeomorphs
Fri	Nov 27	14:00	Anton Bernshteyn	Measurable colorings, the Lovász Local Lemma, and distributed algorithms
Fri	Nov 20	14:00	Benny Sudakov	Large independent sets from local considerations
Fri	Nov 13	14:00	Tibor Szabó	Mader-perfect digraphs
Fri	Nov 06	14:00	Boris Bukh	Empty axis-parallel boxes
Fri	Oct 30	14:00	Maria Chudnovsky	Even-hole free graphs of bounded degree have bounded treewidth
Fri	Oct 23	13:00	Gábor Tardos	Convergence and limits of finite trees
Fri	Oct 16	13:00	Marthe Bonamy	Graph recolouring
Fri	Oct 09	13:00	László Lovász	Graph limits, measures, and flows
Wed	Jun 24	13:00	Bjarne Schülke	Extremal problems concerning the traces of sets
Wed	Jun 17	13:00	Andrzej Grzesik	The Turán number of blow-ups of trees
Wed	Jun 10	13:00	Yahav Alon	Hitting time of disjoint Hamilton cycles in random subgraph processes
Wed	Jun 03	13:00	Yifan Jing	Structures of sets with minimal measure growth

Embed this schedule

Export series to