Extremal blowup conjecture for the maximum spectral gap s_1,j
Statement
Let . For a graph , write for the maximum of the normalized spectral gap under consideration in the paper, and let denote the complete graph with loops on all vertices. The graph is the disjoint union of and ; a -blowup replaces every vertex by an independent set of size and every edge or loop according to the corresponding adjacency pattern.
Extremal blowup conjecture. For any , we have
If the conjecture holds, the lower bound is achieved by any graph which is a -blowup of .
The construction gives the lower bound , while the paper notes that this value is close to the known upper bound for large . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.