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

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

2011-12-16

arxiv.org/abs/1112.3920v1

Mathematics

Combinatorics

4 pages

Scientific paper

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 and P. Seymour. One part of the proof proves the result for the bounded case, a result proved independently by C. J. Altomare. We give two short proofs of the bounded case of S. B. Rao's conjecture. Both the proofs use the fact that if the number of entries in an integer sequence (with even sum) is much larger than its highest term, then it is necessarily graphic.

Affiliated with

Also associated with

No associations

Rating

Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137823