Bibliographic Details
| Title: |
Forbidding Complete Hypergraphs as Traces. |
| Authors: |
Mubayi, Dhruv1 mubayi@math.uic.edu, Yi Zhao2 yizhao@mathstat.gsu.edu |
| Source: |
Graphs & Combinatorics. Dec2007, Vol. 23 Issue 6, p667-679. 13p. |
| Subjects: |
Hypergraphs, Fuzzy hypergraphs, Matrices (Mathematics), Combinatorics, Graphic methods, Graph theory |
| Abstract: |
Let 2 ≤ q ≤min{ p, t − 1} be fixed and n → ∞. Suppose that $$\mathcal{F}$$ is a p-uniform hypergraph on n vertices that contains no complete q-uniform hypergraph on t vertices as a trace. We determine the asymptotic maximum size of $${\mathcal{F}}$$ in many cases. For example, when q = 2 and p∈{ t, t + 1}, the maximum is $$( \frac{n}{t-1})^{t-1} + o(n^{t-1})$$ , and when p = t = 3, it is $$\lfloor \frac{(n-1)^2}{4}\rfloor$$ for all n≥ 3. Our proofs use the Kruskal-Katona theorem, an extension of the sunflower lemma due to Füredi, and recent results on hypergraph Turán numbers. [ABSTRACT FROM AUTHOR] |
|
Copyright of Graphs & Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
