The partite construction and Ramsey set systems
From MaRDI portal
Publication:1119640
DOI10.1016/0012-365X(89)90097-6zbMath0671.05006OpenAlexW2062861878MaRDI QIDQ1119640
Vojtěch Rödl, Jaroslav Nešetřil
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90097-6
Related Items
Ramsey degrees, labeled and unlabeled partitions ⋮ Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ Unnamed Item ⋮ Distance Preserving Ramsey Graphs ⋮ On big Ramsey degrees for binary free amalgamation classes ⋮ On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ A Ramsey class for Steiner systems ⋮ Bowtie-free graphs have a Ramsey lift ⋮ The 42 reducts of the random ordered graph ⋮ New Ramsey classes from old ⋮ Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs ⋮ Categorical view of the partite lemma in structural Ramsey theory ⋮ Subrecursive Complexity of Identifying the Ramsey Structure of Posets ⋮ Ramsey properties of families of graphs ⋮ Abstract approach to finite Ramsey theory and a self-dual Ramsey theorem ⋮ Canonizing structural Ramsey theorems ⋮ Ramsey transfer to semi-retractions ⋮ Direct Ramsey theorem for structures involving relations and functions ⋮ On dual Ramsey theorems for relational structures ⋮ Ramsey degrees of boron tree structures ⋮ On positive local combinatorial dividing-lines in model theory ⋮ Ramsey precompact expansions of homogeneous directed graphs ⋮ A new proof of the Nešetřil-Rödl theorem ⋮ Pre-adjunctions and the Ramsey property ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ Minimal functions on the random graph ⋮ Ramsey degrees of bipartite graphs: a primitive recursive proof ⋮ Ramsey partial orders from acyclic graphs ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse Ramsey graphs
- Ramsey classes of set systems
- Induced partition properties of combinatorial cubes
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
- Partitions of finite relational and set systems
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Studien zur Kombinatorik
- Ramsey's theorem for a class of categories
- Strong Ramsey Theorems for Steiner Systems
- Regularity and Positional Games
- A structural generalization of the Ramsey theorem
- Models Without Indiscernibles
- On chromatic number of graphs and set-systems
- On chromatic number of finite set-systems
