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
We prove that for all fixed $k\geq 4$, any $N$ vertex graph with no independent set of size $n$ and $N\geq \Omega(n^{k-1}/\log^{k-2}n)$ contains at least $$ \Omega\bigg(\binom Nk \Big(\frac{\log n}{n}\Big)^{\binom k2}/\log n\bigg) $$ cliques of order $k$, and for $k\geq 5$ this is best possible conditional on the known...
L. Post· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.