Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field
Subhankar Dash, Kaushik Majumder
Abstract
Let (2,q) denote the projective plane over the finite field Fq where q≥2 is a prime power. For a positive integer t, let Bt[(2,q)] denote the t-page book obtained from t-many copies of the (q+1)-graph (2,q), sharing a common edge. Employing the Lp-method and using the incidence structure of the projective plane, we establish that the upper bound of Turán density of Bt[(2,q)] is (q(q+1)-1)1qt. For the (q+1)-graph (2,q), the previously known upper bound on its Turán density was 1-q2q-1. As a consequence of our estimate, this upper bound is improved to (q(q+1)-1)1q.
Create a lesson
Related papers
Generic solutions to symmetric linear equations
Bryce Frederickson, Liana Yepremyan
On Colorful Kruskal--Katona Theorems
Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu
An optimal constant for vector balancing with permutations
Jonathan Niles-Weed, Shay Sadovsky, Jacob Shkrob
Typical intersecting families at n=2k+1 and n=2k+2
Lina Li
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
Linear circumference in vertex-transitive graphs
Jie Ma, Ziyuan Zhao