ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let Δ(G)\Delta(G) denote its clique complex. Say that GG is strong I\mathfrak{I}-contractible when it can be reduced by the permitted strong I\mathfrak{I}-contractions. A graph has trivial homology when all its reduced homology groups vanish. The minimal Dunce Hat graph conjecture. The graph shown in Figure is the smallest graph, by number of vertices, with trivial homology that is not strong I\mathfrak{I}-contractible; in particular, it is the smallest graph that is I\mathfrak{I}-contractible but not strong I\mathfrak{I}-contractible. The claim is based on computation through eleven vertices, while the existence of such graphs on 12, 13, or 14 vertices was not settled in the surrounding discussion.

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.