Title:
|
Few colored cuts or cycles in edge colored graphs (English) |
Author:
|
Matoušek, Jiří |
Language:
|
English |
Journal:
|
Commentationes Mathematicae Universitatis Carolinae |
ISSN:
|
0010-2628 (print) |
ISSN:
|
1213-7243 (online) |
Volume:
|
29 |
Issue:
|
2 |
Year:
|
1988 |
Pages:
|
227-232 |
. |
Category:
|
math |
. |
MSC:
|
05C15 |
MSC:
|
05C35 |
MSC:
|
05C38 |
MSC:
|
05C40 |
MSC:
|
05C55 |
MSC:
|
05C80 |
idZBL:
|
Zbl 0658.05046 |
idMR:
|
MR957389 |
. |
Date available:
|
2008-06-05T21:33:10Z |
Last updated:
|
2012-04-28 |
Stable URL:
|
http://hdl.handle.net/10338.dmlcz/106630 |
. |
Reference:
|
[1] P. ERDÖS J. SPENCER: Probabilistic methods in combinatorics.Akad. Kiado Budapest and Academic Press, New York and London, 1974. MR 0382007 |
Reference:
|
[2] E. L. LAWLER: Combinatorial Optimisation: Networks and Matroids.Holt, Reinhart and Winston 1976. MR 0439106 |
Reference:
|
[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. |
Reference:
|
[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 |
. |