Teschner's conjecture on the upper bondage number of critical graphs
Teschner's conjecture on the upper bondage number of critical graphs
Let be additive and hereditary. A graph is vertex--critical if its vertex domination number with respect to has the criticality property used in the paper, and let denote its upper bondage number and its maximum degree. Teschner's conjecture. For any vertex--critical graph ,
The conjecture is presented as the main outstanding conjecture on the ordinary bondage number when ; its general status is not resolved in the supplied source.
Sources & referencesView supporting material
Primary source
Vladimir Samodivkin, “Changing of the domination number of a graph: edge multisubdivision and edge removal”, arXiv:1502.06245 (2015).
Additional references
3 papers in this index state this conjecture (2010–2015). The statement above is taken from the most recent of them; the others are arXiv:1204.4010, arXiv:1012.4117.
Progress summary
The conjecture remains open: no verified proof or counterexample was found for either the general statement or its ordinary graph version.
Teschner proposed the ordinary inequality in 1995; the property-relative version asks whether holds for every vertex--critical graph. The supplied sources contain no proof or refutation of this generalization.
Known results
- Teschner (1993) disproved the earlier bound using .
- Hartnell–Rall and Teschner independently obtained for .
- Kang and Yuan (2000) proved the planar bound .
- Samodivkin (2013) extended ordinary domination and bondage results to nondegenerate graph properties and posed related conjectures.
Current status (as of August 2026): The ordinary conjecture and the general -version remain unproved and unrefuted in the supplied record, despite established special-case bounds.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.