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 , then . This conjecture was disproven by several papers and the current best-known bounds for this problem are for some constants . A consequence of our work here proves that More generally, for each integer , we establish that by demonstrating that subsets of points for which no points lie on a line give rise to -free graphs, where PG is the projective space of dimension over the finite field of 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}
}