A graph convexity space of a connected finite graph \(G\) is a collection of closed subsets of the vertex set such that \(\varnothing\) is closed, intersections of closed sets are closed, and every closed set induces a connected subgraph. In 1987, \textit{P. Duchet} [Suppl. Rend. Circ. Mat. Palermo, II. Ser. 14, 261-293 (1987; Zbl 0644.52001)] disproved a conjecture he himself had made that the Hadwiger number is strictly greater than the Radon number for any graph convexity space over a graph not a tree. In this paper the authors present an elementary counterexample.
- scientific article; zbMATH DE number 169313
- The Dudeney-Stockmeyer conjecture
- scientific article; zbMATH DE number 4106994
- A note on Duchet's conjecture
- scientific article; zbMATH DE number 6665042
- scientific article; zbMATH DE number 3968689
- The Conley conjecture
- The Nitsche conjecture
- The Bieberbach conjecture
- scientific article; zbMATH DE number 26005
- On the null-homotopy of graphs
- The trisecant conjecture
- The Ingram conjecture
- The Dudeney-Stockmeyer conjecture
- D'Angelo conjecture in the third gap interval
- The Dipper-Du conjecture revisited
- scientific article; zbMATH DE number 5533305 (Why is no real title available?)
- scientific article; zbMATH DE number 3968689 (Why is no real title available?)
- scientific article; zbMATH DE number 2051183 (Why is no real title available?)
- scientific article; zbMATH DE number 1373447 (Why is no real title available?)
- Disconjugacy and the secant conjecture
- scientific article; zbMATH DE number 6665042 (Why is no real title available?)
- The Jespers-Van Oystaeyen conjecture
This page was built for publication: The Duchet conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265355)
