Relative Turán Problems for Uniform Hypergraphs
From MaRDI portal
Publication:5157384
DOI10.1137/20M1364631zbMath1475.05091arXiv2009.02416OpenAlexW3201463694MaRDI QIDQ5157384
Publication date: 18 October 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02416
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Supersaturated graphs and hypergraphs
- An extremal theorem in the hypercube
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- An extremal problem for random graphs and the number of graphs with large even-girth
- Norm-graphs: Variations and applications
- Random Ramsey graphs for the four-cycle
- On \(K^ 4\)-free subgraphs of random graphs
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- On extremal problems of graphs and generalized graphs
- Norm-graphs and bipartite Turán numbers
- Extremal problems for cycles in graphs
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- Large Subgraphs without Short Cycles
- Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
- The number of K s,t -free graphs
- Minimal Regular Graphs of Girths Eight and Twelve
- On coloring graphs to maximize the proportion of multicolored k-edges
This page was built for publication: Relative Turán Problems for Uniform Hypergraphs
