Graph norms and Sidorenko's conjecture

DOI10.1007/s11856-010-0005-1zbMath1227.05183arXiv0806.0047OpenAlexW2081231159WikidataQ122971122 ScholiaQ122971122MaRDI QIDQ5962247

Hamed Hatami

Publication date: 21 September 2010

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Cut distance identifying graphon parameters over weak* limits, Popular progression differences in vector spaces II, Finite reflection groups and graph norms, The step Sidorenko property and non-norming edge-transitive graphs, Non-Three-Colourable Common Graphs Exist, Non-bipartite \(k\)-common graphs, On the Extremal Number of Subdivisions, On replica symmetry of large deviations in random graphs, How unproportional must a graph be?, Impartial digraphs, An approximate version of Sidorenko's conjecture, Sidorenko's conjecture for blow-ups, Tree-Degenerate Graphs and Nested Dependent Random Choice, From quasirandom graphs to graph limits and graphlets, On some graph densities in locally dense graphs, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, Toward characterizing locally common graphs, On the local approach to Sidorenko's conjecture, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Extremal results on feedback arc sets in digraphs, On graph norms for complex‐valued functions, A Property on Monochromatic Copies of Graphs Containing a Triangle, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, Subgraph densities in Markov spaces, On the Turán number of the hypercube, Extended commonality of paths and cycles via Schur convexity, On the Lower Tail Variational Problem for Random Graphs, Edges not in any monochromatic copy of a fixed graph, Weakly norming graphs are edge-transitive, Inequalities for doubly nonnegative functions, FORCING QUASIRANDOMNESS WITH TRIANGLES, Positive graphs, Supersaturation problem for color-critical graphs, Sidorenko's conjecture, colorings and independent sets, Weak hypergraph regularity and linear hypergraphs, Unnamed Item, Supersaturation problem for the bowtie, Two approaches to Sidorenko’s conjecture, Anti-Ramsey Multiplicities, An elementary analog of the operator method in additive combinatorics, 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, Threshold Ramsey multiplicity for paths and even cycles, Weak quasi-randomness for uniform hypergraphs, A reverse Sidorenko inequality, Differential calculus on graphon space, Two remarks on graph norms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits of dense graph sequences
• An ergodic Szemerédi theorem for commuting transformations
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Compactness results in extremal graph theory
• A correlation inequality for bipartite graphs
• The primes contain arbitrarily long arithmetic progressions
• Hypergraph regularity and the multidimensional Szemerédi theorem
• The cross-space of linear transformations. III
• The cross-space of linear transformations
• The cross-space of linear transformations. II
• Reflection positivity, rank connectivity, and homomorphism of graphs
• On the Minimal Density of Triangles in Graphs
• Parallelepipeds, nilpotent groups and Gowers norms
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• On sets of integers containing k elements in arithmetic progression
• On the moduli of convexity and smoothness
• Extremal problems on set systems
• Regularity Lemma for k-uniform hypergraphs
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• The counting lemma for regular k‐uniform hypergraphs
• Applications of the regularity lemma for uniform hypergraphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• On sets of integers containing no four elements in arithmetic progression
• Quasi-random graphs
• A new proof of Szemerédi's theorem