Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree
From MaRDI portal
Publication:5001841
DOI10.1137/20M1336989zbMath1468.05297arXiv2005.04282OpenAlexW3176965137MaRDI QIDQ5001841
Nathan Lemons, József Balogh, Cory Palmer
Publication date: 23 July 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.04282
We Found 2 Related Items (max. 100)
On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ On the limit of the positive \(\ell\)-degree Turán problem
Cites Work
- Unnamed Item
- Unnamed Item
- Turán problems and shadows. I: Paths and cycles
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- Invitation to intersection problems for finite sets
- Maximum degree and diversity in intersecting hypergraphs
- On finite set-systems whose every intersection is a kernel of a star
- An intersection problem with 6 extremes
- The unbalance of set systems
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Diversity of uniform intersecting families
- Stability theorems for cancellative hypergraphs
- Uniform intersecting families with covering number four
- Degree versions of theorems on intersecting families via stability
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- Forbidding complete hypergraphs as traces
- Co-degree density of hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Improved bounds for the sunflower lemma
- A new generalization of the Erdős-Ko-Rado theorem
- On intersecting families of finite sets
- On intersecting families of finite sets
This page was built for publication: Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree