几乎有界情形的标号形式。B. Rao度序列猜想
Labelled version of the almost bounded case of S. B. Rao's degree sequence conjecture
摘要：
S. B. Rao证明了图序列在基于诱导子图的包含下是良准序的。这个猜想现在已经被Chudnovsky和Seymour证明了。我们给出了S的几乎有界情形的标号形式的一个独立的简短证明。B. Rao猜想，我们有一个度的界限，但允许有界数量的顶点有无界度的情况。
英文摘要：
S. B. Rao conjectured that graphic sequences are well-quasi-ordered under an inclusion based on induced subgraphs. This conjecture has now been proved by Chudnovsky and Seymour. We give an independent short proof of the labelled version of the almost bounded case of S. B. Rao's conjecture, the case where we have a bound on the degree, but allow a bounded number of vertices to have unbounded degree.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
