arXiv (All)
open access
Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field
Let $\PG(2,q)$ denote the projective plane over the finite field $\mathbb{F}_q$ where $q\geq2$ is a prime power. For a positive integer $t$, let $B_{t}[\PG(2,q)]$ denote the $t$-page book obtained from $t-$many copies of the $(q+1)-$graph $\PG(2,q)$, sharing a common edge. Employing the $\mathsf{L}^
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New bounds on the Graham-Pollak theorem for hypergraphs#1084293
- A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound#974019
- Prime hypergraphs#445661
- The maximum area of the convex hull of a polyhex#1104509
- Rainbow Turán numbers for paths of length four#1142774
Record · ID 1156019
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive