New constructions of unbalanced -free bipartite graphs
arXiv:2503.18418
Abstract
In 1979, Erdő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.