Test environment running 7.6.6

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.

On Subgraph Sizes in Random Graphs

Thumbnail Image

Date

1992

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

For a graph G with m edges let its Range of Subgraph Sizes (RSS) ρ(G) = {t : G contains a vertex-induced subgraph with t edges}. G has a full RSS if ρ(G) = {0, 1, …, m}. We establish the threshold for a random graph to have a full RSS and give tight bounds on the likely RSS of a dense random graph.

Description

Keywords

Citation

URI

https://dspace-test.anu.edu.au/handle/1885/733741379

Collections

DevOps Pure Testing

Source

Combinatorics Probability and Computing

Type

Article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1017/S0963548300000146

Restricted until

DSpace software copyright © 2002-2026 LYRASIS