\(H\)-colouring bipartite graphs

DOI10.1016/j.jctb.2011.12.004zbMath1248.05188arXiv1101.0839OpenAlexW2018614962MaRDI QIDQ414646

David Galvin, John Engbers

Publication date: 11 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

graph colouringrandom bipartite graphgraph homomorphisms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Homomorphisms from the torus ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ The independent set sequence of regular bipartite graphs ⋮ \(H\)-coloring tori ⋮ Lipschitz Functions on Expanders are Typically Flat ⋮ Homomorphisms of Trees into a Path ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some intersection theorems for ordered sets and graphs
• Random surfaces with two-sided constraints: An application of the theory of dominant ground states
• Graph homomorphisms and phase transitions
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Multistate Hard Core Model on a Regular Tree
• Markov random field models of multicasting in tree networks
• On weighted graph homomorphisms
• Asymptotics and random matrices with row-sum and column sum-restrictions
• Range of cube-indexed random walk

This page was built for publication: \(H\)-colouring bipartite graphs