ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a nearly bipartite graph, meaning that deleting at most one vertex makes GG bipartite. For each integer kgeq1kgeq 1, let νk(G)\nu_k(G) denote the maximum number of edges in a kk-edge-colorable subgraph of GG.

Lianna's conjecture. For each k≥1k\geq 1,

ν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.

The conjecture asks for a discrete concavity relation among the maximum sizes of kk-edge-colorable subgraphs. The paper also mentions a bipartite analogue in which the floor is omitted; that analogue is proved later in the paper.

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.