| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652011 | Electronic Notes in Discrete Mathematics | 2013 | 7 Pages |
Abstract
Let Gk,n be the family of all graphs on the same n vertices each having at least k connected components. We are interested in the largest cardinality of a subfamily in which the union of any two of the member graphs has at most k−2 connected components, and determine its exponential asymptotics.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
