On the Existence of Countable Universal Graphs

Zoltán Füredi, Péter Komjáth

Research output: Contribution to journalArticle

12 Citations (Scopus)


Let Forb(G) denote the class of graphs with countable vertex sets which do not contain G as a subgraph. If G is finite, 2-connected, but not complete, then Forb(G) has no element which contains every other element of Forb(G) as a subgraph, i.e., this class contains no universal graph.

Original languageEnglish
Pages (from-to)53-58
Number of pages6
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - May 1997


ASJC Scopus subject areas

  • Geometry and Topology

Cite this