Abstract
Ak-tree is ak-uniform hypergraph constructed from a single edge by the successive addition of edges each containing a new vertex andk−1 vertices of an existing edge. We show that ifD is any finite set of positive integers which includes 1, thenD is the set of vertex degrees of somek-tree fork=2, 3, and 4, and that there is precisely one such set,D={1, 4, 6}, which is not the set of degrees of any 5-tree. We also show for eachk≧2 that such a setD is the set of degrees of somek-tree provided only thatD contains some elementd which satisfiesd≧k (k−1)−2 [k/2]+3.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. W. Betneke and R. E. Pippert,Properties and characterizations of k-trees, Mathematika18 (1971), 141–151.
A. K. Dewdney,Higher dimensional tree structures, J. Combinatorial Theory Ser. B17 (1974), 160–164.
R. A. Duke and P. M. Winkler,Realizability of almost all degree sets by k-trees, submitted for publication.
R. A. Duke and P. M. Winkler,Degree sets of k-trees: small degrees, submitted for publication.
F. Harary and E. M. Palmer,On acyclic simplicial complexes, Mathematika15 (1968), 155–162.
S. F. Kapoor, A. D. Polimeni and C. E. Wall,Degree sets for graphs, Fund. Math.XCV (1977), 189–194.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Duke, R.A., Winkler, P.M. Degree sets ofk-trees: Smallk . Israel J. Math. 40, 296–306 (1981). https://doi.org/10.1007/BF02761370
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02761370