ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on n≥6n\geq 6 vertices. Write Pn−3K4P_{n-3}K_4 for the kite graph consisting of a path attached to a complete graph K4K_4, and let ce(G)c_e(G) denote the eigenvector dispersion of GG. Four's a Crowd conjecture. The connected graph which achieves the maximum of cec_e on n≥6n\geq 6 vertices is Pn−3K4P_{n-3}K_4. This conjecture specifies the proposed extremal kite graph for eigenvector dispersion; the surrounding discussion notes that related extremal graph problems have different optimal head sizes, but gives no resolution of this claim.

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.