ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple undirected graph of order nn, with adjacency eigenvalues λ1(G)≥λ2(G)≥⋯≥λn(G)\lambda_1(G)\geq\lambda_2(G)\geq\cdots\geq\lambda_n(G) and spread s(G):=λ1(G)−λn(G)s(G):=\lambda_1(G)-\lambda_n(G). Let G(n,k):=Kk∨Kn−k‾G(n,k):=K_k\vee\overline{K_{n-k}}, where KkK_k is the clique of order kk and Kn−k‾\overline{K_{n-k}} is the independent set on n−kn-k vertices, and let s(n)s(n) denote the maximum spread over all graphs of order nn. Gregory–Hershkowitz–Kirkland conjecture. For any positive integer nn, the graph of order nn with maximum spread is G(n,⌊2n/3⌋)G(n,\lfloor 2n/3\rfloor); that is, s(n)s(n) is attained only by G(n,⌊2n/3⌋)G(n,\lfloor 2n/3\rfloor). The paper states that this is one of two conjectures resolved there, proving the claim for all sufficiently large nn using graph limits and numerical analysis.

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.