Graph-intersecting set systems and LYM inequalities

DOI10.1016/j.disc.2016.08.027zbMath1351.05183OpenAlexW2549740858MaRDI QIDQ729770

Lucia Moura, Elizabeth Maltais, Michael W. Newman

Publication date: 22 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.08.027

zbMATH Keywords

packingcovering arraygraph-intersecting collectionintersecting set systemLYM inequalityqualitative independence

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Sperner theorem on unrelated chains of subsets
• On the maximum number of qualitative independent partitions
• A Sperner-type theorem and qualitative independence
• Lower bounds for transversal covers
• A generalization of the AZ identity
• Capacities: From information theory to extremal set theory
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• Sperner capacities
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On A Problem of Purdy Related to Sperner Systems
• On generalized graphs
• A finite set covering theorem III
• The Transitive Reduction of a Directed Graph

This page was built for publication: Graph-intersecting set systems and LYM inequalities