Now showing items 1-1 of 1
Core Structures in Random Graphs and Hypergraphs
(University of Waterloo, 2013-08-30)
The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by Bollobás in 1984 in connection to k-connected subgraphs of random graphs. Subsequently, ...