Same graph, different universe
From MaRDI portal
Publication:2408074
DOI10.1007/s00153-017-0551-xzbMath1417.03265OpenAlexW2613913757MaRDI QIDQ2408074
Publication date: 9 October 2017
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-017-0551-x
Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Infinite graphs (05C63)
Related Items (2)
A microscopic approach to Souslin-tree constructions. I. ⋮ Hedetniemi's conjecture for uncountable graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Chromatic numbers of graphs -- large gaps
- Consistently \(\mathcal P(\omega_{1})\) is the union of less than \(2^{\aleph _1}\) strongly independent families
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
- Graph colorings and the axiom of choice
- Inequalities for cardinal powers
- The consistency with CH of some consequences of Martin's axiom plus \(2^{\aleph_0}>\aleph_1\)
- Borel chromatic numbers
- Axiom of choice and chromatic number of the plane
- A microscopic approach to Souslin-tree constructions. I.
- A model of set-theory in which every set of reals is Lebesgue measurable
- Some results on higher Suslin trees
- NO BOUND FOR THE FIRST FIXED POINT
- The Mathematical Coloring Book
- Embedding Graphs into Colored Graphs
- When Does Almost Free Imply Free? (For Groups, Transversals, etc.)
- Embedding Trees in the Rationals
This page was built for publication: Same graph, different universe