The asymptotic number of claw-free cubic graphs

McKay, Brendan; Palmer, Edgar M; Read, Ronald C; Robinson, Robert W

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.

The asymptotic number of claw-free cubic graphs

Date

2003

Authors

McKay, Brendan

Palmer, Edgar M

Read, Ronald C

Robinson, Robert W

Publisher

Elsevier

Abstract

Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. In an earlier paper we characterized claw-free cubic graphs and derived a recurrence relation for Hn. Here we determine the asymptotic behavior of this sequence: Hn ∼ (2n)!/e√6πn (n/