Coloring of universal graphs

DOI10.1007/BF01788077zbMath0589.05053OpenAlexW2033706690MaRDI QIDQ1073812

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

infinite graphsmonochromatic copycolor classescountably universal graph

Mathematics Subject Classification ID

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

Related Items (19)

On the divisibility of homogeneous hypergraphs ⋮ A consistent edge partition theorem for infinite graphs ⋮ The Ramsey theory of Henson graphs ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ Many symmetrically indivisible structures ⋮ 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 ⋮ The Ramsey theory of the universal homogeneous triangle-free graph ⋮ ON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURES ⋮ A universal partition result for infinite homogeneous \(K_n\)-free and related graphs ⋮ Ramsey-type properties of relational structures ⋮ Infinite lexicographic products ⋮ Ramsey Theory on Trees and Applications ⋮ The indivisibility of the homogeneous \(K_ n\)-free graphs ⋮ The Urysohn sphere is oscillation stable ⋮ Embedding Graphs into Colored Graphs ⋮ Edge partitions of the countable triangle free homogeneous graph

Cites Work

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

This page was built for publication: Coloring of universal graphs