Przytycki–Silvero conjecture on independence complexes of circle graphs
Przytycki–Silvero conjecture on independence complexes of circle graphs
A circle graph is the intersection graph of a chord diagram, and for a simple graph , its independence complex is the simplicial complex whose simplices are the pairwise non-adjacent vertex subsets of .
Przytycki–Silvero conjecture. If is a circle graph, then has the homotopy type of a wedge of spheres.
The conjecture is motivated in part by the relationship between independence complexes of circle graphs and extreme Khovanov homology. Existing results support the conjecture, but the techniques cited in the source do not prove it in full generality.
Sources & referencesView supporting material
Primary source
Rhea Palak Bakshi, Ali Guo, Dionne Ibarra, Gabriel Montoya-Vega, Sujoy Mukherjee, Marithania Silvero and Jonathan Spreer, “Independence complexes of circle graphs”, arXiv:2412.01125 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.