ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PA(n,q)PA(n,q) be the pineapple graph consisting of a clique on qq vertices together with a stable set on n−qn-q vertices, with one vertex of the clique adjacent to every vertex of the stable set. Let ϵ(G)\epsilon(G) denote the degree deviation of a graph GG. Pineapple extremal conjecture. Among all graphs on n≥10n\geq 10 vertices, the graph with the highest value of ϵ(G)\epsilon(G) is

G=PA(n,q),q=⌊n2⌋+1.G=PA(n,q),\qquad q=\left\lfloor\frac{n}{2}\right\rfloor+1.

This conjecture concerns the extremal graphs for degree deviation. The supplied text gives no resolution or partial result for the assertion.

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.