Eigenvalues of K₁,k-free graphs and the connectivity of their independence complexes
DOI10.1002/JGT.22004zbMATH Open1350.05089OpenAlexW2257025145MaRDI QIDQ2833255FDOQ2833255
Authors: Ron Aharoni, Noga Alon, Eli Berger 
Publication date: 17 November 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22004
Recommendations
- On the independence number in \(K_{1,r+1}\)-free graphs
- Independence complexes of claw-free graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Independence number and \(k\)-trees of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Paths and cycles (05C38)
Cites Work
- Hall's theorem for hypergraphs
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Independence complexes of claw-free graphs
- The linear arboricity of graphs
- Domination numbers and homology
- A condition for matchability in hypergraphs
- Triangulated spheres and colored cliques
- The intersection of a matroid and a simplicial complex
- The clique complex and hypergraph matching
- Odd Independent Transversals are Odd
Cited In (11)
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Constructing graphs with no independent transversals
- Some observations on the smallest adjacency eigenvalue of a graph
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Two disjoint independent bases in matroid-graph pairs
- Cooperative colorings and independent systems of representatives
- On a conjecture of Stein
- Fair representation by independent sets
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
This page was built for publication: Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833255)
