Budapest Big Seminar on Combinatorics + Geometry

computational geometry discrete mathematics combinatorics metric geometry

Audience:	Researchers in the topic
Seminar series time:	Friday 12:00-14:00 in your time zone, UTC
Organizers:	Gergely Ambrus, János Pach, Domotor Palvolgyi, Géza Tóth
	*contact for this listing

Upcoming talks

Past talks

Your time			Speaker	Title
Fri	May 27	12:00	University of Szeged	Szeged workshop on convexity
Fri	May 20	12:00	Károly Bezdek	TBA
Fri	May 13	12:00	Balázs Keszegh	The number of tangencies between two families of curves
Fri	May 06	12:00	István Miklós	Fast transformations of Latin squares, half-regular factorizations and edge colorings of bipartite graphs in small steps
Fri	Apr 29	12:00	Artem Zvavitch	Volume product and Mahler conjecture for convex bodies
Fri	Apr 22	13:00	Manfred Scheucher	Erdős-Szekeres-type problems in the real projective plane
Fri	Apr 08	12:00	Xavier Goaoc	No weak epsilon nets for lines and convex sets in space
Fri	Apr 01	12:00	Vsevolod Voronov	On the chromatic number of 2-dimensional spheres
Fri	Mar 25	13:00	Daniel McGinnis	A family of convex sets in the plane satisfying the (4,3)-property can be pierced by nine points
Fri	Mar 18	13:00	Márió Szegedy	TBA
Fri	Mar 11	13:00	Nicolas Bousquet	TBA
Fri	Mar 04	13:00	Imre Bárány	Orientation preserving maps of the n by n grid
Fri	Feb 25	13:00	Sophie Spirkl	A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
Fri	Feb 18	13:00	Márton Naszódi	Löwner's problem for log-concave functions and beyond
Fri	Feb 11	13:00	Alexandr Polyanskii	Polynomial plank covering problem
Fri	Dec 17	13:00	Gabor Fejes Toth	Remembering Aladár Heppes
Fri	Dec 10	13:00	David Conlon	Difference sets in higher dimensions
Fri	Dec 03	13:00	Gergely Ambrus	Piercing the chessboard
Fri	Nov 26	13:00	Oscar Ortega Moreno	The complex plank problem and Fejes Tóth's zone conjecture, revisited
Fri	Nov 19	13:00	Attila Pór	Universal order type of lines/$k$-flats in $R^d$
Fri	Nov 12	13:00	Imre Bárány	Pairwise intersecting convex sets and cylinders in $R^3$
Fri	Nov 05	13:00	Janos Barat	Saturated k-plane graphs and k-planar drawings with special emphasis on k=2
Fri	Oct 15	12:00	Andras Bezdek	On colored variants of some two-player games
Fri	Sep 24	12:00	Dömötör Pálvölgyi	666-uniform Unit Disk Hypergraphs are 3-colorable
Fri	Sep 17	12:00	Alexandr Polyanskii	Colorful Tverberg revisited
Fri	Jun 11	12:00	András Bezdek	Separating circles with polygonal tilings
Fri	May 21	14:00	Károly Bezdek	More on contact numbers of unit sphere packings
Fri	May 14	12:00	Balázs Keszegh	On tangencies among planar curves
Fri	May 07	12:00	Chaya Keller	Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs
Fri	Apr 30	12:00	Imre Bárány	Erdős-Szekeres theorem for k-flats
Fri	Apr 16	12:00	Endre Csóka	Upper bounds for the necklace folding problems
Fri	Apr 02	12:00	Madhu Sudan	(Deterministic) Communication Amid Uncertainty
Fri	Mar 26	13:00	Pablo Soberón	Quantitative Helly theorems
Fri	Mar 19	13:00	Ramon van Handel	Some unusual extremal problems in convexity and combinatorics
Fri	Mar 05	15:00	James Davies	Circle graphs are quadratically chi-bounded
Fri	Feb 26	13:00	Wolfgang Mulzer	TBA
Fri	Feb 19	13:00	Barak Weiss	New bounds on the covering density of lattices
Fri	Feb 12	13:00	Sergey Avvakumov	A subexponential size ${\mathbb R}P^n$
Fri	Feb 05	13:00	Natan Rubin	Stronger bounds for weak Epsilon-Nets
Fri	Dec 18	13:00	Pavel Valtr	On the expected number of holes in random point sets
Fri	Dec 04	09:00	David Wood	Universal Graph Product Structures
Fri	Nov 27	13:00	Oscar Ortega Moreno	An optimal plank theorem
Fri	Nov 20	13:00	Jacques Verstraete	Extremal problems for geometric hypergraphs
Fri	Nov 13	13:00	Andrey Kupavskii	Binary scalar products
Fri	Nov 06	13:00	Zsolt Lángi	A solution to some problems of Conway and Guy on monostable polyhedra
Fri	Oct 30	13:00	Márton Naszódi	Computing the Covering Radius with an Application to the Lonely Runner Conjecture
Fri	Oct 16	12:00	Micha Sharir	Eliminating depth cycles and its relatives
Fri	Oct 09	12:00	Péter Ágoston	A lower bound on the number of colours needed to nicely colour a sphere
Fri	Oct 02	12:00	Andreas Holmsen	Extensions of the (p,q) theorem
Fri	Sep 25	12:00	Gábor Damásdi	Odd wheels are not odd-distance graphs
Fri	Sep 18	12:00	Claude Tardif	The chromatic number of the product of 15-chromatic graphs can be 14
Fri	Sep 11	12:00	Xuding Zhu	Hedetniemi's conjecture and the Poljak-Rödl function

Embed this schedule

Export series to