On the size of maximal intersecting families

DOI10.1017/S0963548323000287MaRDI QIDQ6632791

D. D. Zakharov

Publication date: 5 November 2024

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

zbMATH Keywords

intersecting familyminimal coversErdős-Lovász problem

Mathematics Subject Classification ID

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

Cites Work

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

Related Items (1)

A generalization of diversity for intersecting families

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)