### Abstract

Let n≥k≥1 be integers and let f(n, k) be the smallest integer for which the following holds: If ℱ is a family of subsets of an n-set X with |ℱ| k and d_{ k} such that {Mathematical expression} and {Mathematical expression} as k→∞. The proofs of both the lower and the upper bounds use probabilistic methods.

Original language | English |
---|---|

Pages (from-to) | 51-56 |

Number of pages | 6 |

Journal | Graphs and Combinatorics |

Volume | 1 |

Issue number | 1 |

DOIs | |

Publication status | Published - Dec 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Mathematics(all)
- Theoretical Computer Science

### Cite this

*Graphs and Combinatorics*,

*1*(1), 51-56. https://doi.org/10.1007/BF02582928

**A Ramsey-Sperner theorem.** / Füredi, Z.

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 1, no. 1, pp. 51-56. https://doi.org/10.1007/BF02582928

}

TY - JOUR

T1 - A Ramsey-Sperner theorem

AU - Füredi, Z.

PY - 1985/12

Y1 - 1985/12

N2 - Let n≥k≥1 be integers and let f(n, k) be the smallest integer for which the following holds: If ℱ is a family of subsets of an n-set X with |ℱ| k and d k such that {Mathematical expression} and {Mathematical expression} as k→∞. The proofs of both the lower and the upper bounds use probabilistic methods.

AB - Let n≥k≥1 be integers and let f(n, k) be the smallest integer for which the following holds: If ℱ is a family of subsets of an n-set X with |ℱ| k and d k such that {Mathematical expression} and {Mathematical expression} as k→∞. The proofs of both the lower and the upper bounds use probabilistic methods.

UR - http://www.scopus.com/inward/record.url?scp=51249172893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249172893&partnerID=8YFLogxK

U2 - 10.1007/BF02582928

DO - 10.1007/BF02582928

M3 - Article

AN - SCOPUS:51249172893

VL - 1

SP - 51

EP - 56

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -