Skip navigation
Skip navigation

Packing vertices and edges in random regular graphs

Beis, Mihalis; Duckworth, William; Zito, Michele


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

CollectionsANU Research Publications
Date published: 2008
Type: Journal article
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.20165


File Description SizeFormat Image
01_Beis_Packing_vertices_and_edges_in_2008.pdf184.62 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator