English

Exploring Homological Properties of Independent Complexes of Kneser Graphs

Combinatorics 2024-04-17 v1

Abstract

We discuss the topological properties of the independence complex of Kneser graphs, Ind(KG(n,k))(n, k)), with n3n\geq 3 and k1k\geq 1. By identifying one kind of maximal simplices through projective planes, we obtain homology generators for the 66-dimensional homology of the complex Ind(KG(3,k))(3, k)). Using cross-polytopal generators, we provide lower bounds for the rank of pp-dimensional homology of the complex Ind(KG(n,k))(n, k)) where p=1/2(2n+k2n)p=1/2\cdot {2n+k\choose 2n}. Denote Fn[m]\mathcal{F}_n^{[m]} to be the collection of nn-subsets of [m][m] equipped with the symmetric difference metric. We prove that if \ell is the minimal integer with the qqth dimensional reduced homology H~q(VR(Fn[];2(n1)))\tilde{H}_q(\mathcal{VR}(\mathcal{F}^{[\ell]}_n; 2(n-1))) being non-trivial, then rank(H~q(VR(Fn[m];2(n1)))i=m(i22)rank(H~q(VR(Fn[];2(n1))).\text{rank} (\tilde{H}_q(\mathcal{VR}(\mathcal{F}_n^{[m]}; 2(n-1)))\geq \sum_{i=\ell}^m{i-2\choose \ell-2}\cdot \text{rank} (\tilde{H}_q(\mathcal{VR}(\mathcal{F}_n^{[\ell]}; 2(n-1))). Since the independence complex Ind(KG(n,k))(n, k)) and the Vietoris-Rips complex VR(Fn[2n+k];2(n1))\mathcal{VR}(\mathcal{F}^{[2n+k]}_n; 2(n-1)) are the same, we obtain a homology propagation result in the setting of independence complexes of Kneser graphs. Connectivity of these complexes is also discussed in this paper.

Keywords

Cite

@article{arxiv.2404.10566,
  title  = {Exploring Homological Properties of Independent Complexes of Kneser Graphs},
  author = {Ziqin Feng and Guanghui Wang},
  journal= {arXiv preprint arXiv:2404.10566},
  year   = {2024}
}