9 citations · 29 across the 37 of their papers we have counts for
7 papers · 1 filter
Disproof of the Odd Hadwiger Conjecture
Marcus Kühn, Lisa Sauermann, Raphael Steiner +1
We prove that there exist graphs which do not contain as an odd minor and whose chromatic number is at least . This disproves, in a strong form, the odd Had…
Spectrally indistinguishable pseudorandom graphs
Arthur Forey, Javier Fresán, Emmanuel Kowalski +1
We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishabl…
Ramsey numbers of digraphs with local edge structure
Domagoj Bradač, Patryk Morawski, Benny Sudakov +1
One of the classical topics in graph Ramsey theory is the study of which -vertex graphs have Ramsey numbers that are linear in . In this paper, we consider this problem in th…
Regularity for hypergraphs with bounded VC dimension
Lior Gishboliner, Asaf Shapira, Yuval Wigderson
While Szemerédi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may on…
Off-Diagonal Ramsey Numbers for Linear Hypergraphs
Xiaoyu He, Jiaxi Nie, Yuval Wigderson +1
We study off-diagonal Ramsey numbers of -uniform hypergraphs, where is a fixed linear -uniform hypergraph and is complete on vertices. R…
Is it easy to regularize a hypergraph with easy links?
Lior Gishboliner, Asaf Shapira, Yuval Wigderson
A partition of a (hyper)graph is -homogenous if the edge densities between almost all clusters are either at most or at least . Suppose a…
Asymmetric results about graph homomorphisms
Lior Gishboliner, Eoin Hurley, Yuval Wigderson
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph has certain properties, then it has a homomorphism to a triangle-free gra…