Abstract
Hajós conjectured that everys-chromatic graph contains a subdivision ofK s, the complete graph ons vertices. Catlin disproved this conjecture. We prove that almost all graphs are counter-examles in a very strong sense.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. E. Appel andW. Haken, The existence of unavoidable sets of geographically good configurations,Illinois Journal of Mathematics, vol.20, 218–297.
P. Catlin, Hajós graph-colouring conjecture: variatons and counterexamples,Journal of Combinatorial Theory, Series B (to appear in 1979).
G. A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs,Journal of London Mathematical Society,27 (1952), 85–92.
P. Erdős, Some extremal problems on families of graphs and related problems, Springer-Verlag,Lecture Notes in Mathematics,686, 13–21.
P. Erdős, Some remarks on chromatic graphs,Coll. Math. XVI (1967) 103–106.
P. Erdős, Some remarks on graph theory,Bulletin of American Mathematical Society,53 (1947), 292–299.
P. Erdős andA. Hajnal, On complete topological subaraphs of certain graphs,Ann. Univ. Sci. Budapest,7 (1969), 193–199.
S. Fajtlowicz, On the size independent sets in graphs,Proceedings of the IX Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Math, Congress. Num. XXI, (1978) 269–274.
H. Hadwiger, Über eine Klassifikationen der Streckenkomplexe,Vierteljschr. Naturforsch. Ges. Zürich,88 (1943), 133–143.
G. Hajós, Über eine Konstruktion nichtn-Farbbarer Graphen,Wiss. Z. Martin Luther Univ. Halle — Wittenberg Math. Naturwiss. Reihe 10 (1961), 116–117.
W. Tutte, Colouring Problems,Mathematical Intelligencer 1 (1978), 72–75.