A problem of Laczkovich: how dense are set systems with no large independent sets?

DOI10.1016/j.apal.2015.09.004zbMath1355.03035OpenAlexW2372950453MaRDI QIDQ2630826

Péter Komjáth

Publication date: 22 July 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2015.09.004

zbMATH Keywords

forcingindependent setchromatic numberinfinite set systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Continuum hypothesis and Martin's axiom (03E50) Other combinatorial set theory (03E05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideals and differential operators in the ring of polynomials of infinitely many variables
• Combinatorial set theory: Partition relations for cardinals
• Partitioning pairs of countable ordinals
• Distinct representatives of subsets

This page was built for publication: A problem of Laczkovich: how dense are set systems with no large independent sets?