### Abstract

One of the central problems of extremal hypergraph theory is the description of unavoidable subhypergraphs, in other words, the Turan problem. Let a = (a_{1}, ..., a_{p}) be a sequence of positive integers, p ≥ 2, k = a_{1} + ... + a_{p}. An a-cluster is a family of k-sets {F_{0}, ..., F_{p}} such that the sets F_{i} \ F_{0} are pairwise disjoint (1 ≤ i ≤ p), | F_{i} \ F_{0} | = a_{i}, and the sets F_{0} \ F_{i} are pairwise disjoint, too. Given a there is a unique a-cluster, and the sets F_{0} \ F_{i} form an a-partition of F_{0}. With an intensive use of the delta-system method we prove that for k > p > 1 and sufficiently large n, (n > n_{0} (k)), if F is an n-vertex k-uniform family with | F | exceeding the Erdo{combining double acute accent}s-Ko-Rado bound ((n - 1; k - 1)), then F contains an a-cluster. The only extremal family consists of all the k-subsets containing a given element.

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

Pages (from-to) | 63-67 |

Number of pages | 5 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 34 |

DOIs | |

Publication status | Published - Aug 1 2009 |

### Keywords

- Erdo{combining double acute accent}s-Ko-Rado
- set systems
- traces

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Unavoidable subhypergraphs: a-clusters'. Together they form a unique fingerprint.

## Cite this

*Electronic Notes in Discrete Mathematics*,

*34*, 63-67. https://doi.org/10.1016/j.endm.2009.07.011