ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an rr-uniform hypergraph, and let (nr)\binom{n}{r} denote the number of rr-subsets of an nn-vertex set. For p≥1p\geq 1, let λ(p)(G)\lambda^{(p)}(G) be the maximum of the polyform of GG over the unit sphere in the ℓp\ell_p-norm. An rr-graph is kk-chromatic if its vertex set can be partitioned into kk classes so that no edge is contained in a single class. For nonnegative integers n1+⋯+nk=nn_1+\cdots+n_k=n, let Q(n1,…,nk)Q(n_1,\ldots,n_k) be the complete kk-chromatic rr-graph with color classes of sizes n1,…,nkn_1,\ldots,n_k, and let Qkr(n)Q_k^r(n) be the member whose color-class sizes differ by at most one. Kang–Nikiforov–Yuan's conjecture. Let k≥2k\geq 2, r≥4r\geq 4, and let GG be a kk-chromatic rr-graph of order n>(r−1)kn>(r-1)k. For every p≥1p\geq 1,

λ(p)(G)<λ(p)(Qkr(n)),\lambda^{(p)}(G)<\lambda^{(p)}(Q_k^r(n)),

unless GG is isomorphic to Qkr(n)Q_k^r(n). Kang–Nikiforov–Yuan established the corresponding exact theorem for 33-graphs; the conjecture extends their pp-spectral result to general uniformity and asserts uniqueness of the balanced complete kk-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 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.