Packing vertices and edges in random regular graphs

Beis, Mihalis; Duckworth, William; Zito, Michele

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Packing vertices and edges in random regular graphs

Date

2008

Authors

Beis, Mihalis

Duckworth, William

Zito, Michele

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