THERE IS NO UNIVERSAL COUNTABLE PENTAGON-FREE GRAPH

Authors
CHERLIN G KOMJATH P
Citation
G. Cherlin et P. Komjath, THERE IS NO UNIVERSAL COUNTABLE PENTAGON-FREE GRAPH, Journal of graph theory, 18(4), 1994, pp. 337-341
Citations number
6
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
18
Issue
4
Year of publication
1994
Pages
337 - 341
Database
ISI
SICI code
0364-9024(1994)18:4<337:TINUCP>2.0.ZU;2-5
Abstract
No countable C(n)-free graph contains every countable C(n)-free graph as a subgraph, for n greater-than-or-equal-to 4. For n = 4, this was p roved earlier by J. Pach. (C) 1994 John Wiley & Sons, Inc.