Few colored cuts or cycles in edge colored graphs
Commentationes Mathematicae Universitatis Carolinae, Tome 29 (1988) no. 2, pp. 227-232
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR ZblMatoušek, Jiří. Few colored cuts or cycles in edge colored graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 29 (1988) no. 2, pp. 227-232. http://geodesic.mathdoc.fr/item/CMUC_1988_29_2_a3/
@article{CMUC_1988_29_2_a3,
author = {Matou\v{s}ek, Ji\v{r}{\'\i}},
title = {Few colored cuts or cycles in edge colored graphs},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {227--232},
year = {1988},
volume = {29},
number = {2},
mrnumber = {957389},
zbl = {0658.05046},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1988_29_2_a3/}
}
[1] P. ERDÖS J. SPENCER: Probabilistic methods in combinatorics. Akad. Kiado Budapest and Academic Press, New York and London, 1974. | MR
[2] E. L. LAWLER: Combinatorial Optimisation: Networks and Matroids. Holt, Reinhart and Winston 1976. | MR
[3] A. LUBOTZKY R. PHILLIPS P. SARNAK: Explicit expanders and the Ramanujan conjecture. 18. ACM Annual Symp. on Theory of Comput., 1986, pp. 240-246.
[4] N. ALON V. D. MILMAN: ${\lambda}_1$-isoperimetric inequalities for graphs and superconcentrators. J. Comb. Theory Ser. B 38 (1985), pp. 73-88. | MR