Eigenvalues of K₁,k-free graphs and the connectivity of their independence complexes
From MaRDI portal
Publication:2833255
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
Cites work
- A condition for matchability in hypergraphs
- Domination numbers and homology
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Hall's theorem for hypergraphs
- Independence complexes of claw-free graphs
- Odd Independent Transversals are Odd
- The clique complex and hypergraph matching
- The intersection of a matroid and a simplicial complex
- The linear arboricity of graphs
- Triangulated spheres and colored cliques
Cited in
(11)- Two disjoint independent bases in matroid-graph pairs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Forbidden theta graph, bounded spectral radius and size of non-bipartite graphs
- On a conjecture of Stein
- Cooperative colorings and independent systems of representatives
- Some observations on the smallest adjacency eigenvalue of a graph
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Fair representation by independent sets
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Constructing graphs with no independent transversals
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)
