Nonexistence of universal graphs without some trees

DOI10.1007/BF01200905zbMath0889.05038MaRDI QIDQ1385982

Zoltan Fueredi, Péter Komjáth

Publication date: 6 May 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

graphuniversal graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Universal graphs at the successor of a singular cardinal ⋮ On properties of theories which preclude the existence of universal models ⋮ Universal graphs with a forbidden subtree ⋮ Some remarks on universal graphs ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Universal graphs with forbidden subgraphs and algebraic closure ⋮ UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS ⋮ Club guessing and the universal models

Cites Work

• Unnamed Item
• Edge disjoint placement of graphs
• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• Universal arrow-free graphs
• The complexity of a class of infinite graphs
• Subgraphs of graphs. I
• Graphs omitting sums of complete graphs
• Universal graphs without large bipartite subgraphs
• There is no universal countable pentagon‐free graph
• On the existence of countable universal graphs
• Graphs omitting a finite set of cycles
• Universal graphs and universal functions

This page was built for publication: Nonexistence of universal graphs without some trees