On Kahn's flow conjecture
We prove Kahn's flow conjecture, which is a strong form of Chv\'atal's conjecture on the largest intersecting subfamily of a downset.
3 papers indexed here
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.
We prove Kahn's flow conjecture, which is a strong form of Chv\'atal's conjecture on the largest intersecting subfamily of a downset.
Let $G$ be the terminal graph of the random triangle-removal process started from $K_n$. We prove that $e(G)/n^{3/2}\to1/(2\sqrt2)$ in $L^2$. More generally, we obtain the analogous result for any fixed strictly $k$-balanced $k$-graph. Our main tool is a more general theorem on random greedy matchings in nearly regular...
A family $F$ of subsets of $[n]$ is 3AP-intersecting if every two members have intersection containing a non-trivial three-term arithmetic progression. We prove that there is an absolute constant $c>0$ such that any such $F$ has size at most $(\tfrac12 - c)2^n$. This is the first non-trivial progress towards a conjectu...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.