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

Article

First Page Preview
Matoušek, Jiří
Few colored cuts or cycles in edge colored graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 2, pp. 227-232
MSC: 05C15, 05C35, 05C38, 05C40, 05C55, 05C80 | MR 957389 | Zbl 0658.05046
References:
[1] P. ERDÖS J. SPENCER: Probabilistic methods in combinatorics. Akad. Kiado Budapest and Academic Press, New York and London, 1974. MR 0382007
[2] E. L. LAWLER: Combinatorial Optimisation: Networks and Matroids. Holt, Reinhart and Winston 1976. MR 0439106
[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 0782626
Partner of
EuDML logo