Cycles, wheels, and gears in finite planes

Authors

  • Jamie Peabody
  • Oscar Vega California State University, Fresno
  • Jordan White

DOI:

https://doi.org/10.11575/cdm.v8i2.62202

Keywords:

Graph embeddings, finite projective plane, primitive element

Abstract

The existence of a primitive element of $GF(q)$ with certain properties is used to prove that all cycles that could theoretically be embedded in $AG(2,q)$ and $PG(2,q)$ can, in fact, be embedded there (i.e. these planes are `pancyclic'). We also study embeddings of wheel and gear graphs in arbitrary projective planes.

Author Biography

Oscar Vega, California State University, Fresno

Assistant Professor

Department of Mathematics

References

S. Cohen. Primitive elements and polynomials: existence results. Finite fields, coding theory, and advances in communications and computing (Las Vegas, NV, 1991), 43--55, Lecture Notes in Pure and Appl. Math., 141, Dekker, New York, 1993.

P. Dembowski. Finite Geometries. Springer Verlag. 1997.

P. Erd\H os, Some old and new problems in various branches of combinatorics, Proceedings of the Tenth Southeastern Conference in Combinatorics, Graph Theory, and Computing, Florida Atlantic Univ., Boca Raton, Fla. (1979) 19--37.

M. Hall, Projective planes. Trans. Amer. Math. Soc. 54 (1943), 229--277.

F. Lazebnik, K. E. Mellinger, and O. Vega. On the number of k-gons in finite projective planes. Note Mat., vol 29 suppl. 1 (2009) 135-152.

F. Lazebnik, K. Mellinger, and O. Vega. Embedding Cycles in Finite Planes. Preprint.

G.E. Moorhouse, J. Williford. Embedding Partial Linear Spaces in Finite Translation Nets, Journal of Geometry 91 no.1-2 (2009), 73--83.

E. Schmeichel. On the cycle structure of finite projective planes. Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), Ann. New York Acad. Sci., 555, New York Acad. Sci., New York, (1989) 368--374,.

J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc., 43 (1938), 377--385.

A. Voropaev. Derivation of formuli for the number of k-gons in finite projective planes for $k\leq 10$. Preprint. (2012), 1--12. (In Russian.)

D. West. Introduction to Graph Theory, Second Edition. Prentice Hall, 2001.

Downloads

Published

2013-12-29

Issue

Vol. 8 No. 2 (2013)

Section

Articles

License

 

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from  Volume 15 number 3.   When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM)  a world-wide, irrevocable, royalty free,  non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. 

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license.   Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM,  the work will appear with the CC-BY-ND logo.  Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND.  https://creativecommons.org/licenses/

Attribution-NoDerivs
CC BY-ND

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.