Unavoidable subhypergraphs

a-clusters

Z. Füredi, Lale Özkahya

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

One of the central problems of extremal hypergraph theory is the description of unavoidable subhypergraphs, in other words, the Turan problem. Let a = (a1, ..., ap) be a sequence of positive integers, p ≥ 2, k = a1 + ... + ap. An a-cluster is a family of k-sets {F0, ..., Fp} such that the sets Fi \ F0 are pairwise disjoint (1 ≤ i ≤ p), | Fi \ F0 | = ai, and the sets F0 \ Fi are pairwise disjoint, too. Given a there is a unique a-cluster, and the sets F0 \ Fi form an a-partition of F0. With an intensive use of the delta-system method we prove that for k > p > 1 and sufficiently large n, (n > n0 (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 languageEnglish
Pages (from-to)63-67
Number of pages5
JournalElectronic Notes in Discrete Mathematics
Volume34
DOIs
Publication statusPublished - Aug 1 2009

Fingerprint

Pairwise
Disjoint
Hypergraph
Acute
Partition
Integer
Subset
Vertex of a graph
Family
Form

Keywords

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

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Unavoidable subhypergraphs : a-clusters. / Füredi, Z.; Özkahya, Lale.

In: Electronic Notes in Discrete Mathematics, Vol. 34, 01.08.2009, p. 63-67.

Research output: Contribution to journalArticle

@article{b01ac84a57db44e496c89602be85d083,
title = "Unavoidable subhypergraphs: a-clusters",
abstract = "One of the central problems of extremal hypergraph theory is the description of unavoidable subhypergraphs, in other words, the Turan problem. Let a = (a1, ..., ap) be a sequence of positive integers, p ≥ 2, k = a1 + ... + ap. An a-cluster is a family of k-sets {F0, ..., Fp} such that the sets Fi \ F0 are pairwise disjoint (1 ≤ i ≤ p), | Fi \ F0 | = ai, and the sets F0 \ Fi are pairwise disjoint, too. Given a there is a unique a-cluster, and the sets F0 \ Fi form an a-partition of F0. With an intensive use of the delta-system method we prove that for k > p > 1 and sufficiently large n, (n > n0 (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.",
keywords = "Erdo{combining double acute accent}s-Ko-Rado, set systems, traces",
author = "Z. F{\"u}redi and Lale {\"O}zkahya",
year = "2009",
month = "8",
day = "1",
doi = "10.1016/j.endm.2009.07.011",
language = "English",
volume = "34",
pages = "63--67",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

TY - JOUR

T1 - Unavoidable subhypergraphs

T2 - a-clusters

AU - Füredi, Z.

AU - Özkahya, Lale

PY - 2009/8/1

Y1 - 2009/8/1

N2 - One of the central problems of extremal hypergraph theory is the description of unavoidable subhypergraphs, in other words, the Turan problem. Let a = (a1, ..., ap) be a sequence of positive integers, p ≥ 2, k = a1 + ... + ap. An a-cluster is a family of k-sets {F0, ..., Fp} such that the sets Fi \ F0 are pairwise disjoint (1 ≤ i ≤ p), | Fi \ F0 | = ai, and the sets F0 \ Fi are pairwise disjoint, too. Given a there is a unique a-cluster, and the sets F0 \ Fi form an a-partition of F0. With an intensive use of the delta-system method we prove that for k > p > 1 and sufficiently large n, (n > n0 (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.

AB - One of the central problems of extremal hypergraph theory is the description of unavoidable subhypergraphs, in other words, the Turan problem. Let a = (a1, ..., ap) be a sequence of positive integers, p ≥ 2, k = a1 + ... + ap. An a-cluster is a family of k-sets {F0, ..., Fp} such that the sets Fi \ F0 are pairwise disjoint (1 ≤ i ≤ p), | Fi \ F0 | = ai, and the sets F0 \ Fi are pairwise disjoint, too. Given a there is a unique a-cluster, and the sets F0 \ Fi form an a-partition of F0. With an intensive use of the delta-system method we prove that for k > p > 1 and sufficiently large n, (n > n0 (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.

KW - Erdo{combining double acute accent}s-Ko-Rado

KW - set systems

KW - traces

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

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

U2 - 10.1016/j.endm.2009.07.011

DO - 10.1016/j.endm.2009.07.011

M3 - Article

VL - 34

SP - 63

EP - 67

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -