More on Connector Families
| Autor: | János Körner, Gérard D. Cohen, Emanuela Fachini |
|---|---|
| Přispěvatelé: | Mathématiques discrètes, Codage et Cryptographie (MC2), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech |
| Rok vydání: | 2013 |
| Předmět: |
connected components
families of graphs extremal combinatorics Connected component Discrete mathematics Subfamily Applied Mathematics 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Exponential function Combinatorics 010201 computation theory & mathematics [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Cardinality (SQL statements) ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | ENDM ENDM, 2013, 44, pp.23-29 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2013.10.005 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect