Universal arrow-free graphs

DOI10.1007/BF00052907MaRDI QIDQ1297747zbMATH OpenWikidataFDO

Authors Menachem Kojman, Martin Goldstern

Publication date 14 September 1999

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

zbMATH Keywords

treescomplexitypathscyclescountable graphsarrow-free graphs

Mathematics Subject Classification ID

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

Recommendations

• The complexity of a class of infinite graphs
• There is no universal countable pentagon‐free graph
• Some remarks on universal graphs

Cites work

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

Cited in

(8)

• There is no universal countable pentagon‐free graph
• Nonexistence of universal graphs without some trees
• Universal graphs with forbidden subgraphs and algebraic closure
• Universality vs genericity and \(C_4\)-free graphs
• A Universal Structure for N -Free Graphs
• Universal graphs with a forbidden subtree
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• Some remarks on universal graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297747)