On the homotopy type of complexes of graphs with bounded domination number

preprint2021arXivOpen access

Abstract

Let Dn,γD_{n,γ} be the complex of graphs on nn vertices and domination number at least γγ. We prove that Dn,n−2D_{n,n-2} has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques. Acyclicity of the needed matching is proved by introducing a relativized form of a well known method for constructing acyclic matchings on suitable chunks of simplices. Our approach allows us to extend our results to the realm of infinite graphs. In addition, we give evidence supporting the assertion that the homotopy equivalences Dn,n−1≃⋁S0D_{n,n-1}\simeq\bigvee S^0 and Dn,n−2≃⋁S2D_{n,n-2}\simeq\bigvee S^2 do not seem to generalize for Dn,γD_{n,γ} with γ≤n−3γ\leq n-3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.