The leaf-end conjecture for alternating paths in bipartite graphs
Statement
Let be a connected graph with matching number and saturation number satisfying
Let satisfy the conditions that is a maximum matching and that are specified in the source. Leaf-end conjecture. If is bipartite, then the end-vertices of maximal - alternating paths, which are also end-vertices of even maximal - 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.