ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt be an integer satisfying t≡0,1,2(mod6)t\equiv 0,1,2\pmod{6}, and let rr be an integer with r>⌊t/6⌋r>\lfloor t/6\rfloor. The extended cube graphs are denoted by ECG⁡(t,6r−t−4)\operatorname{ECG}(t,6r-t-4). Extended-cube conjecture. These graphs have field-independent minimum rank, and their adjacency matrices are universally optimal. This conjecture is proposed as a possible characterization of the extended cube graphs for which maximum nullity equals the zero forcing number over an arbitrary field; equality does not hold for all extended cube graphs, and the conjectured field-independence and universal optimality remain unresolved in the supplied text.

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.