A reverse Sidorenko inequality
From MaRDI portal
Publication:785934
DOI10.1007/s00222-020-00956-9zbMath1445.05046arXiv1809.09462OpenAlexW3012456354MaRDI QIDQ785934
Ashwin Sah, Mehtaab Sawhney, David Stoner, Yufei Zhao
Publication date: 12 August 2020
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.09462
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Related Items (8)
Interview with Yufei Zhao ⋮ Impartial digraphs ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Counting independent sets in regular hypergraphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ The number of independent sets in an irregular graph ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
Cites Work
- Unnamed Item
- The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
- An approximate version of Sidorenko's conjecture
- Applications of the Kelmans transformation: extremality of the threshold graphs
- The number of independent sets in a graph with small maximum degree
- Supersaturated graphs and hypergraphs
- Gaussian kernels have only Gaussian maximizers
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Independent sets in regular graphs and sum-free subsets of finite groups
- Best constants in Young's inequality, its converse, and its generalization to more than three functions
- On kissing numbers and spherical codes in high dimensions
- Counting independent sets in cubic graphs of given girth
- Counting proper colourings in 4-regular graphs via the Potts model
- The number of independent sets in an irregular graph
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- The maximum number of complete subgraphs in a graph with given maximum degree
- Bounding the partition function of spin-systems
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Two approaches to Sidorenko’s conjecture
- The Bipartite Swapping Trick on Graph Homomorphisms
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
- On replica symmetry of large deviations in random graphs
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- The Number of Independent Sets in a Regular Graph
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
- On the average size of independent sets in triangle-free graphs
- Graph operations and upper bounds on graph homomorphism counts
- ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
- Some advances on Sidorenko's conjecture
- On weighted graph homomorphisms
- Extremes of the internal energy of the Potts model on cubic graphs
- Maximizing H‐Colorings of a Regular Graph
- Independent sets, matchings, and occupancy fractions
- On the Widom–Rowlinson Occupancy Fraction in Regular Graphs
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Graph norms and Sidorenko's conjecture
This page was built for publication: A reverse Sidorenko inequality
