Basis theorems for continuous \(n\)-colorings

DOI10.1016/j.jcta.2010.12.006zbMath1231.05095OpenAlexW2033640504MaRDI QIDQ2431608

Stefanie Frick, Stefan Geschke

Publication date: 15 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.12.006

zbMATH Keywords

basisclopen hypergraphcontinuous coloringhomogeneity number

Mathematics Subject Classification ID

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

Related Items (1)

Non-meager free sets for meager relations on Polish spaces

Cites Work

• On minimal non-potentially closed subsets of the plane
• A five element basis for the uncountable linear orders
• A Ramsey theorem for trees
• Borel chromatic numbers
• Convex decompositions in the plane and continuous pair colorings of the irrationals
• A dual open coloring axiom
• Homogeneity for Open Partitions of Pairs of Reals
• Introduction to Ramsey Spaces (AM-174)
• A Partition Theorem For Perfect Sets
• CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
• The Ideal Determined by the Unsymmetric Game
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Basis theorems for continuous \(n\)-colorings