On the existence of countable universal graphs
From MaRDI portal
Recommendations
Cited in
(29)- Representation of ideals of relational structures
- Universal elements and the complexity of certain classes of infinite graphs
- Universal graphs with forbidden subgraphs and algebraic closure
- Nonexistence of universal graphs without some trees
- Universal graphs with a forbidden subgraph: block path solidity
- Hadwiger's conjecture for uncountable graphs
- There is no universal countable random-free graph
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- On universal positive graphs
- Forbidden subgraphs and forbidden substructures
- The countable character of uncountable graphs
- Existence and nonexistence of universal graphs
- Universal graphs for two graph properties.
- The research of the existence of universal hypergraphs
- scientific article; zbMATH DE number 3954975 (Why is no real title available?)
- There is no universal countable pentagon‐free graph
- scientific article; zbMATH DE number 1072415 (Why is no real title available?)
- scientific article; zbMATH DE number 1117459 (Why is no real title available?)
- Some remarks on universal graphs
- Some remarks on universal graphs
- Countable \(\alpha\)-extendable graphs
- A note on classes of subgraphs of locally finite graphs
- Universal graphs for the topological minor relation
- Bowtie‐free graphs and generic automorphisms
- Universal graphs with forbidden wheel minors
- On graph classes with minor-universal elements
- Universal graphs with a forbidden subtree
- Universality and asymptotics of graph counting problems in non-orientable surfaces
This page was built for publication: On the existence of countable universal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337505)