INFINITE COMBINATORICS PLAIN AND SIMPLE

DOI10.1017/jsl.2018.8zbMath1439.03083arXiv1705.06195OpenAlexW2963203438WikidataQ129079848 ScholiaQ129079848MaRDI QIDQ4692090

Dániel T. Soukup, Lajos Soukup

Publication date: 26 October 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.06195

zbMATH Keywords

chromatic numbercloudscoloringCantorBernsteinelementary submodelsalmost disjointsplendid spacecountably closed modelDavies-tree

Mathematics Subject Classification ID

Consistency and independence results (03E35) Consistency and independence results in general topology (54A35) Other combinatorial set theory (03E05) Applications of model theory (03C98) Infinite graphs (05C63)

Related Items

On the weak pseudoradiality of CSC spaces ⋮ Unnamed Item ⋮ Reducing the dichromatic number via cycle reversions in infinite digraphs ⋮ Telgársky's conjecture may fail ⋮ The independence of \(\mathsf{GCH}\) and a combinatorial principle related to Banach-Mazur games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((\lambda ,\kappa )\)-Freese-Nation property for Boolean algebras and compacta
• Splitting families of sets in ZFC
• Trees, ladders and graphs
• On the strong Freese-Nation property
• Families close to disjoint ones
• Chang's conjecture for \(\aleph_\omega\)
• More countably compact, locally countable spaces
• Connectivity and chromatic number of infinite graphs
• On countably compact, locally countable spaces
• Discrete and computational geometry. The Goodman-Pollack Festschrift
• Applications of elementary submodels in general topology
• Conflict free colorings of (strongly) almost disjoint set-systems
• The chromatic number of infinite graphs - A survey
• Elementary submodels in infinite combinatorics
• Walks on ordinals and their characteristics
• Noetherian types of homogeneous compacta and dyadic compacta
• Separability properties of almost-disjoint families of sets
• MAD Saturated Families and SANE Player
• On the consistency of local and global versions of Chang’s Conjecture
• Conflict-Free Colourings of Graphs and Hypergraphs
• Simplified morasses
• The Colouring Number
• Splitting Strongly Almost Disjoint Families
• A very weak square principle
• How many clouds cover the plane?
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• On a lattice problem of H. Steinhaus
• Survey of the Steinhaus Tiling Problem
• Sur le recouvrement du plan par une infinité dénombrable de courbes congruentes
• Set Theory
• On chromatic number of graphs and set-systems
• Covering the Plane with Denumerably Many Curves
• Saturated Families
• Sur le coloriage des graphs
• Three clouds may cover the plane