Ramsey theory for countable binary homogeneous structures
DOI10.1305/NDJFL/1125409332zbMATH Open1095.03035OpenAlexW1984489138MaRDI QIDQ816294FDOQ816294
Authors: Jean A. Larson 
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
Recommendations
- Ramsey Classes and Homogeneous Structures
- Ramsey theory for discrete structures
- Topological Ramsey numbers and countable ordinals
- scientific article; zbMATH DE number 7527
- Algorithmic randomness and Ramsey properties of countable homogeneous structures
- A topological Ramsey classification of countable ordinals
- Some Ramsey-type theorems for countably determined sets
- A dichotomy result for Ramsey quantifiers
- Ramsey theory for structures: Nešetřil's result on finite metric spaces
- scientific article; zbMATH DE number 512985
Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Partition relations (03E02) Ramsey theory (05D10) Model theory of denumerable and separable structures (03C15)
Cites Work
- Title not available (Why is that?)
- Enumerative combinatorics. Volume 2.
- A new strongly minimal set
- Universal graphs and universal functions
- Asymmetric graphs
- A Combinatorial Theorem
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Universal graphs at the successor of a singular cardinal
- Independence results
- Countable Ultrahomogeneous Undirected Graphs
- A family of countable homogeneous graphs
- Title not available (Why is that?)
- Countable homogeneous partially ordered sets
- A Ramsey theorem for trees
- Forbidden subgraphs and forbidden substructures
- On random relational structures
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Countable Homogeneous Tournaments
- Nonexistence of universal orders in many cardinals
- Canonical Vertex Partitions
- Random Permutations: Some Group-Theoretic Aspects
- On countable stable structures which are homogeneous for a finite relational language
- \(\aleph_0\)-categorical structures with a predimension
- Constructing \(\omega\)-stable structures: Model completeness.
- Two cardinal compactness
- Title not available (Why is that?)
- A proof of a partition theorem for [ℚ]ⁿ
- Tournaments and Orders with the Pigeonhole Property
- Identities on cardinals less than ℵω
- Infinite partitions of random graphs
- Coloring subgraphs of the Rado graph
- Counting canonical partitions in the random graph
Cited In (9)
- Partitions of large Rado graphs
- CORES OVER RAMSEY STRUCTURES
- Ramsey degrees of boron tree structures
- Canonical partitions of universal structures
- An application of ramsey’s theorem to groups with homogeneous theory
- Borel separability of the coanalytic Ramsey sets
- Canonical Vertex Partitions
- Ramsey theory of homogeneous structures: current trends and open problems
- A Ramsey theorem for countable homogeneous directed graphs
This page was built for publication: Ramsey theory for countable binary homogeneous structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816294)
