Universal arrow-free graphs

DOI10.1007/BF00052907zbMATH Open0921.05052WikidataQ56504570 ScholiaQ56504570MaRDI QIDQ1297747FDOQ1297747

Authors: Menachem Kojman, Martin Goldstern 

Publication date: 14 September 1999

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

Recommendations

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

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)

Cites Work

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

Cited In (7)

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

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)