On Two Unsolved Problems Concerning Matching Covered Graphs

A cut $C:=\partial(X)$ of a matching covered graph $G$ is a separating cut if both its $C$-contractions $G/X$ and $G/\overline{X}$ are also matching covered. A brick is solid if it is free of nontrivial separating cuts. In 2004, we (Carvalho, Lucchesi and Murty) showed that the perfect matching polytope of a brick may be described without recourse to odd set constraints if and only if it is solid. In 2006, we proved that the only simple planar solid bricks are the odd wheels. The problem of characterizing nonplanar solid bricks remains unsolved. A bi-subdivision of a graph $J$ is a graph obtained from $J$ by replacing each of its edges by paths of odd length. A matching covered graph $J$ is a conformal minor of a matching covered graph $G$ if there exists a bi-subdivision $H$ of $J$ which is a subgraph of $G$ such that $G-V(H)$ has a perfect matching. For a fixed matching covered graph $J$, a matching covered graph $G$ is $J$-based if $J$ is a conformal minor of $G$ and, otherwise, $G$ is $J$-free. A basic result due to Lov\'asz (1983) states that every nonbipartite matching covered graph is either $K_4$-based or is $\overline{C_6}$-based or both, where $\overline{C_6}$ is the triangular prism. In 2016, we (Kothari and Murty) showed that, for any cubic brick $J$, a matching covered graph $G$ is $J$-free if and only if each of its bricks is $J$-free. We also found characterizations of planar bricks which are $K_4$-free and those which are $\overline{C_6}$-free. Each of these problems remains unsolved in the nonplanar case. In this paper we show that the seemingly unrelated problems of characterizing nonplanar solid bricks and of characterizing nonplanar $\overline{C_6}$-free bricks are essentially the same. We do this by establishing that a simple nonplanar brick, other than the Petersen graph, is solid if and only if it is $\overline{C_6}$-free.