Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes

Ron Aharoni, Noga Alon, Eli Berger

Research output: Contribution to journalArticlepeer-review


Let G be a graph on n vertices, with maximal degree d, and not containing K1,k as an induced subgraph. We prove: 1. λ(G) ≤ (2-1/2k-2+o(1))d 2. η(I(G))≥n(k-1)/d(2k-3)+k-1. Here λ(G) is the maximal eigenvalue of the Laplacian of G, I(G) is the independence complex of G, and η(C) denotes the topological connectivity of a complex C plus 2. These results provide improved bounds for the existence of independent transversals in K1,k-free graphs.

Original languageEnglish
Pages (from-to)384-391
Number of pages8
JournalJournal of Graph Theory
Issue number4
StatePublished - 1 Dec 2016

Bibliographical note

Publisher Copyright:
© 2015 Wiley Periodicals, Inc.


  • Eigenvalues
  • homological connectivity
  • independent transversals

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes'. Together they form a unique fingerprint.

Cite this