| Title:
|
Extensions of $k$-subsets to $k+1$-subsets - existence versus constructability (English) |
| Author:
|
Poljak, Svatopluk |
| Author:
|
Turzík, Daniel |
| Author:
|
Pudlák, Pavel |
| Language:
|
English |
| Journal:
|
Commentationes Mathematicae Universitatis Carolinae |
| ISSN:
|
0010-2628 (print) |
| ISSN:
|
1213-7243 (online) |
| Volume:
|
23 |
| Issue:
|
2 |
| Year:
|
1982 |
| Pages:
|
337-349 |
| . |
| Category:
|
math |
| . |
| MSC:
|
03D15 |
| MSC:
|
05-04 |
| MSC:
|
05A05 |
| MSC:
|
05C38 |
| MSC:
|
68C05 |
| MSC:
|
68R99 |
| idZBL:
|
Zbl 0495.68059 |
| idMR:
|
MR664978 |
| . |
| Date available:
|
2008-06-05T21:11:45Z |
| Last updated:
|
2012-04-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/106156 |
| . |
| Reference:
|
[1] T. BAKER J. GILL R. SOLOVAY: Relativizations of the $P=?NP$ question.SIAM J. Comp. Vol. 4 (1975), 431-442. MR 0395311 |
| Reference:
|
[2] C. BERGE: Graphs and Hypergraphs.North-Holland, Amsterdam (1973). Zbl 0254.05101, MR 0357172 |
| Reference:
|
[3] J. A. BONDY V. CHVÁTAL: A method in graph theory.Discrete Mathematica 16 (1976), 111-135. MR 0414429 |
| Reference:
|
[4] V. CHVÁTAL: On Hamiltonian's ideals.Jouгnal of Combinatorial Theory 12 (1972), 163-168. MR 0294155 |
| Reference:
|
[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 |
| Reference:
|
[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. |
| Reference:
|
[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 |
| Reference:
|
[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 |
| . |
