ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A kk-connected graph GG is clique-critical if it is non-complete and kappa(G−V(K))=kappa(G)−∣V(K)∣kappa(G-V(K))=kappa(G)-|V(K)| for every clique KK in GG.

Mader's conjecture. There is no clique-critical kk-connected graph.

The conjecture asks whether deleting every clique can always reduce connectivity by its order in a non-complete kk-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 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.