Mader's nonexistence conjecture for clique-critical graphs
Statement
A -connected graph is clique-critical if it is non-complete and for every clique in .
Mader's conjecture. There is no clique-critical -connected graph.
The conjecture asks whether deleting every clique can always reduce connectivity by its order in a non-complete -connected graph. The source gives no resolution evidence.
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.