The minimal Dunce Hat graph conjecture
Statement
Let be a graph, and let denote its clique complex. Say that is strong -contractible when it can be reduced by the permitted strong -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 -contractible; in particular, it is the smallest graph that is -contractible but not strong -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.