AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Graphs, Morphisms and Statistical Physics
About this Title
J. Nešetřil, Charles University, Praha, Czech Republic and P. Winkler, Bell Labs, Murray Hill, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
2004; Volume 63
ISBNs: 978-0-8218-3551-7 (print); 978-1-4704-4021-3 (online)
DOI: https://doi.org/10.1090/dimacs/063
MathSciNet review: MR2060793
MSC: Primary 05-06; Secondary 05Cxx, 82-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Efficient local search near phase transitions in combinatorial optimization
- On the sampling problem for $H$-colorings on the hypercubic lattice
- Graph homomorphisms and long range action
- Random walks and graph homomorphisms
- Recent results on parameterized $H$-colorings
- Rapidly mixing Markov chains for dismantleable constraint graphs
- On weighted graph homomorphisms
- Counting list homomorphisms for graphs with bounded degrees
- On the satisfiability of random $k$-horn formulae
- The exchange interaction, spin hamiltonians, and the symmetric group
- A discrete non-Pfaffian approach to the Ising problem
- Survey: Information flow on trees
- Chromatic numbers of products of tournaments: Fractional aspects of Hedetniemi’s conjecture
- Perfect graphs for generalized colouring-circular perfect graphs