Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Sós, V.T.
Title: Problems and results on intersections of set systems of structural type. (In English)
Source: Util. Math. 29, 61-70 (1986).
Review: For a fixed family J of subsets of a set S of cardinality n, g(n,J) denotes the cardinality of the largest family A of subsets of S whose pairwise intersections are all contained in J; f(n,J) denotes the largest family A whose pairwise intersections all contain an element of J. Problems involving these functions are called, respectively, strong and weak intersection problems.
The authors review intersection problems for subsets of the integers, (ordinary) graphs, and (uniform) hypergraphs. A number of open problems are discussed.
(This useful paper is in the genre popularized by the first author, which has, over the years, enticed many mathematicians into fertile areas of combinatorics and related fields. It is unfortunate that the journal editors did not see fit to have the paper properly proofread. There are numerous typos that could easily have been eliminated. In particular, underscoring that was evidently intended by the authors as printers' instructions has been set in type - erratically - to add to the confusion.)
Classif.: * 05C35 Extremal problems (graph theory)
05A05 Combinatorial choice problems
05C15 Chromatic theory of graphs and maps
05C38 Paths and cycles
00A07 Problem books
Keywords: set system; strong intersection problem; weak intersection problem; arithmetic progressions; C-intersection systems; delta-systems; chromatic number; Turán graph; 5-wheel
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag