Year: 2026
Type: article
Abstract: A bipartite graph $G[A,B]$ is a brace if either the underlying simple graph of $G$ is one of the complete bipartitegraphs $K_2$ and $K_{2,2}$, or $G$ has at least six vertices and $G-a-a'-b-b'$ has a perfect matching, for every four distinct vertices $a,a'\in A$ and $b,b'\in B$. An edge $e$ of $G$ is thin if the graph $\widehat{G-e}$, obtained from $G-e$ by repeatedly bicontracting vertices of degree two, is a brace. In this paper, we prove that each simple brace of order six or more contains at least two nonadjacent thin edges, thereby solving a problem posed by Carvalho, Lucchesi and Murty.
DOI: 10.37236/13866
Institutions: Jimei University, Universidade de São Paulo
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Awards: G4608934693, G6910113313, G7669448605
OpenAlex ID: W7236714606
