On the CF-Connectedness of Complete Bipartite Graphs with One Edge Removed
Mathematics · 20.08.2026 · 14 (16) · 3006
DOI: 10.3390/math14163006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 20.08.2026. Verfasst von Michal Staš und 2 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Scientific Grant Agency.
Abstract (Originalsprache)
The study of graph connectedness is a central topic in graph theory, with CF-connectedness being a specialized property of interest. A simple graph is CF-connected if it is connected and, in each of its optimal drawings, any two of its distinct vertices can be connected by a path consisting of uncrossed edges. This paper explores the CF-connectedness of complete bipartite graphs with one edge removed, denoted as Km,n∖e, where Km,n is a complete bipartite graph with partite sets of sizes m and n, while e is an arbitrary edge. We conjecture that Km,n∖e is CF-connected if and only if it contains no subgraph isomorphic to K3,7∖e or K4,5∖e. We verify this conjecture unconditionally for Km,n∖e with min{m,n}≤5. We also prove unconditionally that cr(K6,6∖e)=32, thereby confirming Chia and Lee’s conjecture in this case and showing that K6,6∖e is not CF-connected. For the remaining cases with larger partite sets, our results are conditional on Chia and Lee’s conjectured formula cr(Km,n∖e)=m2m−12n2n−12−m−12n−12. Assuming this formula, the proposed characterization of CF-connectedness extends to these cases.
Förderung
- Scientific Grant Agency
Zitieren
APA
Staš, M., Švecová, M., & Fortes, J. (2026). On the CF-Connectedness of Complete Bipartite Graphs with One Edge Removed. Mathematics, 14(16), 3006. https://doi.org/10.3390/math14163006
Vancouver
Staš M, Švecová M, Fortes J. On the CF-Connectedness of Complete Bipartite Graphs with One Edge Removed. Mathematics. 2026;14(16):3006. doi:10.3390/math14163006
BibTeX
@article{Sta2026,
author = {Staš, Michal and Švecová, Mária and Fortes, Jana},
title = {On the CF-Connectedness of Complete Bipartite Graphs with One Edge Removed},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {16},
pages = {3006},
doi = {10.3390/math14163006}
}
EUVIMED