Przytycki–Silvero conjecture for bipartite circle graphs
Przytycki–Silvero conjecture for bipartite circle graphs
A circle graph is the intersection graph of a chord diagram, a graph is bipartite if its vertices can be partitioned into two independent sets, 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 for bipartite circle graphs. If is a bipartite circle graph, then has the homotopy type of a wedge of spheres.
This is presented as a weaker version of the general Przytycki–Silvero conjecture and is especially relevant to Khovanov homology, since the graphs arising from link diagrams are bipartite. Its status is not resolved in the supplied text.
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.