On t-Intersecting Hypergraphs with Minimum Positive Codegrees
From MaRDI portal
Publication:6101018
DOI10.1137/21m1465998zbMath1515.05181arXiv2110.10317OpenAlexW4378363461MaRDI QIDQ6101018
Publication date: 31 May 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.10317
Cites Work
- Unnamed Item
- The complete intersection theorem for systems of finite sets
- Invitation to intersection problems for finite sets
- On finite set-systems whose every intersection is a kernel of a star
- The unbalance of set systems
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Forbidding complete hypergraphs as traces
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Extremal Problems for Finite Sets
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree
- Improved bounds for the sunflower lemma
- On intersecting families of finite sets
This page was built for publication: On t-Intersecting Hypergraphs with Minimum Positive Codegrees