Packing vertices and edges in random regular graphs
Date
2008
Authors
Beis, Mihalis
Duckworth, William
Zito, Michele
Journal Title
Journal ISSN
Volume Title
Publisher
John Wiley & Sons Inc
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
Description
Keywords
Keywords: Algorithms; Independent sets; Matchings; Random graphs
Citation
Collections
Source
Random Structures and Algorithms
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description