ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N>0N>0 and r≥2r\geq 2 be fixed, and let I=(0,N]I=(0,N]. Let TG(a1,…,ar)T_G(a_1,\ldots,a_r) be the initial threshold graph obtained from RFI(N,r)(N,r). Minimality conjecture. The graph GG is minimal: if G~⪯G\widetilde{G}\preceq G is also II-eigenvalue free, then G~=G\widetilde{G}=G. This conjecture asserts that no smaller threshold graph is (0,N](0,N]-eigenvalue free. The authors report exhaustive computational searches for several positive values of NN that found no smaller example, but the general claim remains open.

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.