Poljak, S.; Turzik, D.; Pudlak, P. Extensions of k-subsets to k+1-subsets - existence versus constructibility. (English) Zbl 0495.68059 Commentat. Math. Univ. Carol. 23, 337-349 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 68R99 Discrete mathematics in relation to computer science 05C38 Paths and cycles 05A05 Permutations, words, matrices 05-04 Software, source code, etc. for problems pertaining to combinatorics 03D15 Complexity of computation (including implicit computational complexity) Keywords:algorithms; relations between decision and construction problems; polynomial time; finite set; Hamiltonian cycles PDF BibTeX XML Cite \textit{S. Poljak} et al., Commentat. Math. Univ. Carol. 23, 337--349 (1982; Zbl 0495.68059) Full Text: EuDML