Asymptotically approaching the Moore bound for diameter three by Cayley graphs

DOI10.1016/J.JCTB.2018.06.003zbMATH Open1402.05097arXiv1709.09760OpenAlexW2964262218MaRDI QIDQ1633751FDOQ1633751

Jozef Širáň, Jana Šiagiová, Martin Bachratý

Publication date: 20 December 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k-O(d^{k-1})$ for $doinfty$ and any fixed $k$. Known results in finite geometries on generalised $(k+1)$-gons imply, for $k=2,3,5$, the existence of an infinite sequence of values of $d$ such that $n(d,k)=d^k-o(d^k)$. This shows that for $k=2,3,5$ the Moore bound can be asymptotically approached in the sense that $n(d,k)/M(d,k)o1$ as $doinfty$; moreover, no such result is known for any other value of $kge2$. The corresponding graphs are, however, far from vertex-transitive, and there appears to be no obvious way to extend them to vertex-transitive graphs giving the same type of asymptotic result. The second and the third author (2012) proved by a direct construction that the Moore bound for diameter $k=2$ can be asymptotically approached by Cayley graphs. Subsequently, the first and the third author (2015) showed that the same construction can be derived from generalised triangles with polarity. By a detailed analysis of regular orbits of suitable groups of automorphisms of graphs arising from polarity quotients of incidence graphs of generalised quadrangles with polarity, we prove that for an infinite set of values of $d$ there exist Cayley graphs of degree $d$, diameter $3$, and order $d^3-O(d^{2.5})$. The Moore bound for diameter $3$ can thus as well be asymptotically approached by Cayley graphs. We also show that this method does not extend to constructing Cayley graphs of diameter $5$ from generalised hexagons with polarity.

Full work available at URL: https://arxiv.org/abs/1709.09760

zbMATH Keywords

Cayley graphdiameterdegreegeneralised quadrangleSuzuki-Tits oval

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
• Title not available (Why is that?)
• Structure of Ree groups
• Finite generalized quadrangles
• Ovoides et groupes de Suzuki
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• On a Class of Fixed-Point-Free Graphs
• On Moore Graphs with Diameters 2 and 3
• Approaching the Moore bound for diameter two by Cayley graphs
• Title not available (Why is that?)
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• Title not available (Why is that?)
• Examples of products giving large graphs with given degree and diameter
• Title not available (Why is that?)
• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• Cycle prefix digraphs for symmetric interconnection networks
• Cayley graphs of given degree and diameters 3, 4 and 5
• Title not available (Why is that?)
• Polarity graphs revisited
• Diameter 2 Cayley graphs of dihedral groups

Cited In (1)

• On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres

This page was built for publication: Asymptotically approaching the Moore bound for diameter three by Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633751)