A new recursive theorem on n-extendibility

DOI10.1007/BF01202239zbMATH Open0868.05040OpenAlexW1971198837MaRDI QIDQ675894FDOQ675894

Authors: Tsuyoshi Nishimura 

Publication date: 11 March 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202239

Recommendations

• Two recursive theorems on \(n\)-extendibility
• Publication:4488558
• An extension of the nondiamond theorem in classical and α-recursion theory
• scientific article; zbMATH DE number 3845570
• scientific article; zbMATH DE number 734454
• Extending properly n - REA sets1
• GENERALIZATIONS OF THE RECURSION THEOREM
• An Extension of Muchnik's Theorem
• Some Theorems on Classes of Recursively Enumerable Sets
• An Extension of Panjer's Recursion

zbMATH Keywords

matching1-factor\(n\)-extendibility

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On n-extendable graphs
• Title not available (Why is that?)
• Graphs with 1-Factors
• Two recursive theorems on \(n\)-extendibility
• Title not available (Why is that?)

Cited In (4)

• A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extension of the nondiamond theorem in classical and α-recursion theory

This page was built for publication: A new recursive theorem on \(n\)-extendibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675894)