About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Poljak, Svatopluk ; Turzík, Daniel ; Pudlák, Pavel
Extensions of $k$-subsets to $k+1$-subsets - existence versus constructability. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 337-349
MSC: 03D15, 05-04, 05A05, 05C38, 68C05, 68R99 | MR 664978 | Zbl 0495.68059
References:
[1] T. BAKER J. GILL R. SOLOVAY: Relativizations of the $P=?NP$ question. SIAM J. Comp. Vol. 4 (1975), 431-442. MR 0395311
[2] C. BERGE: Graphs and Hypergraphs. North-Holland, Amsterdam (1973). MR 0357172 | Zbl 0254.05101
[3] J. A. BONDY V. CHVÁTAL: A method in graph theory. Discrete Mathematica 16 (1976), 111-135. MR 0414429
[4] V. CHVÁTAL: On Hamiltonian's ideals. Jouгnal of Combinatorial Theory 12 (1972), 163-168. MR 0294155
[5] J. E. HOPCROFT R. M. KARP: Ann $n^{5/2}$ Algorithm for Maximal Matchings in Bipartite Gгaphs. SIAM J. Comp. Vol. 2 (1973), 225-231. MR 0337699
[6] C. P. SCHNORR: Optimal algoгithms for self-reducible problems. Automata, Languages and Programming 1976, Eds.: S. Michaelson and R. Milner, University Press Edinburgh, 322-337.
[7] A. G. THOMASOM: Hamiltonian cycles and uniquely edge colourable graphs. Advances in Graph Theoгy B. Bollobás, ed., Annals of Discrete Mathematics 3 (1976), 259-268. MR 0499124
[8] C. GREENE D. J. KLEITMAN: Pгoof techniques in the theory of finite sets. Studies in Combinatorics, pp. 22-79, MAA Studles in Math. 17, Math. Assoc. America, Washington, D.C., 1978. MR 0513002
Partner of
EuDML logo