\(d\)-cluster-free sets with a given matching number

DOI10.1016/j.ejc.2019.103000zbMath1419.05178arXiv1811.07064OpenAlexW2964872552MaRDI QIDQ2323253

Xizhi Liu

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Mammoliti-Britz conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Structural results for conditionally intersecting families and some applications ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number

Cites Work

• Unnamed Item
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Set systems with union and intersection constraints
• On Sperner families satisfying an additional condition
• On the \(d\)-cluster generalization of Erdős-Ko-Rado
• Erdős--Ko--Rado for three sets
• An intersection theorem for four sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of Sets with Intersecting Clusters
• On Mubayi's Conjecture and Conditionally Intersecting Sets
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: \(d\)-cluster-free sets with a given matching number