Degree-doubling graph families
Combinatorics
2012-08-10 v1 Information Theory
math.IT
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 degree four. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed.
Cite
@article{arxiv.1208.1963,
title = {Degree-doubling graph families},
author = {János Körner and Irene Muzi},
journal= {arXiv preprint arXiv:1208.1963},
year = {2012}
}
Comments
9 pages