ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a global amoeba graph of order nn and minimum degree 11. Let e(G)e(G) denote its number of edges, let ⌊n2/4⌋\lfloor n^2/4\rfloor be the floor of n2/4n^2/4, and let HnH_n be the graph defined in Example 2(c) of the source.

Extremal global amoeba conjecture.

e(G)=⌊n24⌋e(G)=\left\lfloor\frac{n^2}{4}\right\rfloor

if and only if G≅HnG\cong H_n.

The graph HnH_n is shown to have the largest density among global amoebas of minimum degree 11; the conjecture asserts that it is the unique graph attaining this extremal edge count, up to isomorphism.

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.