Cycle-conformal braces are complete bipartite graphs
Statement
A brace is a bipartite matching covered graph, and a graph is cycle-conformal if every even cycle has the property that deleting its vertices leaves a graph with a perfect matching. A complete bipartite graph is a graph of the form . Complete-bipartite brace conjecture. Each cycle-conformal brace is a complete bipartite graph. This is stated as a stronger conjecture than the regular version, but the source gives no resolution beyond the known regular cases; it would imply that every regular cycle-conformal brace is .
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.