Rao's degree sequence conjecture

DOI10.1016/j.jctb.2013.12.003zbMath1300.05065OpenAlexW1985938097MaRDI QIDQ401494

Maria Chudnovsky, P. D. Seymour

Publication date: 27 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2013.12.003

zbMATH Keywords

induced subgraphwell-quasi-orderinggraph structure theory

Mathematics Subject Classification ID

Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

On realization graphs of degree sequences ⋮ Two short proofs of the bounded case of S. B. Rao's degree sequence conjecture ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ A well-quasi-order for tournaments ⋮ On fractional realizations of graph degree sequences ⋮ A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Stability of the Potential Function ⋮ The principal Erdős-Gallai differences of a degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• A well-quasi-order for tournaments
• Graph minors. XX: Wagner's conjecture
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Extreme degree sequences of simple graphs
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Rao's degree sequence conjecture