Abstract
IfG k is the family of countable graphs with nok vertex (or edge) disjoint circuits (1<k<ω) then there is a countableG ′ k ≤G k such that every member ofG k is an (induced) subgraph of some member ofG ′ k , but no finiteG ′ k suffices.
Similar content being viewed by others
References
G. Cherlin, andP. Komjáth: There is no universal countable pentagon free graph,Journal of Graph Theory, to appear.
A. Hajnal, andJ. Pach: Monochromatic paths in infinite graphs, in:Finite and Infinite sets, Coll. Soc. J. Bolyai 37 (North-Holland, Amsterdam, 1981), 359–369.
P. Komjáth, A. Mekler, andJ. Pach: Some universal graphs,Israel J. of Math. 64 (1988), 158–168.
P. Komjáth, andJ. Pach: Universal graphs without large bipartite graphs,Mathematika 31 (1984), 282–290.
P. Komjáth, andJ. Pach: Universal elements and the complexity of certain classes of infinite graphs,Discrete Math. 95 (1991), 255–270.
P. Komjáth, andS. Shelah: Universal graphs without large cliques, in preparation.
R. Rado: Universal graphs and universal functions,Acta Arithmetica 9 (1964), 331–340.
R. Rado: Universal graphs, in:A Seminar in Graph Theory, (eds. Harary, Beineke), Holt, Rinehart, and Winston Co., 1967.