✦ 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
DOI: 10.1016/0168-0072(86)90068-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal Degrees in Generalized Recursion

Minimal Degrees in Generalized Recursion Theory

✍ Michael Machtey 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 984 KB

Minimal degrees recursive in 1-generic d

Minimal degrees recursive in 1-generic degrees

✍ C.T. Chong; R.G. Downey 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 830 KB

On independent generalized degrees and i

On independent generalized degrees and independence numbers in K(1, m)-free graphs

✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.M. Lesniak; T.E. Lindquester 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Minimum independent generalized t-degree

Minimum independent generalized t-degree and independence number in K1,r+1-free graphs

✍ 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