On the local approach to Sidorenko's conjecture
From MaRDI portal
Publication:1689957
DOI10.1016/j.endm.2017.06.074zbMath1378.05184OpenAlexW2745261365WikidataQ123328728 ScholiaQ123328728MaRDI QIDQ1689957
Publication date: 18 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.074
Related Items (10)
Cut distance identifying graphon parameters over weak* limits ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ The step Sidorenko property and non-norming edge-transitive graphs ⋮ Non-bipartite \(k\)-common graphs ⋮ New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 ⋮ Toward characterizing locally common graphs ⋮ Undecidability of polynomial inequalities in weighted graph homomorphism densities ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Unified approach to the generalized Turán problem and supersaturation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique density theorem
- Tree-minimal graphs are almost regular
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- The number of cliques in graphs of given order and size
- On the Minimal Density of Triangles in Graphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Graph norms and Sidorenko's conjecture
- On Sidorenko's conjecture for determinants and Gaussian Markov random fields
This page was built for publication: On the local approach to Sidorenko's conjecture
