Random graph coloring and the instability

This paper explores the coloring problem, focusing on the existence of uniformly colored substructures. The study primarily examines random graphs with edge coloring and their generic substructures. The key finding is that the absence of a monochromatic generic substructure corresponds to increased...

Full description

Saved in:
Bibliographic Details
Published inMathematical logic quarterly Vol. 70; no. 4; pp. 429 - 437
Main Author Tsuboi, Akito
Format Journal Article
LanguageEnglish
Published Berlin Wiley Subscription Services, Inc 01.11.2024
Subjects
Graph coloring
Online AccessGet full text

Cover

More Information
Summary:This paper explores the coloring problem, focusing on the existence of uniformly colored substructures. The study primarily examines random graphs with edge coloring and their generic substructures. The key finding is that the absence of a monochromatic generic substructure corresponds to increased instability, meaning that the colored random graph hereditarily possesses the strict order property.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0942-5616
1521-3870
DOI:10.1002/malq.202300043