Regular 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. For an integer , an -regular graph is one in which every vertex has degree . Regular cycle-conformal brace conjecture. For each integer , the only -regular, cycle-conformal brace is . The conjecture extends the known cases: the cubic case is proved by the paper's theorem, and the case is immediate from .
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.