TurproblemsExpansionsofgraphs.pdf (170.05 kB)

Turán problems and shadows III: Expansions of graphs

Download (170.05 kB)
journal contribution
posted on 12.09.2016 by A. Kostochka, D. Mubayi, J. Verstraëte
The expansion G+ of a graph G is the 3-uniform hypergraph obtained from G by enlarging each edge of G with a new vertex disjoint from V (G) such that distinct edges are enlarged by distinct vertices. Let ex3(n, F) denote the maximum number of edges in a 3-uniform hypergraph with n vertices not containing any copy of a 3-uniform hypergraph F. The study of ex3(n,G+) includes some well-researched problems, including the case that F consists of k disjoint edges, G is a triangle, G is a path or cycle, and G is a tree. In this paper we initiate a broader study of the behavior of ex3(n,G+). Specifically, we show ex3(n,K+ s,t) = Φ(n3-3/s) whenever t > (s-1)! and s ≥ 3. One of the main open problems is to determine for which graphs G the quantity ex3(n,G+) is quadratic in n. We show that this occurs when G is any bipartite graph with Turán number o(nΦ) where Φ = 1+ √5 2 , and in particular this shows ex3(n,G+) = O(n2) when G is the three-dimensional cube graph.

History

Publisher Statement

This is a copy of an article published in the Siam Journal on Discrete Mathematics. © 2015 Society for Industrial and Applied Mathematics. Copyright © by SIAM.

Publisher

Society for Industrial and Applied Mathematics

Language

en_US

issn

0895-4801

Issue date

01/01/2015

Exports

Categories

Exports