ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let fn(n)f_n(n) denote the spectral Nordhaus–Gaddum function defined in the paper for graphs of order nn. Asymptotic conjecture for fn(n)f_n(n).

fn(n)=2n2+O(1).f_n(n)=\frac{\sqrt{2}n}{2}+O(1).

The paper proves the lower bound fn(n)>2n/2−3f_n(n)>\sqrt{2}n/2-3 and establishes the corresponding upper bound for f2(n)f_2(n), but leaves the asserted asymptotic formula for fn(n)f_n(n) as a conjecture.

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.