Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree
Authors:
- Jozsef BaloghJBJozsef Balogh
- Nathan LemonsNLNathan Lemons
- Cory PalmerCPCory Palmer
- 1 January 2021
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 35 (3) , 1525-1535
Abstract
Let $\mathcal{H}$ be an $r$-uniform hypergraph. The minimum positive co-degree of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set cont...
Keywords
All Related Versions
Funding Information
- National Science Foundation (DMS-1764123)
- Simons Foundation
- Simons Foundation (712036)
- University of Illinois at Urbana-Champaign
This publication has 20 references indexed in Scilit:
- The Unbalance of Set SystemsGraphs and Combinatorics, 2008
- Co-degree density of hypergraphsJournal of Combinatorial Theory, Series A, 2007
- Stability theorems for cancellative hypergraphsJournal of Combinatorial Theory, Series B, 2004
- Uniform intersecting families with covering number fourJournal of Combinatorial Theory, Series A, 1995
- Erdös-Ko-Rado theorem with conditions on the maximal degreeJournal of Combinatorial Theory, Series A, 1987
- An intersection problem with 6 extremesActa Mathematica Hungarica, 1983
- A new generalization of the Erdős-Ko-Rado theoremCombinatorica, 1983
- On finite set-systems whose every intersection is a Kernel of a starDiscrete Mathematics, 1983
- On intersecting families of finite setsBulletin of the Australian Mathematical Society, 1980
- On intersecting families of finite setsJournal of Combinatorial Theory, Series A, 1978