Ramsey theory for countable binary homogeneous structures

DOI10.1305/NDJFL/1125409332MaRDI QIDQ816294zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random graphRamsey theoryrelational structurepartition relationRado graphcanonical partition

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3487493 (Why is no real title available?)
• scientific article; zbMATH DE number 1974652 (Why is no real title available?)
• scientific article; zbMATH DE number 1421206 (Why is no real title available?)
• A Combinatorial Theorem
• A Ramsey theorem for trees
• A family of countable homogeneous graphs
• A new strongly minimal set
• A proof of a partition theorem for [ℚ]ⁿ
• Asymmetric graphs
• Canonical Vertex Partitions
• Coloring subgraphs of the Rado graph
• Constructing \(\omega\)-stable structures: Model completeness.
• Countable Homogeneous Tournaments
• Countable Ultrahomogeneous Undirected Graphs
• Countable homogeneous partially ordered sets
• Counting canonical partitions in the random graph
• Enumerative combinatorics. Volume 2.
• Forbidden subgraphs and forbidden substructures
• Identities on cardinals less than ℵ_ω
• Independence results
• Infinite partitions of random graphs
• Nonexistence of universal orders in many cardinals
• On countable stable structures which are homogeneous for a finite relational language
• On random relational structures
• Random Permutations: Some Group-Theoretic Aspects
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Tournaments and Orders with the Pigeonhole Property
• Two cardinal compactness
• Universal graphs and universal functions
• Universal graphs at the successor of a singular cardinal
• \(\aleph_0\)-categorical structures with a predimension

Cited in

(9)

• Canonical partitions of universal structures
• Partitions of large Rado graphs
• Canonical Vertex Partitions
• Borel separability of the coanalytic Ramsey sets
• An application of ramsey’s theorem to groups with homogeneous theory
• CORES OVER RAMSEY STRUCTURES
• Ramsey theory of homogeneous structures: current trends and open problems
• Ramsey degrees of boron tree structures
• 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)