ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥3k\geq 3 be an integer. Let PP be a set of nn points in the plane and let L\mathcal{L} be a set of nn lines in the plane. Define the incidence set and incidence graph by

I=I(P,L)={(p,ℓ)∈P×L:p∈ℓ},G=(P∪L,I).I=I(P,\mathcal{L})=\{(p,\ell)\in P\times\mathcal{L}:p\in\ell\},\qquad G=(P\cup\mathcal{L},I).

The incidence graph has vertex parts PP and L\mathcal{L}, and is C2kC_{2k}-free when it contains no cycle of length 2k2k.

Point-line incidence conjecture. If GG is C2kC_{2k}-free, then

∣I(P,L)∣=o(n1+1/k).|I(P,\mathcal{L})|=o\left(n^{1+1/k}\right).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.