Ramsey theory for countable binary homogeneous structures
From MaRDI portal
Publication:816294
DOI10.1305/ndjfl/1125409332zbMath1095.03035OpenAlexW1984489138MaRDI QIDQ816294
Publication date: 10 March 2006
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1125409332
Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Ramsey theory (05D10) Partition relations (03E02) Model theory of denumerable and separable structures (03C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new strongly minimal set
- Infinite partitions of random graphs
- Coloring subgraphs of the Rado graph
- Counting canonical partitions in the random graph
- On countable stable structures which are homogeneous for a finite relational language
- Countable homogeneous partially ordered sets
- A Ramsey theorem for trees
- On random relational structures
- Constructing \(\omega\)-stable structures: Model completeness.
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- \(\aleph_0\)-categorical structures with a predimension
- Two cardinal compactness
- Forbidden subgraphs and forbidden substructures
- Universal graphs at the successor of a singular cardinal
- Independence results
- Countable Ultrahomogeneous Undirected Graphs
- Nonexistence of universal orders in many cardinals
- Random Permutations: Some Group-Theoretic Aspects
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- A proof of a partition theorem for [ℚⁿ]
- Canonical Vertex Partitions
- Tournaments and Orders with the Pigeonhole Property
- Countable Homogeneous Tournaments
- Universal graphs and universal functions
- Identities on cardinals less than ℵω
- Asymmetric graphs
- A Combinatorial Theorem
- A family of countable homogeneous graphs
