ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with matching number u(G) u(G) and saturation number μ(G)\mu(G) satisfying

μ(G)ν(G)<1.\dfrac{\mu(G)}{\nu(G)}<1.

Let M,H,H′M,H,H' satisfy the conditions that MM is a maximum matching and that are specified in the source. Leaf-end conjecture. If GG is bipartite, then the end-vertices of maximal MM-HH alternating paths, which are also end-vertices of even maximal HH-H′H' alternating paths, are leaves. This conjecture would greatly restrict the possible locations of unmatched edges in bipartite graphs; the supplied text gives no resolution, so its status 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.