Skip to main content
MathOverflow

Return to Question

Added relevant tags. Made stylistic improvements.
Source Link
Peter Heinig
Peter Heinig
  • 6.1k
  • 1
  • 27
  • 47

I just wanted to know, isIs there any result knowknown about the following generalization of the Erdős-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k$k$-subsetselement subsets of the set $\{1,\ldots, n\}$, an $(r, s)$-intersection family$(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them hashave an $s$- elements in theirelement intersection. What is the maximum size of such a family?

I just wanted to know, is there any result know about the following generalization of Erdős-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k-subsets of the set $\{1,\ldots, n\}$, $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them has $s$- elements in their intersection. What is the maximum size of such a family?

Is there any result known about the following generalization of the Erdős-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of $k$-element subsets of $\{1,\ldots, n\}$, an $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two have an $s$-element intersection. What is the maximum size of such a family?

Fixed because it was on the front page
Source Link
David White
David White
  • 30.3k
  • 9
  • 154
  • 250

A generalization of ErdosErdős-Ko_RadoKo-Rado theorem

I just wanted to know, is there any result know about the following generalization of ErdosErdős-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k-subsets of the set $\{1,\ldots, n\}$, $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them has $s$- elements in their intersection. What is the maximum size of such a family?

A generalization of Erdos-Ko_Rado theorem

I just wanted to know, is there any result know about the following generalization of Erdos-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k-subsets of the set $\{1,\ldots, n\}$, $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them has $s$- elements in their intersection. What is the maximum size of such a family?

A generalization of Erdős-Ko-Rado theorem

I just wanted to know, is there any result know about the following generalization of Erdős-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k-subsets of the set $\{1,\ldots, n\}$, $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them has $s$- elements in their intersection. What is the maximum size of such a family?

Source Link
123...
123...
  • 683
  • 5
  • 9

A generalization of Erdos-Ko_Rado theorem

I just wanted to know, is there any result know about the following generalization of Erdos-Ko-Rado theorem?

Let $n, k, r, s$ be positive integers. We call a family $\mathcal{F}$ of k-subsets of the set $\{1,\ldots, n\}$, $(r, s)$-intersection family if among every $r$ elements of $\mathcal{F}$ at least two of them has $s$- elements in their intersection. What is the maximum size of such a family?