Degree-doubling graph families
classification
🧮 math.CO
cs.ITmath.IT
keywords
degreefamilygraphsanalogousasymptoticscardinalitydegree-doublingdetermine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.