Independence complexes of generalized Mycielskian graphs
Andr\'es Carnero Bravo

TL;DR
This paper investigates the topological properties of independence complexes of generalized Mycielskian graphs, revealing how their homotopy types relate to those of the original graph and its Kronecker double cover, with applications to specific graph classes.
Contribution
It establishes a relationship between the homotopy types of independence complexes of generalized Mycielskian graphs and their Kronecker double covers, providing explicit calculations for certain graph families.
Findings
Homotopy type of independence complex depends on original graph and its Kronecker double cover.
Explicit homotopy types calculated for paths, cycles, and categorical products of complete graphs.
Provides a method to determine topological properties of complex graph constructions.
Abstract
We show that the homotopy type of the independence complex of the generalized Mycielskian of a graph is determined by the homotopy type of the independence complex of and the homotopy type of the independence complex of the Kronecker double cover of . As an application we calculate the homotopy type for paths, cycles and the categorical product of two complete graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Combinatorial Mathematics · Commutative Algebra and Its Applications
