The Bipartite Swapping Trick on Graph Homomorphisms
Name
Zhao-2011-THE BIPARTITE SWAPPI.pdf
Size
520.66 KB
Format
Adobe PDF
Checksum (MD5)
a9e43a3c12b46815c632c939576bbc0b
Author(s)
Zhao, Yufei
Date Issued
June 2011
Journal
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial and Applied Mathematics
Citation
Zhao, Yufei. “The Bipartite Swapping Trick on Graph Homomorphisms.” SIAM Journal on Discrete Mathematics 25 (2011): 660. © 2011 Society for Industrial and Applied Mathematics.
Version
Final published version
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 generalizes a recently resolved conjecture of Alon and Kahn on the number of independent sets. We build on the work of Galvin and Tetali, who studied the number of graph homomorphisms from G to H when G is bipartite. We also apply our techniques to graph colorings and stable set polytopes.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/100800415
