The quasi order of graphs on an ordinal
From MaRDI portal
Publication:2275378
Recommendations
Cites work
- A partition theorem for the complete graph on ^
- A short proof of a partition theorem for the ordinal ωω
- A uniqueness theorem for iterations
- Borel sets and Ramsey's theorem
- Combinatorial set theory
- Countable partition ordinals
- scientific article; zbMATH DE number 3596855 (Why is no real title available?)
- scientific article; zbMATH DE number 3288588 (Why is no real title available?)
- Negative partition relations for ordinals \(\omega^{\omega^\alpha}\)
- On a Partition Relation for Ordinal Numbers
- Partition relations for denumerable ordinals
- Pinning for pairs of countable ordinals
Cited in
(7)- Perfectly orderable graphs are quasi-parity graphs: a short proof
- Letter graphs and well-quasi-order by induced subgraphs
- An enumeration of distinct and non-isomorphic functional quasi-order relations
- scientific article; zbMATH DE number 3885965 (Why is no real title available?)
- scientific article; zbMATH DE number 4049637 (Why is no real title available?)
- scientific article; zbMATH DE number 1420847 (Why is no real title available?)
- scientific article; zbMATH DE number 7450013 (Why is no real title available?)
This page was built for publication: The quasi order of graphs on an ordinal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275378)