Few colored cuts or cycles in edge colored graphs
Commentationes Mathematicae Universitatis Carolinae (1988)
- Volume: 029, Issue: 2, page 227-232
- ISSN: 0010-2628
Access Full Article
top
How to cite
topMatoušek, Jiří. "Few colored cuts or cycles in edge colored graphs." Commentationes Mathematicae Universitatis Carolinae 029.2 (1988): 227-232. <http://eudml.org/doc/17628>.
@article{Matoušek1988,
author = {Matoušek, Jiří},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {cut set; graph; m-colored edges; cycle},
language = {eng},
number = {2},
pages = {227-232},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Few colored cuts or cycles in edge colored graphs},
url = {http://eudml.org/doc/17628},
volume = {029},
year = {1988},
}
TY - JOUR
AU - Matoušek, Jiří
TI - Few colored cuts or cycles in edge colored graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1988
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 029
IS - 2
SP - 227
EP - 232
LA - eng
KW - cut set; graph; m-colored edges; cycle
UR - http://eudml.org/doc/17628
ER -
References
top- P. ERDÖS J. SPENCER, Probabilistic methods in combinatorics, Akad. Kiado Budapest and Academic Press, New York and London, 1974. (1974) MR0382007
- E. L. LAWLER, Combinatorial Optimisation: Networks and Matroids, Holt, Reinhart and Winston 1976. (1976) MR0439106
- 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, -isoperimetric inequalities for graphs and superconcentrators, J. Comb. Theory Ser. B 38 (1985), pp. 73-88. (1985) MR0782626
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.