Rainbow matchings in -partite -graphs.
This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion.We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem,...
We investigate families of partitions of ω which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these partition-ultrafilters, which we call Ramseyan ultrafilters, are similar to those of Ramsey ultrafilters. For example it will be shown that dual Mathias forcing restricted to a Ramseyan ultrafilter has the same features as Mathias forcing restricted to a Ramsey ultrafilter. Further we...
Let , be metric spaces and an injective mapping. We put ; , , and (the distortion of the mapping ). Some Ramsey-type questions for mappings of finite metric spaces with bounded distortion are studied; e.g., the following theorem is proved: Let be a finite metric space, and let , be given numbers. Then there exists a finite metric space , such that for every mapping ( arbitrary metric space) with one can find a mapping , such that both the mappings and have distortion at...
Suppose that is a Fréchet space, is a regular method of summability and is a bounded sequence in . We prove that there exists a subsequence of such that: either (a) all the subsequences of are summable to a common limit with respect to ; or (b) no subsequence of is summable with respect to . This result generalizes the Erdös-Magidor theorem which refers to summability of bounded sequences in Banach spaces. We also show that two analogous results for some -locally convex spaces...
Let 𝒦 be a class of finite relational structures. We define ℰ𝒦 to be the class of finite relational structures A such that A/E ∈ 𝒦, where E is an equivalence relation defined on the structure A. Adding arbitrary linear orderings to structures from ℰ𝒦, we get the class 𝒪ℰ𝒦. If we add linear orderings to structures from ℰ𝒦 such that each E-equivalence class is an interval then we get the class 𝒞ℰ[𝒦*]. We provide a list of Fraïssé classes among ℰ𝒦, 𝒪ℰ𝒦 and 𝒞ℰ[𝒦*]. In addition, we classify...