The Bipartite Swapping Trick on Graph Homomorphisms
Work
Year: 2011
Type: article
Abstract: We provide an upper bound to the number of graph homomorphisms from $G$ to $H$, where $H$ is a fixed graph with certain properties, and $G$ varies over all $N$-vertex, $d$-regular graphs. This result ... more
Author Yufei Zhao
Institution Massachusetts Institute of Technology
Cites: 15
Cited by: 29
Related to: 10
FWCI: 2.693
Citation percentile (by year/subfield): 92.36
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green