Pages that link to "Item:Q4297819"
From MaRDI portal
The following pages link to There is no universal countable pentagon‐free graph (Q4297819):
Displaying 14 items.
- Universal graphs with forbidden subgraphs and algebraic closure (Q1293133) (← links)
- Universal arrow-free graphs (Q1297747) (← links)
- The complexity of a class of infinite graphs (Q1323483) (← links)
- Nonexistence of universal graphs without some trees (Q1385982) (← links)
- Universal graphs with a forbidden subgraph: block path solidity (Q1677537) (← links)
- There is no universal countable random-free graph (Q1827759) (← links)
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) (Q2326661) (← links)
- Universality vs genericity and \(C_4\)-free graphs (Q2674563) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Existence and nonexistence of universal graphs (Q3197845) (← links)
- On the existence of countable universal graphs (Q4337505) (← links)
- Graphs omitting a bushy tree (Q4376496) (← links)
- Some remarks on universal graphs (Q5906404) (← links)
- Bowtie‐free graphs and generic automorphisms (Q6096731) (← links)