The wedge-of-spheres conjecture for matching complexes of planar graphs
Statement
Let be a planar graph, and let denote its matching complex, whose vertices are the edges of and whose simplices are sets of pairwise disjoint edges. Planar matching-complex conjecture. The matching complex is contractible or homotopy equivalent to a wedge of spheres. The result would extend the corresponding classification known for several classes of outerplanar and planar graphs; the paper gives no example of a planar graph whose matching complex has neither of these homotopy types, so the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.