English

New constructions of unbalanced $\{C_4,\theta_{3, t}\}$-free bipartite graphs

Combinatorics 2025-03-25 v1

Abstract

In 1979, Erd\H{o}s conjectured that if m=O(n2/3)m = O(n^{2/3}), then ex(n,m,{C4,C6})=O(n)ex(n, m, \{C_4, C_6 \}) = O(n). This conjecture was disproven by several papers and the current best-known bounds for this problem are c1n1+115ex(n,n2/3,{C4,C6})c2n1+1/9 c_1n^{1 + \frac{1}{15}} \leq ex(n, n^{2/3}, \{C_4, C_6\}) \leq c_2n^{1 + 1/9} for some constants c1,c2c_1, c_2. A consequence of our work here proves that ex(n,n2/3,{C4,θ3,4})=Θ(n1+1/9). ex(n, n^{2/3}, \{ C_4, \theta_{3, 4} \}) = \Theta(n^{1 + 1/9}). More generally, for each integer t2t \geq 2, we establish that ex(n,nt+22t+1,{C4,θ3,t})=Θ(n1+12t+1) ex(n, n^{\frac{t+2}{2t+1}}, \{ C_4, \theta_{3, t} \}) = \Theta(n^{1 + \frac{1}{2t+1}}) by demonstrating that subsets of points SPG(n,q)S \subseteq \text{PG}(n,q) for which no t+1t+1 points lie on a line give rise to {C4,θ3,t}\{ C_4, \theta_{3, t} \}-free graphs, where PG(n,q)(n,q) is the projective space of dimension nn over the finite field of qq elements.

Keywords

Cite

@article{arxiv.2503.18418,
  title  = {New constructions of unbalanced $\{C_4,\theta_{3, t}\}$-free bipartite graphs},
  author = {Baran Düzgün and Ago-Erik Riet and Vladislav Taranchuk},
  journal= {arXiv preprint arXiv:2503.18418},
  year   = {2025}
}