Universal arrow-free graphs

DOI10.1007/BF00052907zbMath0921.05052WikidataQ56504570 ScholiaQ56504570MaRDI QIDQ1297747

Menachem Kojman, Martin Goldstern

Publication date: 14 September 1999

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

complexitypathscyclestreescountable graphsarrow-free graphs

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Universal graphs with a forbidden subtree ⋮ Nonexistence of universal graphs without some trees ⋮ Some remarks on universal graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Universal graphs with forbidden subgraphs and algebraic closure

Cites Work

• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• There is no universal countable pentagon‐free graph

This page was built for publication: Universal arrow-free graphs