Jaroslav NeA!et^D%ril – författare

Graph theory and especially the study of graph homomorphisms has developed exponentially in the last couple of decades. Originally based on the authors' graduate course lecture notes, this is still the only book devoted entirely to graph homomorphisms, bringing together the highlights of the theory and its many applications. It offers a useful perspective on more traditional graph theory topics such as graph reconstruction, various forms of graph colouring, graph products, automorphism groups, chordality, and interval graphs, and has applications in complexity theory, artificial intelligence, telecommunication, and statistical physics. It is intended to be a sampler of this rich subject and focuses on its most interesting results, techniques, and applications, including its algebraic, combinatorial, and algorithmic aspects. The book discusses most of the recent developments in the field, such as the disproof of the Hedetniemi Product Conjecture, the proof of the Feder-Vardi Dichotomy Conjecture of constraint satisfaction problems, as well as the celebrated theory of graph convergence and graphons. The text contains exercises of varying difficulty, intended to support readers' learning and further development.