Combinatorica

, Volume 1, Issue 2, pp 141–143

On the conjecture of hajós

  • Paul Erdős
  • Siemion Fajtlowicz
Article

Abstract

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 15 60 C 05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Akadémiai Kiadó 1981

Authors and Affiliations

  • Paul Erdős
    • 1
  • Siemion Fajtlowicz
    • 2
  1. 1.Mathematical Institute of the Hungarian Academy of SciencesBudapestHungary
  2. 2.Department of MathematicsUniversity of HoustonHoustonU.S.A.

Personalised recommendations