Basis theorems for continuous n-colorings
From MaRDI portal
(Redirected from Basis theorems for continuous n-colorings)
Basis theorems for continuous \(n\)-colorings
Basis theorems for continuous \(n\)-colorings
Recommendations
- Continuous colorings associated with certain characteristics of the continuum
- Basis theorems for non-potentially closed sets and graphs of uncountable Borel chromatic number
- The colouring existence theorem revisited
- BROOKS’ THEOREM FOR MEASURABLE COLORINGS
- Nondegenerate colourings in the Brooks theorem
- Generalized Kneser coloring theorems with combinatorial proofs
- Continuous sets of the boundary classes of graphs for coloring problems
- The colour theorems of Brooks and Gallai extended
- Erdős-Ko-Rado-type theorems for colored sets
- Full Color Theorems for L(2,1)-Colorings
Cites work
- A dual open coloring axiom
- A five element basis for the uncountable linear orders
- A Partition Theorem For Perfect Sets
- A Ramsey theorem for trees
- Borel chromatic numbers
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- Convex decompositions in the plane and continuous pair colorings of the irrationals
- Homogeneity for Open Partitions of Pairs of Reals
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- Introduction to Ramsey space
- On minimal non-potentially closed subsets of the plane
- Open problems in topology. II
- Some applications of the method of forcing
- The Ideal Determined by the Unsymmetric Game
Cited in
(4)
This page was built for publication: Basis theorems for continuous \(n\)-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431608)
