Critically intersecting hypergraphs

DOI10.1016/J.EJC.2025.104286MaRDI QIDQ6866246zbMATH OpenFDO

Authors Peter Frankl

Publication date 29 January 2026

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

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104286

zbMATH Keywords

\(t\)-transversal setcritical hypergraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

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\)
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3616474 (Why is no real title available?)
• On maximal intersecting families of finite sets
• On the size of maximal intersecting families
• Pseudo sunflowers

This page was built for publication: Critically intersecting hypergraphs

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