The smallest 5-chromatic tournament

DOI10.1090/mcom/3887zbMath1526.05058arXiv2210.09936MaRDI QIDQ6076253

Théo Pierron, Thomas Bellitto, Adam Kabela, Nicolas Bousquet

Publication date: 23 October 2023

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.09936

zbMATH Keywords

digraphtournamentcoloring5-chromatic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• The edge density of critical digraphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• The 3 and 4-dichromatic tournaments of minimum order
• On tournaments free of large transitive subtournaments
• The dichromatic number of a digraph
• The minimum number of edges in 4-critical digraphs of given order
• Hajós and Ore constructions for digraphs
• Practical graph isomorphism. II.
• Dichromatic number, circulant tournaments and Zykov sums of digraphs
• The Voting Problem
• Small graphs with chromatic number 5: A computer search
• On minimal triangle‐free 6‐chromatic graphs
• The smallest triangle-free 4-chromatic 4-regular graph
• Disproof of a conjecture of Erdös and moser on tournaments
• Unnamed Item
• Unnamed Item

This page was built for publication: The smallest 5-chromatic tournament