On Ramsey graphs without cycles of short odd lengths

Jaroslav Nešetřil; Vojtěch Rödl

Commentationes Mathematicae Universitatis Carolinae (1979)

  • Volume: 020, Issue: 3, page 565-582
  • ISSN: 0010-2628

How to cite

top

Nešetřil, Jaroslav, and Rödl, Vojtěch. "On Ramsey graphs without cycles of short odd lengths." Commentationes Mathematicae Universitatis Carolinae 020.3 (1979): 565-582. <http://eudml.org/doc/16994>.

@article{Nešetřil1979,
author = {Nešetřil, Jaroslav, Rödl, Vojtěch},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {F-partition property; cycles},
language = {eng},
number = {3},
pages = {565-582},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {On Ramsey graphs without cycles of short odd lengths},
url = {http://eudml.org/doc/16994},
volume = {020},
year = {1979},
}

TY - JOUR
AU - Nešetřil, Jaroslav
AU - Rödl, Vojtěch
TI - On Ramsey graphs without cycles of short odd lengths
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1979
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 020
IS - 3
SP - 565
EP - 582
LA - eng
KW - F-partition property; cycles
UR - http://eudml.org/doc/16994
ER -

References

top
  1. Colloquium of finite and infinite set theory, Keszthely, Hungary, 10. Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, 1975. (1975) 
  2. P. ERDÖS, Graph theory and probability, Canad. J. Math. 11 (1959), 34-38. (1959) MR0102081
  3. P. ERDÖS, Problems and results of finite and infinite graphs, Recent advances in graph theory, Academia Praha (1975), 183-190. (1975) MR0389669
  4. L. LOVÁSZ, On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hunger. 19 (1968), 59-67. (1968) MR0220621
  5. J. NEŠETŘIL V. RÖDL, A simple proof of the Galvin-Ramsey property of finite graphs and a dimension of a graph, Discrete Math. 23, 1 (1978), 49-56. (1978) MR0523311
  6. J. NEŠETŘIL V. RÖDL, Partitions of vertices, Comment. Math. Univ. Carolinae 17 (1976), 85-95. (1976) MR0412044
  7. J. NEŠETŘIL V. RÖDL, Type theory of partition properties of graphs, Recent advances in graph theory, Academia Praha (1975), 405-412. (1975) MR0409259
  8. J. NEŠETŘIL V. RÖDL, Partitions of subgraphs, Recent advances in graph theory, Academia Praha (1975), 413-423. (1975) MR0429655
  9. J. NEŠETŘIL V. RÖDL, A Ramsey graph without triangles exists for any graph without triangles, Colloquium on finite and infinite set theory, 10. Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam (1975), 1127-1132. (1975) MR0392695
  10. V. RÖDL, A generalization of the Ramsey theorem, in: Graphs, hyper graphs and block systems, Zielona Gora (1976), 211-220. (1976) 
  11. H. WALTHER H. J. VOSS, Über Kreise in Graphen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1974. (1974) 
  12. F. HARARY, Graph Theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911

NotesEmbed ?

top

You must be logged in to post comments.