New examples of graphs without small cycles and of large size

46Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For any prime power q ≥ 3, we consider two infinite series of bipartite q-regular edge-transitive graphs of orders 2q3 and 2q5 which are induced subgraphs of regular generalized 4-gons and 6-gons, respectively. We compare these two series with two families of graphs, H3(p) and H5 (p), p is a prime, constructed recently by Wenger ([26]), which are new examples of extremal graphs without 6- and 10-cycles respectively. We prove that the first series contains the family h3 (p) for q = p ≥ 3. Then we show that no member of the second family H5(p) is a subgraph of a generalized 6-gon. Then, for infinitely many values of q, we construct a new series of bipartite q-regular edge-transitive graphs of order 2q5 and girth 10. Finally, for any prime power q ≥ 3, we cosntruct a new infinite series of bipartite q-regular edge-transitive graphs of order 2q9 and girth g ≥ 14. Our construction were motivated by some results on embeddings of Chevalley group geometries in the corresponding Lie algebras and a construction of a blow-up for an incident system and a graph. © 1993 Academic Press, Inc.

Cite

CITATION STYLE

APA

Lazebnik, F., & Ustimenko, V. A. (1993). New examples of graphs without small cycles and of large size. European Journal of Combinatorics, 14(5), 445–460. https://doi.org/10.1006/eujc.1993.1048

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free