• Citer

The chromatic number of random lifts of K5 \ e

par Farzad, Babak;Theis, Dirk
Référence Electronic Notes in Discrete Mathematics, 35, C, page (311-316)
Publication Publié, 2009-12

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Amit, Linial, and Matoušek (Random lifts of graphs III: independence and chromatic number, Random Struct. Algorithms, 2002) have raised the following question: Is the chromatic number of random h-lifts of K5 asymptotically (for h → ∞) almost surely (a.a.s.) equal to a single number? In this paper, we offer the following partial result: The chromatic number of a random lift of K5 \ e is a.a.s. three. We actually prove a stronger statement where K5 \ e can be replaced by a graph obtained from joining a cycle to a stable set. © 2009 Elsevier B.V. All rights reserved.