Edge partitions of the countable triangle free homogeneous graph

DOI10.1016/S0012-365X(97)00169-6zbMath0955.05089OpenAlexW1986338026MaRDI QIDQ1584244

Norbert W. Sauer

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00169-6

zbMATH Keywords

coloringcountable triangle free homogeneous graphedge partition problems

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

The Ramsey theory of Henson graphs ⋮ Rainbow Ramsey simple structures ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ The Ramsey theory of the universal homogeneous triangle-free graph ⋮ Counting canonical partitions in the random graph ⋮ Ramsey Theory on Trees and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring of universal graphs
• Theory of relations. Transl. from the French by P. Clote
• Some partitions of three-dimensional combinatorial cubes
• Edge partitions of the Rado graph
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• On the Divisibility of Homogeneous Directed Graphs

This page was built for publication: Edge partitions of the countable triangle free homogeneous graph