On the size of maximal intersecting families

DOI10.1017/S0963548323000287MaRDI QIDQ6632791zbMATH OpenFDO

Authors D. D. Zakharov

Publication date 5 November 2024

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548323000287

zbMATH Keywords

Erdős-Lovász problemintersecting familyminimal covers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Transversal (matching) theory (05D15)

Recommendations

• On the union of intersecting families
• Enumeration of intersecting families
• The maximum size of intersecting and union families of sets
• scientific article; zbMATH DE number 5122069
• On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method

Cites work

• A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• Antichains of fixed diameter
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Extremal combinatorics. With applications in computer science
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Improved bounds for the sunflower lemma
• Inequalities for minimal covering sets in set systems of given rank
• On a Problem of Erdos and Lovasz. II: n(r) = O(r)
• On hypergraph cliques with chromatic number 3

Cited in

(5)

• A generalization of diversity for intersecting families
• Critically intersecting hypergraphs
• Intersecting families with covering number 3
• New bounds on families without large sunflowers
• Best possible bounds on the double-diversity of intersecting hypergraphs

This page was built for publication: On the size of maximal intersecting families

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