ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph, let Fk(G)F_k(G) be its kk-th token graph, and define

ε⁡kT(G)=λ1(L(Fk(G)))−∣E∣.\operatorname{\varepsilon}_k^T(G)=\lambda_1(L(F_k(G)))-|E|.

Let ν(G)\nu(G) denote the matching number of GG. Apte–Parekh–Sud's token-excess conjecture. For 1≤k≤∣V∣1\le k\le |V|,

ε⁡kT(G)≤ν(G).\operatorname{\varepsilon}_k^T(G)\le \nu(G).

This conjecture is stated after the paper's bounds for token graphs; those bounds do not establish the proposed matching-number upper bound, and the supplied status gives no resolution.

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.