Essentially disjoint families, conflict free colorings and Shelah's revised GCH

DOI10.1007/s10474-013-0298-8zbMath1299.03054arXiv1207.1971OpenAlexW2005782150MaRDI QIDQ2448972

Yanyan Li

Publication date: 5 May 2014

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

sparseconflict-free coloringrevised GCHalmost disjointconflict-free chromatic numberessentially disjointsingular cardinal compactness

Mathematics Subject Classification ID

Large cardinals (03E55) Coloring of graphs and hypergraphs (05C15) Continuum hypothesis and Martin's axiom (03E50) Other combinatorial set theory (03E05)

Related Items (2)

Minimal vertex covers in infinite hypergraphs ⋮ Splitting families of sets in ZFC

Cites Work

• Conflict free colorings of nonuniform systems of infinite sets
• Families close to disjoint ones
• Set theory. An introduction to independence proofs
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Conflict free colorings of (strongly) almost disjoint set-systems
• The generalized continuum hypothesis revisited
• Transversals for strongly almost disjoint families
• On the complete subgraphs of graphs defined by systems of sets
• On a property of families of sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Essentially disjoint families, conflict free colorings and Shelah's revised GCH