Skip to main content
Log in

Dominance complexes and vertex cover numbers of graphs

  • Published:
Journal of Applied and Computational Topology Aims and scope Submit manuscript

Abstract

The dominance complex D(G) of a simple graph \(G = (V,E)\) is the simplicial complex consisting of the subsets of V whose complements are dominating. We show that the connectivity of D(G) plus 2 is a lower bound for the vertex cover number \(\tau (G)\) of G.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adamaszek, M.: Splittings of independence complexes and the powers of cycles. J. Comb. Theory Ser. A 119, 1031–1047 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  • Babson, E., Kozlov, D.N.: Proof of the Lovász conjecture. Ann. Math. 165, 965–1007 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Barmak, J.A.: Star clusters in independence complexes of graphs. Adv. Math. 241, 33–57 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  • Deshpande, P., Singh, A.: Higher independence complexes of graphs and their homotopy types. to appear in Journal of the Ramanujan Mathematical Society (2021)

  • Dochtermann, A.: Exposed circuits, linear quotients, and chordal clutters. J. Comb. Ser. Theory A 177, 105327 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  • Ehrenborg, R., Hetyei, G.: The topology of independence complex. Eur. J. Comb. 27, 906–923 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Engström, A.: Complexes of directed trees and independence complexes. Discrete Math. 309, 3299–3309 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  • Jonsson, J.: On the topology of independence complexes of triangle-free graphs. Preprint

  • Kawamura, K.: Independence complexes of chordal graphs. Discrete Math. 310, 2204–2211 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Kozlov, D.N.: Complexes of directed trees. J. Comb. Theory Ser. A 88, 112–122 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Marietti, M., Testa, D.: A uniform approach to complexes arising from forests. Electron. J. Comb. 15 (2008)

  • Marietti, M., Testa, D.: Cores of simplicial complexes. Discrete Comput. Geom. 40, 444–468 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  • Matoušek, J.: Using the Borsuk–Ulam Theorem. Lectures on Topological Methods in Combinatorics and Geometry, 2nd edn. Springer, Universitext (2007)

    Google Scholar 

  • Meshulam, R.: Domination numbers and homology. J. Comb. Theory Ser. A 102, 321–330 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  • Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)

    MATH  Google Scholar 

  • Milnor, J.W., Stasheff, J.D.: Characteristic Classes. Princeton University Press, Princeton (1974)

    Book  MATH  Google Scholar 

  • Nagel, U., Reiner, V.: Betti numbers of monomial ideals and shifted skew shapes. Electron. J. Comb. 16 (2009)

  • Taylan, D.: Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs. Order 33, 459–476 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  • Tsukuda, S.: Independence complexes and incidence graphs. Contrib. Discret. Math. 12(1), 28–46 (2015)

    MathSciNet  MATH  Google Scholar 

  • Woodroofe, R.: Chordal and sequentially Cohen–Macaulay clutters. Electron. J. Comb. 18 (2011)

Download references

Acknowledgements

The author is partially supported by JSPS KAKENHI 19K14536. The author thanks the referee for useful comments. The author states that there is no conflict of interests.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takahiro Matsushita.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Matsushita, T. Dominance complexes and vertex cover numbers of graphs. J Appl. and Comput. Topology 7, 363–368 (2023). https://doi.org/10.1007/s41468-022-00109-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41468-022-00109-2

Keywords

Mathematics Subject Classification

Navigation