5-Regular Graphs are 3-Colorable with Positive Probability

We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Díaz, J., Grammatikopoulos, G., Kaporis, A. C., Kirousis, L. M., Pérez, X., Sotiropoulos, D. G.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Chromatic Number Computer science control theory systems Exact sciences and technology Matching Variable Positive Probability Random Graph Random Regular Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/11561071_21