Kang–Nikiforov–Yuan conjecture on the spectral radius of chromatic hypergraphs
Statement
Let be an -uniform hypergraph, and let denote the number of -subsets of an -vertex set. For , let be the maximum of the polyform of over the unit sphere in the -norm. An -graph is -chromatic if its vertex set can be partitioned into classes so that no edge is contained in a single class. For nonnegative integers , let be the complete -chromatic -graph with color classes of sizes , and let be the member whose color-class sizes differ by at most one. Kang–Nikiforov–Yuan's conjecture. Let , , and let be a -chromatic -graph of order . For every ,
unless is isomorphic to . Kang–Nikiforov–Yuan established the corresponding exact theorem for -graphs; the conjecture extends their -spectral result to general uniformity and asserts uniqueness of the balanced complete -chromatic hypergraph.
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.