There is no universal countable pentagon-free graph

✍ Scribed by G. Cherlin; P. Komjáth

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 265 KB
• Volume: 18
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/jgt.3190180405

✦ Synopsis

Abstract

No countable C~n~‐free graph contains every countable C~n~‐free graph as a subgraph, for n ≧ 4. For n = 4, this was proved earlier by J. Pach.