Graph homomorphisms between trees

zbMath1298.05062arXiv1307.6721MaRDI QIDQ463048

Zhicong Lin, Péter Csikvári

Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsadjacency matrixextremal problemstreesgraph homomorphismswalksKC-transformation

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (9)

Extremal \(H\)-colorings of trees and 2-connected graphs ⋮ Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling ⋮ Graph homomorphisms between trees ⋮ Maximizing and minimizing the number of generalized colorings of trees ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree ⋮ On the distribution of range for tree-indexed random walks ⋮ Homomorphisms of Trees into a Path ⋮ On local weak limit and subgraph counts for sparse random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree-minimal graphs are almost regular
• On the number of congruence classes of paths
• Graph homomorphisms between trees
• On a poset of trees
• The homomorphism domination exponent
• Number of walks and degree powers in a graph
• An algorithm for the number of path homomorphisms
• A partially ordered set of functionals corresponding to graphs
• Multiplicities of subgraphs
• A correlation inequality for bipartite graphs
• On the eigenvalues of trees
• On a Poset of Trees II
• Walks and paths in trees
• On graphs with randomly deleted edges
• Elements of Information Theory

This page was built for publication: Graph homomorphisms between trees