A partition theorem for the complete graph on \(\omega^\omega\)
From MaRDI portal
Publication:2562081
DOI10.1016/0097-3165(72)90105-7zbMath0266.04003OpenAlexW1975200136MaRDI QIDQ2562081
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(72)90105-7
Combinatorial aspects of partitions of integers (05A17) Graph theory (05C99) Other combinatorial set theory (03E05) Set theory (03E99)
Related Items (8)
Some partitions of three-dimensional combinatorial cubes ⋮ Formalizing Ordinal Partition Relations Using Isabelle/HOL ⋮ Some remarks on polarized partition relations ⋮ A counter-example in the partition calculus for an uncountable ordinal ⋮ Countable partition ordinals ⋮ Partition relations for uncountable ordinals ⋮ The quasi order of graphs on an ordinal ⋮ Negative partition relations for ordinals \(\omega^{\omega^\alpha}\)
Cites Work
This page was built for publication: A partition theorem for the complete graph on \(\omega^\omega\)
