Free sets for a set-mapping relative to a family of sets
Abstract
Given a family F of subsets of \1,…,m\, we try to compute the least natural number n such that for every function S:[n]<ω [n]<ω there exists a bijection u:\1,…,m\ Y⊂ n such that Su(A) Y ⊂ u(A) for all A∈F.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.