Coloring of universal graphs

DOI10.1007/BF01788077MaRDI QIDQ1073812zbMATH OpenOpenAlexFDO

Authors Péter Komjáth, Vojtěch Rödl

Publication date 1986

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788077

zbMATH Keywords

color classescountably universal graphinfinite graphsmonochromatic copy

Mathematics Subject Classification ID

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

Recommendations

• Publication:4732473
• Chromatic Ramsey theory
• Embedding Graphs into Colored Graphs
• scientific article; zbMATH DE number 3262991
• Embedding finite graphs into graphs colored with infinitely many colors

Cites work

• A family of countable homogeneous graphs
• Countable Ultrahomogeneous Undirected Graphs
• Cyclic automorphisms of a countable graph and random sum-free sets
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

Cited in

(27)

• The Urysohn sphere is oscillation stable
• Ramsey-type properties of relational structures
• On the divisibility of homogeneous hypergraphs
• A consistent edge partition theorem for infinite graphs
• The existence of uniquely \(-G\) colourable graphs
• Edge partitions of the countable triangle free homogeneous graph
• The indivisibility of the homogeneous \(K_ n\)-free graphs
• The Ulam number of infinite graphs
• The complexity of generalized graph colorings
• A universal partition result for infinite homogeneous K_n-free and related graphs
• Infinite lexicographic products
• Many symmetrically indivisible structures
• On products of elementarily indivisible structures
• Embedding Graphs into Colored Graphs
• scientific article; zbMATH DE number 4118372 (Why is no real title available?)
• DOWNWARD UNARY COLORINGS
• The Ramsey theory of the universal homogeneous triangle-free graph
• Ramsey Theory on Trees and Applications
• The Ramsey theory of Henson graphs
• Chromatic Ramsey theory
• Ramsey theory of homogeneous structures: current trends and open problems
• Products of classes of finite structures
• Forcing with copies of the Rado and Henson graphs
• Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
• Indivisibility for classes of graphs
• Big Ramsey degrees using parameter spaces
• The externally definable Ramsey property and fixed points on type spaces

This page was built for publication: Coloring of universal graphs

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