Rao’s degree sequence conjecture

Author(s): Chudnovsky, Maria; Seymour, Paul D.

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1fh5z

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2018-07-20T15:09:42Z	-
dc.date.available	2018-07-20T15:09:42Z	-
dc.date.issued	2014-03	en_US
dc.identifier.citation	Chudnovsky, Maria, Seymour, Paul. (2014). Rao’s degree sequence conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B, 105 (44 - 92. doi:10.1016/j.jctb.2013.12.003	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1fh5z	-
dc.description.abstract	Let us say two (simple) graphs G, G’ are degree-equivalent if they have the same vertex set, and for every vertex, its degrees in G and in G’ are equal. In the early 1980’s, S.B. Rao made the conjecture that in any infinite set of graphs, there exist two of them, say G and H, such that H is isomorphic to an induced subgraph of some graph that is degree-equivalent to G. We prove this conjecture. (C) 2014 Elsevier Inc. All rights reserved.	en_US
dc.format.extent	44 - 92	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	JOURNAL OF COMBINATORIAL THEORY SERIES B	en_US
dc.rights	Author's manuscript	en_US
dc.title	Rao’s degree sequence conjecture	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2013.12.003	-
dc.date.eissued	2014-01-22	en_US
dc.identifier.eissn	1096-0902	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
Rao.pdf		307.77 kB	Adobe PDF	View/Download