Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2010 | Published
Book Section - Chapter Open

The proportion of various graphs in graph-designs

Abstract

Let G be a family of simple graphs. A G-design on n points is a decomposition of the edges of K_n into copies of graphs in G. In case that G consists of complete graphs K_k with k in some set K of positive integers, such a G-design is called a pairwise balanced design (PBD) on n points with block sizes from K. Here we are concerned with the possible proportions of the numbers of copies of graphs G ∈ G that appear in decompositions for large n. We extend a result of Colbourn and Rodl on PBDs to G-designs, and give a further result on the possible numbers of copies of G in a G-design containing each vertex of the complete graph K_n.

Additional Information

© 2010 American Mathematical Society. The author was supported in part by NSF Grant #0555755.

Attached Files

Published - Wilson2010p12879Automorphic_Forms_And_L-Functions_I._Global_Aspects.pdf

Files

Wilson2010p12879Automorphic_Forms_And_L-Functions_I._Global_Aspects.pdf
Files (132.0 kB)

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024