Random Turán problems for hypergraph expansions
From MaRDI portal
Cites work
- A correlation inequality for bipartite graphs
- A survey of Turán problems for expansions
- An approximate version of Sidorenko's conjecture
- An asymmetric container lemma and the structure of graphs with no induced 4-cycle
- An intersection theorem for four sets
- Balanced supersaturation and Turán numbers in random graphs
- Combinatorial theorems in sparse random sets
- Counting hypergraphs with large girth
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Extremal numbers and Sidorenko's conjecture
- Extremal results for random discrete structures
- Finite reflection groups and graph norms
- Graph norms and Sidorenko's conjecture
- scientific article; zbMATH DE number 4216032 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- Hypergraph containers
- Independent sets in hypergraphs
- On the local approach to Sidorenko's conjecture
- On the number of \(\mathcal{H}\)-free hypergraphs
- On the random Turán number of linear cycles
- Random Turán theorem for expansions of spanning subgraphs of tight trees
- Sidorenko hypergraphs and random Turán numbers
- Sidorenko's conjecture for blow-ups
- Some advances on Sidorenko's conjecture
- Some extremal results on complete degenerate hypergraphs
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- The number of \(C_{2\ell}\)-free graphs
- Triangle-free subgraphs of hypergraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Turán theorems for even cycles in random hypergraph
- Two approaches to Sidorenko's conjecture
- Unavoidable stars in 3-graphs
This page was built for publication: Random Turán problems for hypergraph expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446150)