Universal elements and the complexity of certain classes of infinite graphs
From MaRDI portal
Publication:1191925
DOI10.1016/0012-365X(91)90340-8zbMath0756.05097MaRDI QIDQ1191925
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph theory (05C99)
Related Items (8)
Universal graphs with a forbidden subgraph: block path solidity ⋮ Nonexistence of universal graphs without some trees ⋮ Universality vs genericity and \(C_4\)-free graphs ⋮ Forbidden subgraphs and forbidden substructures ⋮ There is no universal countable random-free graph ⋮ Universal graphs with forbidden subgraphs and algebraic closure ⋮ Universal arrow-free graphs ⋮ The complexity of a class of infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On universal graphs without instances of CH
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs
- On universal graphs with forbidden topological subgraphs
- Some universal graphs
- A problem of Ulam on planar graphs
- The age of a relational structure
- Model theory
- Notes on combinatorial set theory
- Universal graphs without large bipartite subgraphs
- Superstable graphs
- Zero-One Laws for Sparse Random Graphs
- Embedding Graphs into Colored Graphs
- Countable Ultrahomogeneous Undirected Graphs
- Simplicial Decompositions: Some New Aspects and Applications
- Probabilities on finite models
- Stable graphs
- Universal graphs and universal functions
- Sur l'extension aux relations de quelques propriétés des ordres
- Some remarks on universal graphs
This page was built for publication: Universal elements and the complexity of certain classes of infinite graphs
