Apte–Parekh–Sud token-excess matching conjecture
Statement
Let be a graph, let be its -th token graph, and define
Let denote the matching number of . Apte–Parekh–Sud's token-excess conjecture. For ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.