论文信息 - There is no universal countable pentagon-free graph - 字舞流文

There is no universal countable pentagon-free graph

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

Péter Komjáth | Gregory L. Cherlin

[1] János Pach,et al. Universal graphs without large bipartite subgraphs , 1984 .

[2] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[3] János Pach,et al. Universal elements and the complexity of certain classes of infinite graphs , 1991, Discret. Math..

[4] R. Rado. Universal graphs and universal functions , 1964 .

[5] János Pach,et al. Some universal graphs , 1988 .