Premium
There is no universal countable pentagon‐free graph
Author(s) -
Cherlin G.,
Komjáth P.
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180405
Subject(s) - countable set , mathematics , combinatorics , pentagon , graph , discrete mathematics , geometry
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.