We show that optimally pseudorandom $K_4$-free graphs of order $n$ and degree $d = \Theta(n^{4/5})$ exist by constructing a graph in the split Cayley hexagon, matching the known upper bound. This resolves the first open case for $K_k$-free graphs after $k=3$ for which Alon gave a tight construction in 1994. This has a variety of implications for $K_4$-free pseudorandom graphs. Furthermore, it implies an explicit lower bound on the Ramsey number of $r(4, t) \geq t^{1.\overline{6} - o(1)}$, improving the previous record by Kostochka, Pudl\'ak, and R\"odl of $r(4, t) \geq t^{1.6-o(1)}$.
In this paper we prove that every graph $G$ with no induced six-vertex path satisfies $\chi(G)\le \omega(G)^{c\log_2\omega(G)}$ for $c=45/\log_2(4/3)<109$. The best previous bound was exponential in $\omega(G)$. Our result is the first quasi-polynomial bound for $P_6$-free graphs and generalizes the bound for $P_5$-fre...
For ordered graphs $H_1,\ldots,H_t$, let $\rt(H_1,\ldots,H_t)$ denote the least integer $N$ such that every $t$-coloring of the edges of the naturally ordered complete graph on $[N]$ contains an ordered copy of $H_i$ in color $i$ for some $i\in[t]$. We prove that a uniformly random ordered matching $M$ on $n$ vertices...
Given any fixed integer $k \ge 2$ and sufficiently large $d$, we show that the largest possible fractional chromatic number of a $k$-uniform $d$-degenerate uncrowded hypergraph $H$ (i.e., with girth at least $5$) satisfies \[ \chi_f(H) = (1 + o_d(1)) \left((k-1)\,\frac{d}{\log d}\right)^{\frac{1}{k-1}}. \] In fact, we...
Abhishek Dhawan, Li-Na Li, Abhishek Methuku et al.· 0 citations
We prove that there is an absolute positive constant $c$ such that every bipartite graph with $N$ vertices in each part and at least $N^2/2$ edges contains a complete bipartite graph $K_{t,t}$ whenever $N\ge c\, 2^{t}$. This improves the classical K\H{o}v\'ari-S\'os-Tur\'an bound requiring $N$ of order $t\,2^t $. As a...
The set-coloring Ramsey number $R(k;r,s)$ is the least $N$ such that every assignment of an $s$-element subset of $[r]$ to each edge of $K_N$ yields a copy of $K_k$ whose edges share a common color. For every fixed prime power $q$, we construct infinitely many positive integer triples $(r,j,s)$ with $j\sim(q-1)^{-2/3}r...
Let $B_k$ denote the book consisting of $k$ triangles sharing a common edge. We prove that there exist absolute constants $\rho>0$ and $N$ such that, for every pair of integers $n,k$ with $n\ge N$ and $2\le k\le \rho n$, writing $n=5q+r$ with $0\le r<5$, \[ \operatorname{ex}(n,C_5,B_k)=q^{\,5-r}(q+1)^r, \] with the bal...
Wen-Tao Hu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.