Weak Borel chromatic numbers

DOI10.1002/MALQ.201010001zbMATH Open1209.03041OpenAlexW2003839646MaRDI QIDQ3077397FDOQ3077397

Authors: Stefan Geschke 

Publication date: 22 February 2011

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201010001

Recommendations

• Borel chromatic numbers
• Borel chromatic number of closed graphs
• A bound on measurable chromatic numbers of locally finite Borel graphs
• Measurable chromatic numbers
• Basis theorems for non-potentially closed sets and graphs of uncountable Borel chromatic number

zbMATH Keywords

chromatic numberinfinite graphPolish spaceBorel sets

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Descriptive set theory (03E15) Consistency and independence results (03E35)

Cites Work

• Title not available (Why is that?)
• Perfect cliques and $G_\delta $ colorings of Polish spaces
• A Partition Theorem For Perfect Sets
• Borel chromatic numbers
• Analytic colorings
• Basis theorems for non-potentially closed sets and graphs of uncountable Borel chromatic number
• Convex decompositions in the plane and continuous pair colorings of the irrationals
• Measurable chromatic numbers
• Covering $\mathbb R^{n+1}$ by graphs of $n$-ary functions and long linear orderings of Turing degrees

Cited In (10)

• Hypergraphs and proper forcing
• Cardinal invariants of closed graphs
• Borel chromatic numbers
• A bound on measurable chromatic numbers of locally finite Borel graphs
• Measurable chromatic numbers
• Borel chromatic number of closed graphs
• Ramsey and freeness properties of Polish planes
• Non-meager free sets for meager relations on Polish spaces
• The open dihypergraph dichotomy and the second level of the Borel hierarchy
• Clopen graphs

This page was built for publication: Weak Borel chromatic numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077397)