Sidorenko's conjecture for blow-ups
From MaRDI portal
Publication:3382237
DOI10.19086/da.21472zbMath1473.05141arXiv1809.01259OpenAlexW3141567130MaRDI QIDQ3382237
Publication date: 20 September 2021
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.01259
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cut distance identifying graphon parameters over weak* limits ⋮ On tripartite common graphs ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ Non-bipartite \(k\)-common graphs ⋮ A path forward: tropicalization in extremal combinatorics ⋮ Impartial digraphs ⋮ Locally common graphs ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ On some graph densities in locally dense graphs ⋮ Toward characterizing locally common graphs ⋮ Extremal results on feedback arc sets in digraphs ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle ⋮ Common graphs with arbitrary connectivity and chromatic number ⋮ Paths of given length in tournaments ⋮ Extended commonality of paths and cycles via Schur convexity ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Simple graph density inequalities with no sum of squares proofs ⋮ Threshold Ramsey multiplicity for paths and even cycles ⋮ Two remarks on graph norms
Cites Work
- The clique density theorem
- An approximate version of Sidorenko's conjecture
- Supersaturated graphs and hypergraphs
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Two approaches to Sidorenko’s conjecture
- Dependent random choice
- The number of cliques in graphs of given order and size
- On the Minimal Density of Triangles in Graphs
- Some advances on Sidorenko's conjecture
- FROM GRAPH LIMITS TO HIGHER ORDER FOURIER ANALYSIS
- Flag algebras
- Graph norms and Sidorenko's conjecture
