On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
From MaRDI portal
Publication:2341076
zbMath1310.05018arXiv1501.00648MaRDI QIDQ2341076
Balázs Patkós, Zoltán Lóránt Nagy
Publication date: 22 April 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00648
Related Items (2)
The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Intersecting families of discrete structures are typically trivial
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersection patterns of convex sets
- Critical hypergraphs and interesting set-pair systems
- Inequalities for two set systems with prescribed intersections
- An extremal problem for two families of sets
- Counting families of mutually intersecting sets
- Intersecting families of discrete structures are typically trivial
- On Families of Weakly Cross-intersecting Set-pairs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado in Random Hypergraphs
- On generalized graphs
This page was built for publication: On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method