A construction for bipatite Turán numbers

preprint2021arXivOpen access

Abstract

We consider in detail the well-known family of graphs G(q,t)G(q,t) that establish an asymptotic lower bound for Turán numbers ex(n,K2,t+1)\mathrm{ex}(n,K_{2,t+1}). We prove that G(q,t)G(q,t) for some specific qq and tt also gives an asymptotic bound for K3,3K_{3,3} and for some higher complete bipartite graphs as well. The asymptotic bounds we prove are the same as provided by the well-known Norm-graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.