ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph, and let M(G)\mathcal{M}(G) denote its matching complex, whose vertices are the edges of GG and whose simplices are sets of pairwise disjoint edges. Planar matching-complex conjecture. The matching complex M(G)\mathcal{M}(G) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.