Some remarks on universal graphs

Discrete Mathematics

Volumn 199, Issue 1-3, 1999, Pages 259-265

  Komjath P ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043209310     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00339-2     Document Type: Article

References (10)

1. G. Cherlin, P. Komjáth, There is no universal countable pentagon free graph, J. Graph Theory 18 (1994) 337-341.
2. G. Cherlin, N. Shi, Graphs omitting a finite set of cycles, J. Graph Theory 21 (1996) 351-355.
3. G. Cherlin, N. Shi, L. Tallgren, Graphs omitting a bushy tree, J. Graph Theory 26 (1997) 203-210.
4. Z. Füredi, P. Komjáth, On the existence of countable universal graphs, J. Graph Theory 25 (1997) 53-58.
5. Z. Füredi, P. Komjáth, Nonexistence of universal graphs without some trees, Combinatorica 17 (1997) 163-171.
6. M. Goldstern, M. Kojman, Universal arrow free graphs, Acta Math. Hungar. 73 (1996) 319-326.
7. A. Hajnal, J. Pach, Monochromatic paths in infinite graphs, in: Finite and Infinite sets, Coll. Math. Soc. J. Bolyai, vol. 37, Eger, Hungary, 1981, pp. 359-369.
8. P. Komjáth, A. Mekler, J. Pach, Some universal graphs, Israel J. Math. 64 (1988) 158-168.
9. R. Rado, Universal graphs and universal functions, Acta Arith. 9 (1964) 331-340.
10. R. Rado, Universal graphs, in: Harary, Beineke (Eds.), A Seminar in Graph Theory, Holt, Rinehart, and Winston, New York, 1967.