ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected rr-regular graph with r>0r>0. Let α(G)\alpha(G) denote the independence number of GG, and let μ(G)\mu(G) denote its matching number. TxGraffiti's independence–matching conjecture. Then

α(G)≤μ(G),\alpha(G)\leq\mu(G),

and this bound is sharp. This is a generalized form of the example conjecture produced by the filtering heuristic, illustrating how a more general graph hypothesis can be retained for the same sharp inequality.

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.