Maximum hitting of a set by compressed intersecting families
From MaRDI portal
Publication:659747
DOI10.1007/S00373-010-1001-2zbMATH Open1233.05193OpenAlexW2134230490MaRDI QIDQ659747FDOQ659747
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-1001-2
Recommendations
- Erdős-Ko-Rado with separation conditions
- Non-trivial intersecting families
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- Maximum hitting for \(n\) sufficiently large
Compressed family[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado+Theorem&go=Go Erd��s-Ko-Rado Theorem]Intersecting family
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-trivial intersecting families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős-Ko-Rado from Kruskal-Katona
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Erdös–Ko–Rado Theorem—22 Years Later
- Some best possible inequalities concerning cross-intersecting families
- Graphs with the Erdős-Ko-Rado property
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- On intersecting families of finite sets
- Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
Cited In (9)
- On maximal shadows of members in left-compressed sets
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- EKR sets for large \(n\) and \(r\)
- A Hilton-Milner-type theorem and an intersection conjecture for signed sets
- Maximum hitting for \(n\) sufficiently large
- Optimal Hitting Sets for Combinatorial Shapes
- Classification of maximum hittings by large families
- Non-trivial intersecting uniform sub-families of hereditary families
- A pushing-pulling method: New proofs of intersection theorems
This page was built for publication: Maximum hitting of a set by compressed intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659747)
