Codegree Turán Density of Complete $r$-Uniform Hypergraphs
From MaRDI portal
Publication:4563373
DOI10.1137/18M1163956zbMath1388.05130arXiv1801.01393MaRDI QIDQ4563373
Publication date: 1 June 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01393
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs ⋮ Independence number of hypergraphs under degree conditions ⋮ The codegree threshold of \(K_4^-\) ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large ⋮ On the Codegree Density of $PG_m(q)$
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the codegree density of complete 3-graphs and related problems
- The codegree threshold of \(K_4^-\)
- Codegree problems for projective geometries
- On the co-degree threshold for the Fano plane
- The co-degree density of the Fano plane
- Co-degree density of hypergraphs
- ${\ell}$-Degree Turán Density
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods
- A hypergraph regularity method for generalized Turán problems
- Note on independent sets in steiner systems
- Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs
- On uncrowded hypergraphs
- On independent sets in hypergraphs