ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let j≥1j\geq 1. For a graph GG, write s1,js_{1,j} for the maximum of the normalized spectral gap under consideration in the paper, and let Kn∗K_n^* denote the complete graph KnK_n with loops on all vertices. The graph Kj+2∪Kj+1∗K_{j+2}\cup K_{j+1}^* is the disjoint union of Kj+2K_{j+2} and Kj+1∗K_{j+1}^*; a tt-blowup replaces every vertex by an independent set of size tt and every edge or loop according to the corresponding adjacency pattern.

Extremal blowup conjecture. For any j≥1j\geq 1, we have

s1,j=j+22j+3.s_{1,j}=\frac{j+2}{2j+3}.

If the conjecture holds, the lower bound is achieved by any graph which is a tt-blowup of Kj+2∪Kj+1∗K_{j+2}\cup K_{j+1}^*.

The construction gives the lower bound s1,j≥(j+2)/(2j+3)s_{1,j}\geq (j+2)/(2j+3), while the paper notes that this value is close to the known upper bound for large jj. The asserted equality and the extremal characterization remain open in the supplied source.

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.