Structure and colour in triangle-free graphs

DOI10.37236/9267zbMath1466.05063arXiv1912.13328OpenAlexW3174897553MaRDI QIDQ2034076

N. R. Aravind, Viresh Patel, Rémi de Joannis de Verclos, Stijn Cambie, Wouter Cames van Batenburg, Ross J. Kang

Publication date: 21 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberJohansson's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Induced colorful trees and paths in large chromatic graphs
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
• The early evolution of the \(H\)-free process
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• A note on Ramsey numbers
• Induced subtrees in graphs of large chromatic number
• Colorful induced subgraphs
• The size of the largest hole in a random graph
• Coloring graphs with sparse neighborhoods
• The chromatic discrepancy of graphs
• Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
• Minors in graphs of large girth
• A survey of χ‐boundedness
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I
• On induced colourful paths in triangle-free graphs
• On the divisibility of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structure and colour in triangle-free graphs