ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ht(Δ)h_t(\Delta) be the smallest integer such that every graph with ht(Δ)h_t(\Delta) edges and maximum degree at most Δ\Delta contains two edges whose distance is at least tt; equivalently, ht(Δ)−1h_t(\Delta)-1 is the largest number of edges in a graph of maximum degree at most Δ\Delta whose line graph has diameter at most tt. Here h3(Δ)h_3(\Delta) denotes the case t=3t=3.

Cubic edge diameter conjecture.

h3(Δ)≤Δ3−Δ2+Δ+2,h_3(\Delta)\leq \Delta^3-\Delta^2+\Delta+2,

with equality if Δ\Delta is one more than a prime power.

The bound is motivated by point-line incidence graphs of finite projective planes, which attain Δ3−Δ2+Δ\Delta^3-\Delta^2+\Delta edges before a one-edge subdivision. The conjecture has been confirmed for Δ=3\Delta=3, where h3(3)=23h_3(3)=23, but remains open in general.

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.