On weighted graph homomorphisms
From MaRDI portal
Publication:4660722
zbMath1061.05068arXiv1206.3160MaRDI QIDQ4660722
Publication date: 4 April 2005
Full work available at URL: https://arxiv.org/abs/1206.3160
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (31)
Counting dominating sets and related structures in graphs ⋮ Interview with Yufei Zhao ⋮ Rigidity of 3-colorings of the discrete torus ⋮ Extremal Regular Graphs: Independent Sets and Graph Homomorphisms ⋮ Homomorphisms into loop-threshold graphs ⋮ On Sidorenko's conjecture for determinants and Gaussian Markov random fields ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Minimizing the number of independent sets in triangle-free regular graphs ⋮ \(H\)-colouring bipartite graphs ⋮ Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ On the Widom–Rowlinson Occupancy Fraction in Regular Graphs ⋮ Maximizing the number of independent sets in claw-free cubic graphs ⋮ The homomorphism domination exponent ⋮ Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018 ⋮ On the number of independent sets in uniform, regular, linear hypergraphs ⋮ A proof of the upper matching conjecture for large graphs ⋮ Notes on use of generalized entropies in counting ⋮ Counting proper colourings in 4-regular graphs via the Potts model ⋮ The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph ⋮ Extremal colorings and independent sets ⋮ \(H\)-coloring tori ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Counting independent sets in cubic graphs of given girth ⋮ Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree ⋮ The number of independent sets in an irregular graph ⋮ Matchings and independent sets of a fixed size in regular graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs ⋮ An upper bound for the number of independent sets in regular graphs ⋮ A reverse Sidorenko inequality ⋮ Counting colorings of a regular graph
This page was built for publication: On weighted graph homomorphisms
