ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥5n\geq 5 be an integer, and let GG be an nn-vertex graph. Write G‾\overline{G} for its complement and let η(G)\eta(G) denote the number of connected induced subgraphs of GG. Diameter-two conjecture. If

η(G)+η(G‾)≥η(H)+η(H‾)\eta(G)+\eta(\overline{G})\geq \eta(H)+\eta(\overline{H})

for every graph HH of order nn, then GG has diameter 22. The conjecture concerns the maximisation counterpart to the paper's results on the minimum of this Nordhaus–Gaddum-type sum. Exhaustive searches for n=5,6,7n=5,6,7 support it, but a proof appears difficult because adding an edge between vertices at distance 33 does not always increase the sum.

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.