Rainbow Ramsey simple structures

DOI10.1016/j.disc.2016.04.021zbMath1339.05415arXiv1411.6678OpenAlexW2254581752MaRDI QIDQ2629299

Claude Laflamme, Natasha Dobrinen, Norbert W. Sauer

Publication date: 5 July 2016

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

Full work available at URL: https://arxiv.org/abs/1411.6678

zbMATH Keywords

partition theoryrainbow Ramseyhomogeneous relational structuresbounded colouring

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Ramsey theory (05D10)

Related Items

Some remarks on uncountable rainbow Ramsey theory ⋮ Big Ramsey degrees of 3-uniform hypergraphs are finite ⋮ Forcing with copies of the Rado and Henson graphs ⋮ THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ Stationary and closed rainbow subsets ⋮ Ramsey Theory on Trees and Applications

Cites Work

• Rainbow generalizations of Ramsey theory: A survey
• Coloring subgraphs of the Rado graph
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Partitions of finite relational and set systems
• Edge partitions of the countable triangle free homogeneous graph
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Multicolored subsets in colored hypergraphs
• Forcing Positive Partition Relations
• The strength of the rainbow Ramsey Theorem