ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A brace is a bipartite matching covered graph, and a graph is cycle-conformal if every even cycle CC has the property that deleting its vertices leaves a graph with a perfect matching. A complete bipartite graph is a graph of the form Km,nK_{m,n}. 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 Kℓ,ℓK_{\ell,\ell}.

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.