The extremal-number conjecture
The extremal-number conjecture
Let be the maximum number of edges in an -vertex graph containing no copy of . extremal-number conjecture.
The conjecture reflects the authors' belief that the geometric restrictions in the projective norm graph represent the limit of what algebraic constructions can offer, despite the occurrence of in ; proving the asserted little-oh improvement remains open.
Sources & referencesView supporting material
Primary source
Tamás Mészáros, Lajos Rónyai and Tibor Szabó, “Singer difference sets and the projective norm graph”, arXiv:1908.05591 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.