3 research outputs found
More on Connector Families
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
International audienc