English

Nonexistence of certain edge-girth-regular graphs

Combinatorics 2024-04-01 v1

Abstract

Edge-girth-regular graphs (abbreviated as \emph{egr} graphs) are regular graphs in which every edge is contained in the same number of shortest cycles. We prove that there is no 33-regular \emph{egr} graph with girth 77 such that every edge is on exactly 66 shortest cycles, and there is no 33-regular \emph{egr} graph with girth 88 such that every edge is on exactly 1414 shortest cycles. This was conjectured by Goedgebeur and Jooken. A few other unresolved cases are settled as well.

Keywords

Cite

@article{arxiv.2403.20049,
  title  = {Nonexistence of certain edge-girth-regular graphs},
  author = {Leen Droogendijk},
  journal= {arXiv preprint arXiv:2403.20049},
  year   = {2024}
}

Comments

17 pages, 4 figures

R2 v1 2026-06-28T15:38:07.514Z