Few colored cuts or cycles in edge colored graphs
Matoušek, Jiří
Commentationes Mathematicae Universitatis Carolinae, Tome 029 (1988), p. 227-232 / Harvested from Czech Digital Mathematics Library
Publié le : 1988-01-01
Classification:  05C15,  05C35,  05C38,  05C40,  05C55,  05C80
@article{106630,
     author = {Ji\v r\'\i\ Matou\v sek},
     title = {Few colored cuts or cycles in edge colored graphs},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {029},
     year = {1988},
     pages = {227-232},
     zbl = {0658.05046},
     mrnumber = {957389},
     language = {en},
     url = {http://dml.mathdoc.fr/item/106630}
}
Matoušek, Jiří. Few colored cuts or cycles in edge colored graphs. Commentationes Mathematicae Universitatis Carolinae, Tome 029 (1988) pp. 227-232. http://gdmltest.u-ga.fr/item/106630/

P. Erdös J. Spencer Probabilistic methods in combinatorics, Akad. Kiado Budapest and Academic Press, New York and London, 1974. (1974) | MR 0382007

E. L. Lawler Combinatorial Optimisation: Networks and Matroids, Holt, Reinhart and Winston 1976. (1976) | MR 0439106

A. Lubotzky R. Phillips P. Sarnak Explicit expanders and the Ramanujan conjecture, 18. ACM Annual Symp. on Theory of Comput., 1986, pp. 240-246. (1986)

N. Alon V. D. Milman ${\lambda}_1$-isoperimetric inequalities for graphs and superconcentrators, J. Comb. Theory Ser. B 38 (1985), pp. 73-88. (1985) | MR 0782626