Subrecursive Complexity of Identifying the Ramsey Structure of Posets
From MaRDI portal
Recommendations
Cites work
- Chain partitions of ordered sets
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- scientific article; zbMATH DE number 3902698 (Why is no real title available?)
- scientific article; zbMATH DE number 16107 (Why is no real title available?)
- scientific article; zbMATH DE number 43004 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 863494 (Why is no real title available?)
- Models Without Indiscernibles
- Partitions of finite relational and set systems
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Ramsey classes of set systems
- Ramsey degrees of bipartite graphs: a primitive recursive proof
- Ramsey's Theorem for n-Parameter Sets
- Regularity and Positional Games
- Symmetry and the Ramsey degree of posets
- Symmetry and the Ramsey degrees of finite relational structures
- The partite construction and Ramsey set systems
This page was built for publication: Subrecursive Complexity of Identifying the Ramsey Structure of Posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507434)