The diameter-two conjecture for extremal connected induced subgraph counts
Statement
Let be an integer, and let be an -vertex graph. Write for its complement and let denote the number of connected induced subgraphs of . Diameter-two conjecture. If
for every graph of order , then has diameter . The conjecture concerns the maximisation counterpart to the paper's results on the minimum of this Nordhaus–Gaddum-type sum. Exhaustive searches for support it, but a proof appears difficult because adding an edge between vertices at distance 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.