Point-line incidence conjecture for even-cycle-free graphs
Statement
Let be an integer. Let be a set of points in the plane and let be a set of lines in the plane. Define the incidence set and incidence graph by
The incidence graph has vertex parts and , and is -free when it contains no cycle of length .
Point-line incidence conjecture. If is -free, then
This conjecture asks whether the geometric setting admits a bound strictly smaller than the general extremal-graph upper bound. The paper presents it as an open problem and develops lower-bound constructions for point-line arrangements with prescribed girth.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.