Relative Turán problems for uniform hypergraphs

Abstract: For two graphs

F

and

H

, the relative Tur'{a}n number

m a t h r m e x (H, F)

is the maximum number of edges in an

F

-free subgraph of

H

. Foucaud, Krivelevich, and Perarnau cite{FKP} and Perarnau and Reed cite{PR} studied these quantities as a function of the maximum degree of

H

. In this paper, we study a generalization for uniform hypergraphs. If

F

is a complete

r

-partite

r

-uniform hypergraph with parts of sizes

s_{1}, s_{2}, d o t s, s_{r}

with each

s_{i + 1}

sufficiently large relative to

s_{i}

, then with

we prove that for any

r

-uniform hypergraph

H

with maximum degree

D e l t a

, [mathrm{ex}(H,F)ge Delta^{-�eta - o(1)} cdot e(H).] This is tight as

D e l t a i g h t a r r o w i n f t y

up to the

o (1)

term in the exponent, since we show there exists a

D e l t a

-regular

r

-graph

H

such that

. Similar tight results are obtained when

H

is the random

n

-vertex

r

-graph

H_{n, p}^{r}

with edge-probability

p

, extending results of Balogh and Samotij cite{BS} and Morris and Saxton cite{MS}.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Relative Turán problems for uniform hypergraphs