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 chains; adjacency matrix; extremal problems; trees; graph homomorphisms; walks; KC-transformation

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

Related Items

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

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