Wedge-of-spheres conjecture for robust clique complexes of square-sequence graphs
Wedge-of-spheres conjecture for robust clique complexes of square-sequence graphs
Let be a graph with a square sequence
where , and let denote the -robust clique complex of .
Wedge-of-spheres conjecture. For all , the complex is homotopy equivalent to a wedge sum of -dimensional spheres. Moreover, the number of spheres is determined by a recurrence relation based on the homotopy type of and the specific attachment of the -th square.
This conjecture seeks to extend the established homotopy results for robust clique complexes from to all . The stated recurrence is not given explicitly here, so determining the sphere count and proving the claimed wedge decomposition remain open.
Sources & referencesView supporting material
Primary source
Marek Filakovský, “The Topology of k-Robust Clique Complexes in Grid-like Graphs”, arXiv:2602.11365 (2026).
Additional references
7 papers in this index state this conjecture (2016–2026). The statement above is taken from the most recent of them; the others are arXiv:2407.05809, arXiv:2403.15298, arXiv:2305.18648, arXiv:2106.09915, arXiv:1909.10406, arXiv:1608.03002.
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.