Nonadjacent Thin Edges in Simple Braces
The Electronic Journal of Combinatorics · 20.11.2026 · 33 (4)
DOI: 10.37236/13866 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 20.11.2026. Verfasst von Xing Feng und 3 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Feng, X., Lucchesi, C. L., Yan, W., & Zhou, J. (2026). Nonadjacent Thin Edges in Simple Braces. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/13866
Vancouver
Feng X, Lucchesi CL, Yan W, Zhou J. Nonadjacent Thin Edges in Simple Braces. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/13866
BibTeX
@article{Feng2026,
author = {Feng, Xing and Lucchesi, Cláudio L. and Yan, Weigen and Zhou, Jinqiu},
title = {Nonadjacent Thin Edges in Simple Braces},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {4},
doi = {10.37236/13866}
}
EUVIMED