The asymptotic existence of graph decompositions with loops

The asymptotic existence of graph decompositions with loops

Let v [greater than or equal to] k [greater than or equal to] 1 and lamda [greater than or equal to] 0 be integers and G be a graph with n vertices, m edges, and no multiple edges. A (v, k, lambda) block design is a collection Beta of k-subsets of a v-set X in which every unordered pair of elements...

Full description

Bibliographic Details
Main Author: Malloch, Amanda
Other Authors: Dukes, Peter
Language:English
en
Published: 2009
Subjects:
graph decomposition
design theory
UVic Subject Index::Sciences and Engineering
Online Access:http://hdl.handle.net/1828/1705

Internet

http://hdl.handle.net/1828/1705

Similar Items