A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)

DOI10.1016/S0012-365X(03)00235-8zbMath1035.05085OpenAlexW2136080029MaRDI QIDQ1417575

Martin Loebl, Jaroslav Nešetřil, Bruce A. Reed

Publication date: 5 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00235-8

zbMATH Keywords

random walkshomomorphismsgraphsLipschitz mappings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• On the complexity of H-coloring
• Graph homomorphisms and phase transitions
• On random graph homomorphisms into \({\mathbb{Z}}\)
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Range of cube-indexed random walk
• Unnamed Item
• Unnamed Item

Related Items (5)

Random mappings of scaled graphs. ⋮ Delocalization of the height function of the six-vertex model ⋮ Graph-indexed random walks on pseudotrees ⋮ On the distribution of range for tree-indexed random walks ⋮ Logarithmic variance for the height function of square-ice

This page was built for publication: A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)