New constructions of unbalanced \C4,θ3, t\-free bipartite graphs

Abstract

In 1979, Erdos conjectured that if m = O(n2/3), then ex(n, m, \C4, C6 \) = O(n). This conjecture was disproven by several papers and the current best-known bounds for this problem are c1n1 + 115 ≤ ex(n, n2/3, \C4, C6\) ≤ c2n1 + 1/9 for some constants c1, c2. A consequence of our work here proves that ex(n, n2/3, \ C4, θ3, 4 \) = (n1 + 1/9). More generally, for each integer t ≥ 2, we establish that ex(n, nt+22t+1, \ C4, θ3, t \) = (n1 + 12t+1) by demonstrating that subsets of points S ⊂eq PG(n,q) for which no t+1 points lie on a line give rise to \ C4, θ3, t \-free graphs, where PG(n,q) is the projective space of dimension n over the finite field of q elements.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…