An approximate version of Sidorenko's conjecture
From MaRDI portal
Publication:616156
DOI10.1007/s00039-010-0097-0zbMath1228.05285arXiv1004.4236OpenAlexW2126244044WikidataQ122903458 ScholiaQ122903458MaRDI QIDQ616156
Jacob Fox, Benjamin Sudakov, David Conlon
Publication date: 7 January 2011
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.4236
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)
Related Items
Cut distance identifying graphon parameters over weak* limits, Popular progression differences in vector spaces II, Finite reflection groups and graph norms, Lower bound on the size of a quasirandom forcing set of permutations, On tripartite common graphs, 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, Non-Three-Colourable Common Graphs Exist, Non-bipartite \(k\)-common graphs, On replica symmetry of large deviations in random graphs, Hereditary quasirandomness without regularity, Impartial digraphs, Tropicalization of graph profiles, Sidorenko's conjecture for blow-ups, Tree-Degenerate Graphs and Nested Dependent Random Choice, Quasirandom-Forcing Orientations of Cycles, 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, Minimum degree and the graph removal lemma, Small Dense Subgraphs of a Graph, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Extremal results on feedback arc sets in digraphs, A Property on Monochromatic Copies of Graphs Containing a Triangle, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, 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, Extremal results in sparse pseudorandom graphs, Edges not in any monochromatic copy of a fixed graph, On the KŁR conjecture in random graphs, Inequalities for doubly nonnegative functions, FORCING QUASIRANDOMNESS WITH TRIANGLES, Supersaturation problem for color-critical graphs, Sidorenko's conjecture, colorings and independent sets, Supersaturation problem for the bowtie, Two approaches to Sidorenko’s conjecture, Anti-Ramsey Multiplicities, Dependent random choice, 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, Unified approach to the generalized Turán problem and supersaturation, Threshold Ramsey multiplicity for paths and even cycles, Weak quasi-randomness for uniform hypergraphs, A reverse Sidorenko inequality, No additional tournaments are quasirandom-forcing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- On the density of a graph and its blowup
- A new upper bound for diagonal Ramsey numbers
- Density theorems for bipartite graphs and related Ramsey-type results
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Non-averaging subsets and non-vanishing transversals
- Domination between trees and application to an explosion problem
- Bipartite subgraphs and quasi-randomness
- Multiplicities of subgraphs
- A correlation inequality for bipartite graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Dependent random choice
- The number of cliques in graphs of given order and size
- Weak quasi-randomness for uniform hypergraphs
- On the Minimal Density of Triangles in Graphs
- Quasirandom Groups
- Very large graphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicities of graphs—problems and recent results
- Quasi-Random Set Systems
- Quasi‐random graphs with given degree sequences
- There exist graphs with super‐exponential Ramsey multiplicity constant
- A MATRIX INEQUALITY
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
