On the number of k-gons in finite projective planes

Abstract

Let be a projective plane of order n and be its Levi graph (the point-line incidence graph). For fixed k ≥ 3, let c2k() denote the number of 2k-cycles in . In this paper we show that c2k() = 12kn2k + O(n2k-2), 0.5cm n → ∞. We also state a conjecture regarding the third and fourth largest terms in the asymptotic of the number of 2k-cycles in . This result was also obtained independently by Voropaev in 2012. Let ex(v, C2k, Codd \C4\) 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 ex(v, C2k, Codd \C4\) = (12k+1k-o(1))vk, 0.5cm v → ∞.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…