, Volume 1, Issue 2, pp 141–143

On the conjecture of hajós


  • Paul Erdős
    • Mathematical Institute of the Hungarian Academy of Sciences
  • Siemion Fajtlowicz
    • Department of MathematicsUniversity of Houston

DOI: 10.1007/BF02579269

Cite this article as:
Erdős, P. & Fajtlowicz, S. Combinatorica (1981) 1: 141. doi:10.1007/BF02579269


Hajós conjectured that everys-chromatic graph contains a subdivision ofKs, the complete graph ons vertices. Catlin disproved this conjecture. We prove that almost all graphs are counter-examles in a very strong sense.

AMS (1980) subject classification

05 C 1560 C 05

Copyright information

© Akadémiai Kiadó 1981