On some graph densities in locally dense graphs
From MaRDI portal
Publication:6073631
DOI10.1002/rsa.20974zbMath1522.05257arXiv1707.02916OpenAlexW3107642553MaRDI QIDQ6073631
Publication date: 11 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02916
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Density (toughness, etc.) (05C42)
Related Items (2)
Inequalities for doubly nonnegative functions ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting odd cycles in locally dense graphs
- An approximate version of Sidorenko's conjecture
- The homomorphism domination exponent
- Supersaturated graphs and hypergraphs
- Graph minors. III. Planar tree-width
- Weak hypergraph regularity and linear hypergraphs
- Compactness results in extremal graph theory
- Multiplicities of subgraphs
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Two approaches to Sidorenko’s conjecture
- An Inequality Arising in Genetical Theory
- Sidorenko's conjecture for blow-ups
- Inequalities for functionals generated by bipartite graphs
- Some advances on Sidorenko's conjecture
- A MATRIX INEQUALITY
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Quasi-random graphs
- On bipartite graphs with linear Ramsey numbers
- Graph norms and Sidorenko's conjecture
This page was built for publication: On some graph densities in locally dense graphs