Graphs of large chromatic number
From MaRDI portal
Publication:6198641
DOI10.4171/icm2022/149OpenAlexW4389774923MaRDI QIDQ6198641
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/149
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restricted frame graphs and a conjecture of Scott
- Coloring, sparseness and girth
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Triangle-free intersection graphs of line segments with large chromatic number
- The structure of almost all graphs in a hereditary property
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Graph minors. XX: Wagner's conjecture
- Induced subgraphs of graphs with large chromatic number. III: Long holes
- Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes
- Ramsey-type theorems
- Kneser's conjecture, chromatic number, and homotopy
- The strong perfect graph theorem
- The Erdős-Hajnal conjecture for bull-free graphs
- Ramanujan graphs
- Chromatically optimal rigid graphs
- Induced subtrees in graphs of large chromatic number
- On the complexity of testing for odd holes and induced odd paths
- Every planar map is four colorable. II: Reducibility
- A short proof of Kneser's conjecture
- Excluding hooks and their complements
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Detecting a long odd hole
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
- Pure pairs. II: Excluding all subdivisions of a graph
- Induced subgraphs of graphs with large chromatic number. VI. Banana trees
- Pure pairs. I: Trees and linear anticomplete pairs
- Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
- Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
- The Erdős-Hajnal conjecture for paths and antipaths
- Caterpillars in Erdős-Hajnal
- Recognizing Berge graphs
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Recent developments in graph Ramsey theory
- String graphs and separators
- Graph Theory and Probability
- On a Coloring Problem.
- A polynomial invariant for knots via von Neumann algebras
- On the Chromatic Number of Subgraphs of a Given Graph
- Radius two trees specify χ‐bounded classes
- Radius Three Trees in Graphs with Large Chromatic Number
- Reducibility among Combinatorial Problems
- Finding a Shortest Odd Hole
- A survey of χ‐boundedness
- Detecting an Odd Hole
- Induced subgraphs of graphs with large chromatic number. XII. Distant stars
- The Random-Cluster Model
- On chromatic number of finite set-systems
- A Contribution to the Theory of Chromatic Polynomials
- Sur le coloriage des graphs
- Ramsey-type theorems with forbidden subgraphs
- On the divisibility of graphs
This page was built for publication: Graphs of large chromatic number
