Packing vertices and edges in random regular graphs
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
|Collections||ANU Research Publications|
|Source:||Random Structures and Algorithms|
|01_Beis_Packing_vertices_and_edges_in_2008.pdf||184.62 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.