There is no universal countable pentagon‐free graph

DOI10.1002/jgt.3190180405zbMath0805.05044OpenAlexW2009418635MaRDI QIDQ4297819

Péter Komjáth, Gregory L. Cherlin

Publication date: 4 July 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180405

zbMATH Keywords

circuitsuniversal countable graphpentagon-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

Nonexistence of universal graphs without some trees ⋮ Universality vs genericity and \(C_4\)-free graphs ⋮ Bowtie‐free graphs and generic automorphisms ⋮ Many Facets of Dualities ⋮ 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 arrow-free graphs ⋮ The complexity of a class of infinite graphs

This page was built for publication: There is no universal countable pentagon‐free graph