Chromatic Ramsey theory

DOI10.1006/EUJC.1993.0075MaRDI QIDQ5961465zbMATH OpenOpenAlexFDO

Authors Norbert Sauer, R. E. Woodrow, Vojtěch Rödl

Publication date 18 August 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1993.0075

zbMATH Keywords

Ramsey theorycolorsinfinite cliquesinfinite chromatic subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• Embedding finite graphs into graphs colored with infinitely many colors
• Finite subgraphs of uncountably chromatic graphs
• scientific article; zbMATH DE number 3245178
• Coloring of universal graphs
• Forcing constructions for uncountably chromatic graphs

Cited in

(9)

• The Ramsey theory of Henson graphs
• Constructions of infinite graphs with Ramsey property
• Borel chromatic numbers
• Ramsey's theorem for colors from a metric space
• Chromatic graphs, Ramsey numbers and the flexible atom conjecture
• On the abstract chromatic number and its computability for finitely axiomatizable theories
• Coloring of universal graphs
• The Ramsey theory of the universal homogeneous triangle-free graph
• scientific article; zbMATH DE number 5014483 (Why is no real title available?)

This page was built for publication: Chromatic Ramsey theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961465)