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.
More on Connector Families / Gérard, Cohen; Fachini, Emanuela; Korner, Janos. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - ELETTRONICO. - 44:(2013), pp. 23-29. [10.1016/j.endm.2013.10.005]
More on Connector Families
FACHINI, Emanuela;KORNER, JANOS
2013
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.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
