Let $n$, $r$, $k_1,\ldots,k_r$ and $t$ be positive integers with $r\geq 2$, and $\mathcal{F}_i\ (1\leq i\leq r)$ a family of $k_i$-subsets of an $n$-set $V$. The families $\mathcal{F}_1,\ \mathcal{F}_2,\ldots,\mathcal{F}_r$ are said to be $r$-cross $t$-intersecting if $|F_1\cap F_2\cap\cdots\cap F_r|\geq t$ for all $F_i\in\mathcal{F}_i\ (1\leq i\leq r),$ and said to be non-trivial if $|\cap_{1\leq i\leq r}\cap_{F\in\mathcal{F}_i}F|<t$. If the $r$-cross $t$-intersecting families $\mathcal{F}_1,\ldots,\mathcal{F}_r$ satisfy $\mathcal{F}_1=\cdots=\mathcal{F}_r=\mathcal{F}$, then $\mathcal{F}$ is well known as $r$-wise $t$-intersecting family. In this paper, we describe the structure of non-trivial $r$-wise $t$-intersecting families with maximu...
Given a sequence of positive integers $$p=(p_1,\dots ,p_n)$$ p = ( p 1 , ⋯ , p n ) , let $$S_p$$ S p...
Suppose 0, ⩽ r < m, and ℱ is a family of k-subsets of an n-set such that the intersection of any two...
A classical topic in combinatorics is the study of problems of the following type: What are the maxi...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets o...
AbstractWe prove some results involving cross L-intersections of two families of subsets of [n]={1,2...
AbstractLet n⩾t⩾1 be integers. Let F, G be families of subsets of the n-element set X. They are call...
A family A of sets is said to be intersecting if any two sets in A intersect. Families A1,...,Ap are...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
AbstractIntersection problems occupy an important place in the theory of finite sets. One of the cen...
A family \(\mathcal{F}\) of subsets of \(\{1,\dots,n\}\) is called \(k\)-wise intersecting if any \(...
AbstractLet X1, X2, …, Xm be finite sets. The present paper is concerned with the m2 − m intersectio...
A family A of sets is said to be t-intersecting if any two sets in A contain at least t common eleme...
Abstract. A family A of ‘-element subsets and a family B of k-element subsets of an n-element set ar...
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\c...
Given a sequence of positive integers $$p=(p_1,\dots ,p_n)$$ p = ( p 1 , ⋯ , p n ) , let $$S_p$$ S p...
Suppose 0, ⩽ r < m, and ℱ is a family of k-subsets of an n-set such that the intersection of any two...
A classical topic in combinatorics is the study of problems of the following type: What are the maxi...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
Let $n > k > 1$ be integers, $[n] = \{1, \ldots, n\}$. Let $\mathcal F$ be a family of $k$-subsets o...
AbstractWe prove some results involving cross L-intersections of two families of subsets of [n]={1,2...
AbstractLet n⩾t⩾1 be integers. Let F, G be families of subsets of the n-element set X. They are call...
A family A of sets is said to be intersecting if any two sets in A intersect. Families A1,...,Ap are...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
AbstractIntersection problems occupy an important place in the theory of finite sets. One of the cen...
A family \(\mathcal{F}\) of subsets of \(\{1,\dots,n\}\) is called \(k\)-wise intersecting if any \(...
AbstractLet X1, X2, …, Xm be finite sets. The present paper is concerned with the m2 − m intersectio...
A family A of sets is said to be t-intersecting if any two sets in A contain at least t common eleme...
Abstract. A family A of ‘-element subsets and a family B of k-element subsets of an n-element set ar...
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\c...
Given a sequence of positive integers $$p=(p_1,\dots ,p_n)$$ p = ( p 1 , ⋯ , p n ) , let $$S_p$$ S p...
Suppose 0, ⩽ r < m, and ℱ is a family of k-subsets of an n-set such that the intersection of any two...
A classical topic in combinatorics is the study of problems of the following type: What are the maxi...