Title of article
More on Connector Families
Author/Authors
Cohen، نويسنده , , Gérard and Fachini، نويسنده , , Emanuela and Kِrner، نويسنده , , Jلnos، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
7
From page
23
To page
29
Abstract
Let G k , 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.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2013
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456402
Link To Document