On the existence of countable universal graphs

DOI<53::AID-JGT3>3.0.CO;2-H 10.1002/(SICI)1097-0118(199705)25:1<53::AID-JGT3>3.0.CO;2-HzbMath0878.05064OpenAlexW2041224716MaRDI QIDQ4337505

Péter Komjáth, Zoltan Fueredi

Publication date: 19 May 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199705)25:1<53::aid-jgt3>3.0.co;2-h

zbMATH Keywords

forbidden subgraph2-connecteduniversal elementcountable universal graphsnearly disjoint hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Universal graphs with a forbidden subtree ⋮ Universal graphs with a forbidden subgraph: block path solidity ⋮ Nonexistence of universal graphs without some trees ⋮ A note on classes of subgraphs of locally finite graphs ⋮ Universal graphs for the topological minor relation ⋮ Bowtie‐free graphs and generic automorphisms ⋮ Forbidden subgraphs and forbidden substructures ⋮ Some remarks on universal graphs ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Representation of ideals of relational structures ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ Universal graphs with forbidden subgraphs and algebraic closure