A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős-Ko-Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corresponding results.
Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting the Budak-Işik-Pym...
We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = 1, 2, …, n alternately, one at each turn, so that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed k-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone...
In a recent paper, we presented a new definition of influences in product spaces of continuous distributions, and showed that analogues of the most fundamental results on discrete influences, such as the KKL theorem, hold for the new definition in Gaussian space. In this paper we prove Gaussian analogues of two of the central applications of influences: Talagrand’s lower bound on the correlation of increasing subsets of the discrete cube, and the Benjamini–Kalai–Schramm (BKS) noise sensitivity theorem....
We introduce higher order spreading models associated to a Banach space X. Their definition is based on ℱ-sequences with ℱ a regular thin family and on plegma families. We show that the higher order spreading models of a Banach space X form an increasing transfinite hierarchy . Each contains all spreading models generated by ℱ-sequences with order of ℱ equal to ξ. We also study the fundamental properties of this hierarchy.
We consider various forms of Ramsey's theorem, the monotone subsequence theorem and the Bolzano-Weierstrass theorem which are connected with ideals of subsets of natural numbers. We characterize ideals with properties considered. We show that, in a sense, Ramsey's theorem, the monotone subsequence theorem and the Bolzano-Weierstrass theorem characterize the same class of ideals. We use our results to show some versions of density Ramsey's theorem (these are similar to generalizations shown in [P....