arXiv Analytics

Sign in

arXiv:2103.12255 [math.CO]AbstractReferencesReviewsResources

On the number of $k$-gons in finite projective planes

Vladislav Taranchuk

Published 2021-03-23Version 1

Let $\Pi$ be a projective plane of order $n$ and $\Gamma_{\Pi}$ be its Levi graph (the point-line incidence graph). For fixed $k \geq 3$, let $c_{2k}(\Gamma_{\Pi})$ denote the number of $2k$-cycles in $\Gamma_{\Pi}$. In this paper we show that $$c_{2k}(\Gamma_{\Pi}) = \frac{1}{2k}n^{2k} + O(n^{2k-2}), \hspace{0.5cm} n \rightarrow \infty. $$ We also state a conjecture regarding the third and fourth largest terms in the asymptotic of the number of $2k$-cycles in $\Gamma_{\Pi}$. Let $\text{ex}(v, C_{2k}, \mathcal{C}_{\text{odd}}\cup \{C_4\})$ denote the greatest number of $2k$-cycles amongst all bipartite graphs of order $v$ and girth at least 6. As a corollary of the result above, we obtain $$ \text{ex}(v, C_{2k}, \mathcal{C}_{\text{odd}}\cup \{C_4\}) = \left(\frac{1}{2^{k+1}k}-o(1)\right)v^k, \hspace{0.5cm} v \rightarrow \infty.$$

Related articles: Most relevant | Search more
arXiv:2110.12314 [math.CO] (Published 2021-10-23, updated 2022-03-24)
Simplicial complexes from finite projective planes and colored configurations
arXiv:2409.14213 [math.CO] (Published 2024-09-21)
Avoiding secants of given size in finite projective planes
arXiv:0908.4038 [math.CO] (Published 2009-08-27)
Non-representability of finite projective planes by convex sets