Labelled version of the almost bounded case of S. B. Rao's degree sequence conjecture

2013/06/14 by Vaidy Sivaraman, Sivaraman, Vaidy
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1306.3508

3 pages

arxiv created 2013/06/14 · arxiv updated 2013/06/18

Abstract

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.

Related

• A Semigroup Proof of the Bounded Degree Case of S.B. Rao's Conjecture on Degree Sequences and a Bipartite Analogue
• Rao's Theorem for forcibly planar sequences revisited
• Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
• On embedding degree sequences
• Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation