We study a conjecture of Conlon, Fox, Gunby, He, Mubayi, Suk, Verstra\"ete, and Yu, which characterizes the $3$-graphs $H$ for which the off-diagonal Ramsey number $r(H,n)$ is polynomial. We prove the conjecture for $3$-graphs with at most five tight components. Additionally, we show that the full conjecture is equival...
David Conlon, Xiao-Yu He, Jia-Xi Nie et al.· 1 citation
Given an ‐uniform hypergraph , we define its ‐uniform expansion to be the hypergraph obtained from by inserting distinct vertices into each edge of , and we define to be the largest ‐free subgraph of the random hypergraph . We initiate the first systematic study of for general hypergraphs . Our main result essentiall...
Jia-Xi Nie, Sam Spiro· Random Structures & Algo...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.