Infinite Turán problems for bipartite graphs

Abstract: We consider an infinite version of the bipartite Tur'{a}n problem. Let

G

be an infinite graph with

V (G) = m a t h b b N

and let

G_{n}

be the

n

-vertex subgraph of

G

induced by the vertices

1, 2, d o t s, n

. We show that if

G

is

K_{2, t + 1}

-free then for infinitely many

n

,

e (G_{n}) l e q 0.471 s q r t t n^{3 / 2}

. Using the

K_{2, t + 1}

-free graphs constructed by F"{u}redi, we construct an infinite

K_{2, t + 1}

-free graph with

e (G_{n}) g e q 0.23 s q r t t n^{3 / 2}

for all

n g e q n_{0}

.

Recommendations

Cited In (9)

This page was built for publication: Infinite Turán problems for bipartite graphs