Full Subgraphs

Journal of Graph theory 88, no 3, p.411-427. Abstract Let be a graph of density p on n vertices. Following Erdős, Łuczak, and Spencer, an m‐vertex subgraph H of G is called fullif H has minimum degree at lea. Let denote the order of a largest of G. If is a nonnegative integer, define

Read more