| [1] |
I. Bárány, A short proof of Kneser’s conjecture, to appear.; I. Bárány, A short proof of Kneser’s conjecture, to appear. |
| [2] |
Bollobás, B., Extremal Graph Theory (1978), Academic Press: Academic Press New York · Zbl 0419.05031 |
| [3] |
Geller, D. P., \(r\)-tuple colorings of uniquely colorable graphs, Discrete Math., 16, 9-12 (1976) · Zbl 0338.05104 |
| [4] |
Geller, D. P.; Stahl, S., The chromatic number and other functions of the lexicographic product of graphs, J. Combin. Theory, 19, 87-95 (1975) · Zbl 0282.05114 |
| [5] |
Greenwell, D.; Lovász, L., Applications of product colouring, Acta Math. Acad. Sci. Hungar., 25, 335-340 (1974) · Zbl 0294.05108 |
| [6] |
Hilton, A. J.W.; Milner, E. C., Some interaction theorems for systems of finite sets, Quart. J. Math., 18, 2, 369-384 (1967), Oxford · Zbl 0168.26205 |
| [7] |
Hilton, A. J.W.; Rado, R.; Scott, S. H., A (<5)-colour theorem for planar graphs, Bull. London Math. Soc., 5, 302-306 (1973) · Zbl 0278.05103 |
| [8] |
Kneser, M., Aufgabe 360, Jahresbericht, Dtsch. Math. Ver., 58, 2, 27 (1955 1956) |
| [9] |
L. Lovász, Kneser’s conjecture, homotopy and Borsuk’s theorem, to appear.; L. Lovász, Kneser’s conjecture, homotopy and Borsuk’s theorem, to appear. |
