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

DOI10.1007/S10474-013-0298-8zbMATH Open1299.03054arXiv1207.1971OpenAlexW2005782150MaRDI QIDQ2448972FDOQ2448972

Authors: Yanyan Li 

Publication date: 5 May 2014

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

Abstract: Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of size < |b| such that the family {b-f(b) b in B} is disjoint. We also show that if mu<=kappa<=lambda, and kappa is infinite, and (x) every mu-almost disjoint subfamily of [lambda]^kappa is essentially disjoint, then (xx) every mu-almost disjoint family B of subsets of lambda with |b|>=kappa for all b from B has a conflict-free colorings with kappa colors. Putting together these results we obtain that if mu<beth_omega<=lambda, then every mu-almost disjoint family B of subsets of lambda with |b|>=beth_omega for all b from B has a conflict-free colorings with beth_omega colors. To yield the above mentioned results we also need to prove a certain compactness theorem concerning singular cardinals.

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

Recommendations

• Conflict free colorings of (strongly) almost disjoint set-systems
• CONFLICT-FREE COLORINGS OF SHALLOW DISCS
• Conflict-free colourings of graphs and hypergraphs
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• Remarks on proper conflict-free colorings of graphs
• On variants of conflict-free-coloring for hypergraphs
• Disconnected colors in generalized Gallai-colorings
• Conflict-free coloring and its applications
• Conflict free colorings of nonuniform systems of infinite sets
• Nordhaus–Gaddum problem in terms of G-free coloring

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Separability properties of almost-disjoint families of sets
• Splitting families of sets in ZFC
• Minimal vertex covers in infinite hypergraphs
• Conflict free colorings of (strongly) almost disjoint set-systems
• Incompactness in regular cardinals

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

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