๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

1-Generic degrees and minimal degrees in higher recursion theory, II

โœ Scribed by C.T. Chong


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
837 KB
Volume
31
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Minimum independent generalized t-degree
โœ O. Favaron; Y. Redouane ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 448 KB

The minimum independent generalized t-degree of a graph G = (V,E) is ut = min{ IN(H H is an independent set of t vertices of G}, with N(H) = UxtH N(x). In a KI,~+I -free graph, we give an upper bound on u! in terms of r and the independence number CI of G. This generalizes already known results on u