Bisplit图满足Chen-Chvátal猜想
Bisplit graphs satisfy the Chen-Chvátal conjecture
AI总结：
本文证明了bisplit图满足Chen-Chvátal猜想，即其度量空间存在通用直线或直线数不少于顶点数。
摘要：
本文对一个较小的结果给出了冗长的证明！如果一个图的顶点集可以划分为三个稳定集，其中两个稳定集诱导一个完全二分图，则该图称为bisplit图。我们证明了这些图满足Chen-Chvátal猜想：其度量空间（通常意义下）具有一条通用直线（不寻常意义下），或者其直线数至少等于顶点数。
英文摘要：
In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the Chen-Chvátal conjecture: their metric space (in the usual sense) has a universal line (in an unusual sense) or at least as many lines as the number of vertices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
