Given r families of subsets of a fixed n-set, we say that they are r-cross t-intersecting if for every choice of representatives, exactly one from each family, the common intersection of these representatives is of size at least t. We obtain a generalisation of a result by Hilton and Milner on cross intersecting families. In particular, we determine the maximum possible sum of the sizes of non-empty r-cross t-intersecting families in the case when all families are k-uniform and in the case when they are arbitrary subfamilies of the power set. Only some special cases of these results had been proved before. The method we use also yields more general results concerning measures of families instead of their sizes.

Maker-Breaker games are played on a hypergraph $(X,\mathcal{F})$, where $\mathcal{F} \subseteq 2^X$ denotes the family of winning sets. Both players alternately claim a predefined amount of edges (called bias) from the board $X$, and Maker wins the game if she is able to occupy any winning set $F \in \mathcal{F}$. These games are well studied when played on the complete graph $K_n$ or on a random graph $G_{n,p}$. In this paper we consider Maker-Breaker games played on randomly perturbed graphs instead. These graphs consist of the union of a deterministic graph $G_\alpha$ with minimum degree at least $\alpha n$ and a binomial random graph $G_{n,p}$. Depending on $\alpha$ and Breaker's bias $b$ we determine the order of the threshold probability for winning the Hamiltonicity game and the $k$-connectivity game on $G_{\alpha}\cup G_{n,p}$, and we discuss the $H$-game when $b=1$.