Abstract
Let H be an r-uniform hypergraph. The Turán number ex(n,H) is the maximum number of edges in an n-vertex H-free r-uniform hypergraph. The Turán density of H is defined byπ(H)=limn→∞ex(n,H)(nr). In this paper, we consider the Turán density of projective geometries. We give two new constructions of PGm(q)-free hypergraphs which improve some results given by Keevash (2005) [14]. Based on an upper bound of blocking sets of PGm(q), we give a new general lower bound for the Turán density of PGm(q). By a detailed analysis of the structures of complete arcs in PG2(q), we also get better lower bounds for the Turán density of PG2(q) with q=3,4,5.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
