The step Sidorenko property and non-norming edge-transitive graphs
From MaRDI portal
Publication:1633367
DOI10.1016/j.jcta.2018.09.012zbMath1401.05269arXiv1802.05007OpenAlexW2964291645WikidataQ57601308 ScholiaQ57601308MaRDI QIDQ1633367
Marcin Wrochna, Péter Pál Pach, Daniel Král', Taísa L. Martins
Publication date: 19 December 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.05007
Related Items (9)
Cut distance identifying graphon parameters over weak* limits ⋮ On graph norms for complex‐valued functions ⋮ Subgraph densities in Markov spaces ⋮ Relating the cut distance and the weak* topology for graphons ⋮ Weakly norming graphs are edge-transitive ⋮ Convex graphon parameters and graph norms ⋮ Lower bounds for integral functionals generated by bipartite graphs ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Two remarks on graph norms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of Sidorenko's conjecture
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- Limits of dense graph sequences
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- On the local approach to Sidorenko's conjecture
- Bipartite subgraphs and quasi-randomness
- Multiplicities of subgraphs
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Two approaches to Sidorenko’s conjecture
- Non-Three-Colourable Common Graphs Exist
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Some advances on Sidorenko's conjecture
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
This page was built for publication: The step Sidorenko property and non-norming edge-transitive graphs
