ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let uk(G) u_k(G) denote the maximum number of edges in a kk-matching of GG, that is, a set of edges in which every vertex is incident with at most kk edges. A graph is nearly bipartite if it contains a vertex ww such that G−wG-w is bipartite.

Nearly bipartite matching conjecture. For any k≥2k\geq 2 and any nearly bipartite graph GG,

νk(G)≥⌊νk−1(G)+νk+1(G)2⌋.\nu_k(G)\geq \left\lfloor\frac{\nu_{k-1}(G)+\nu_{k+1}(G)}{2}\right\rfloor.

This conjecture predicts a discrete convexity property for the maximum sizes of kk-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 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.