Sidorenko's conjecture, colorings and independent sets
From MaRDI portal
Publication:510305
zbMath1355.05105arXiv1603.05888MaRDI QIDQ510305
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05888
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms, Counting colorings of triangle-free graphs, On the chromatic polynomial and counting DP-colorings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Antiferromagnetic Potts model on the Erdős-Rényi random graph
- Graph homomorphisms between trees
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- On the Potts antiferromagnet on random graphs
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models
- A correlation inequality for bipartite graphs
- Two inequalities in nonnegative symmetric matrices
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Two approaches to Sidorenko’s conjecture
- On a Poset of Trees II
- Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
- Counting without sampling
- Some advances on Sidorenko's conjecture
- Extremal graphs for homomorphisms
- 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
