Two approaches to Sidorenko’s conjecture

DOI10.1090/tran/6487zbMath1331.05220arXiv1310.4383OpenAlexW2963752244WikidataQ122983025 ScholiaQ122983025MaRDI QIDQ2790648

Joonkyung Lee, Choongbum Lee, Jeong Han Kim

Publication date: 7 March 2016

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.4383

zbMATH Keywords

Erdős-Rényi random graphtree-arrangeable bipartite graphs

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Inequalities for sums, series and integrals (26D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (32)

Cut distance identifying graphon parameters over weak* limits ⋮ Popular progression differences in vector spaces II ⋮ Finite reflection groups and graph norms ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ The step Sidorenko property and non-norming edge-transitive graphs ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ A path forward: tropicalization in extremal combinatorics ⋮ Hereditary quasirandomness without regularity ⋮ Impartial digraphs ⋮ Tropicalization of graph profiles ⋮ Sidorenko's conjecture for blow-ups ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ On some graph densities in locally dense graphs ⋮ On Sidorenko's conjecture for determinants and Gaussian Markov random fields ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Extremal results on feedback arc sets in digraphs ⋮ The Turán number of the grid ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Simple graph density inequalities with no sum of squares proofs ⋮ Inequalities for doubly nonnegative functions ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ Supersaturation problem for color-critical graphs ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph ⋮ Supersaturation problem for the bowtie ⋮ Anti-Ramsey Multiplicities ⋮ Convex graphon parameters and graph norms ⋮ Lower bounds for integral functionals generated by bipartite graphs ⋮ Threshold Ramsey multiplicity for paths and even cycles ⋮ A reverse Sidorenko inequality

Cites Work

• The clique density theorem
• An approximate version of Sidorenko's conjecture
• Graph minors. III. Planar tree-width
• Gibbs measures and phase transitions
• S-functions for graphs
• Correlation inequalities on some partially ordered sets
• Domination between trees and application to an explosion problem
• A correlation inequality for bipartite graphs
• Two inequalities in nonnegative symmetric matrices
• The number of cliques in graphs of given order and size
• An Inequality Arising in Genetical Theory
• On the Minimal Density of Triangles in Graphs
• Inequalities for functionals generated by bipartite graphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• On the structure of linear graphs
• Graph norms and Sidorenko's conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two approaches to Sidorenko’s conjecture