Lianna's nearly bipartite graph convexity conjecture
Statement
Let be a nearly bipartite graph, meaning that deleting at most one vertex makes bipartite. For each integer , let denote the maximum number of edges in a -edge-colorable subgraph of .
Lianna's conjecture. For each ,
The conjecture asks for a discrete concavity relation among the maximum sizes of -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.