We have 4 of 11 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
In 1985, Erd{\H{o}}s, Frankl and F{\"u}redi conjectured that the threshold $T(r)$ for the existence of an $r$-cover-free family with more members than points satisfies $T(r)=(1+o(1))r^2$. We confirm this conjecture by proving $T(r)\ge r^2+r+2$ for every $r\ge1$.
The Brown--Erd\H{o}s--S\'os problem is a fundamental problem in sparse hypergraph Tur\'an theory. For integers $r,k\ge 2$ and $s\ge r$, the problem asks for the maximum number $f^{(r)}(n;s,k)$ of edges in an $n$-vertex $r$-uniform hypergraph containing no $k$ distinct edges spanning at most $s$ vertices. In 1971, Brown...
The chromatic threshold, originating in a question of Erd\H{o}s and Simonovits, asks when a linear minimum-degree condition forces bounded chromatic number in H-free graphs. Motivated by a question of Thomassen, the homomorphism threshold asks for the stronger conclusion that every such graph admits a homomorphism to a...
Minimum-degree thresholds ask when excluding a fixed graph $H$ forces a dense graph to admit a simple global description. For each fixed chromatic number, the chromatic threshold has only three possible values. We show that this finite-spectrum phenomenon is special to chromatic threshold: already among $3$-chromatic g...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
