A simple proof for folds on both sides in complexes of graph homomorphisms
Dmitry N. Kozlov
Abstract
In this paper we study implications of folds in both parameters of Lovász' Hom(-,-) complexes. There is an important connection between the topological properties of these complexes and lower bounds for chromatic numbers. We give a very short and conceptual proof of the fact that if G-v is a fold of G, then Bd(Hom(G,H)) collapses onto Bd Hom(G-v,H), whereas Hom(H,G) collapses onto Hom(H,G-v). We also give an easy inductive proof of the only nonelementary fact which we use for our arguments: if ϕ is a closure operator on P, then Δ(P) collapses onto Δ(ϕ(P)).
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.