, Volume 1, Issue 2, pp 141-143

On the conjecture of hajós

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.