Packing vertices and edges in random regular graphs

dc.contributor.author	Beis, Mihalis
dc.contributor.author	Duckworth, William
dc.contributor.author	Zito, Michele
dc.date.accessioned	2015-12-08T22:19:59Z
dc.date.issued	2008
dc.date.updated	2015-12-08T08:27:09Z
dc.description.abstract	In this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial up
dc.identifier.issn	1042-9832
dc.identifier.uri	http://hdl.handle.net/1885/31797
dc.publisher	John Wiley & Sons Inc
dc.source	Random Structures and Algorithms
dc.subject	Keywords: Algorithms; Independent sets; Matchings; Random graphs
dc.title	Packing vertices and edges in random regular graphs
dc.type	Journal article
local.bibliographicCitation.issue	1
local.bibliographicCitation.lastpage	37
local.bibliographicCitation.startpage	20
local.contributor.affiliation	Beis, Mihalis, University of Liverpool
local.contributor.affiliation	Duckworth, William, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliation	Zito, Michele, University of Liverpool
local.contributor.authoruid	Duckworth, William, u4278331
local.description.embargo	2037-12-31
local.description.notes	Imported from ARIES
local.identifier.absfor	010303 - Optimisation
local.identifier.ariespublication	u4085724xPUB86
local.identifier.citationvolume	32
local.identifier.doi	10.1002/rsa.20165
local.identifier.scopusID	2-s2.0-38049101391
local.type.status	Published Version

Downloads

Now showing 1 - 1 of 1