The $\chi$-Ramsey Problem for Triangle-Free Graphs

DOI10.1137/21M1437573zbMath1487.05090arXiv2107.12288OpenAlexW3186330835MaRDI QIDQ5074951

Freddie Illingworth, Ewan Davies

Publication date: 10 May 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

extremal graph theoryRamsey problemslist colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Cites Work

• The triangle-free process
• A note on the independence number of triangle-free graphs
• Chromatic number of finite and infinite graphs and hypergraphs
• A note on Ramsey numbers
• Coloring triangle-free graphs with fixed size
• The list chromatic number of graphs with small clique number
• Triangle-free graphs with large chromatic numbers
• Bipartite induced density in triangle-free graphs
• The asymptotic behavior of the correspondence chromatic number
• List Colouring Constants of Triangle Free Graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Coloring triangle‐free graphs with local list sizes
• The Johansson‐Molloy theorem for DP‐coloring
• Dynamic concentration of the triangle-free process
• A note on group colorings
• Asymptotic upper bounds for Ramsey functions
• Occupancy fraction, fractional colouring, and triangle fraction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The $\chi$-Ramsey Problem for Triangle-Free Graphs