Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has maximum degree 4. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed. ©2013 Society for Industrial and Applied Mathematics.
Degree-doubling graph families / Korner, Janos; Muzi, Irene. - In: SIAM JOURNAL ON DISCRETE MATHEMATICS. - ISSN 0895-4801. - STAMPA. - 27:3(2013), pp. 1575-1583. [10.1137/120887242]
Degree-doubling graph families
KORNER, JANOS;MUZI, IRENE
2013
Abstract
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has maximum degree 4. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed. ©2013 Society for Industrial and Applied Mathematics.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.
