The chromatic number of random graphs: an approach using a recurrence relation

The chromatic number of random graphs: an approach using a recurrence relation

Finding the chromatic number of large graphs is known to be NP-hard. Although various algorithms have been developed to efficiently compute chromatic numbers, they still take an enormous amount of time for large graphs. In this paper, we propose the recurrence relation to obtain the expected value o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Abe, Yayoi, Setoh, Ayuna, Yoneda, Gen
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Finding the chromatic number of large graphs is known to be NP-hard. Although various algorithms have been developed to efficiently compute chromatic numbers, they still take an enormous amount of time for large graphs. In this paper, we propose the recurrence relation to obtain the expected value of the chromatic number of random graphs in a short time.
DOI:10.48550/arxiv.2412.01374