Turánnical hypergraphs
From MaRDI portal
Publication:4903276
DOI10.1002/rsa.20399zbMath1257.05103arXiv1011.1483OpenAlexW3102138966MaRDI QIDQ4903276
No author found.
Publication date: 21 January 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1483
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)
Related Items (4)
Uniform chain decompositions and applications ⋮ An extension of Turán's theorem, uniqueness and stability ⋮ Unnamed Item ⋮ Short proofs of some extremal results III
Cites Work
- Unnamed Item
- Supersaturated graphs and hypergraphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- On \(K^ 4\)-free subgraphs of random graphs
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Books Versus triangles
- Ramsey properties of random discrete structures
- Erdős–Ko–Rado in Random Hypergraphs
- Local resilience of graphs
- Sharp thresholds of graph properties, and the $k$-sat problem
- K5‐free subgraphs of random graphs
- Hunting for sharp thresholds
- The Turn Theorem for Random Graphs
- Threshold Functions for Ramsey Properties
- On the structure of linear graphs
This page was built for publication: Turánnical hypergraphs
