Convexity conjecture for matching numbers of nearly bipartite graphs
Statement
Let be a graph and let denote the maximum number of edges in a -matching of , that is, a set of edges in which every vertex is incident with at most edges. A graph is nearly bipartite if it contains a vertex such that is bipartite.
Nearly bipartite matching conjecture. For any and any nearly bipartite graph ,
This conjecture predicts a discrete convexity property for the maximum sizes of -matchings in nearly bipartite graphs. The supplied text gives no resolution status.
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.