activity
20112026
most citedClasses of graphs with no long cycle as a vertex-minor are polynomially -bounded

9 citations · 27 across the 19 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

math.CO2011★ 2 cited

Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture

Vaidy Sivaraman

S. B. Rao conjectured that graphic sequences are well-quasi-ordered under an inclusion based on induced subgraphs. This conjecture has now been settled completely by M. Chudnovsky…