Araujo-Pardo–Leemans family conjecture for edge-girth-regular graphs
Araujo-Pardo–Leemans family conjecture for edge-girth-regular graphs
Let denote an edge-girth-regular graph with vertices, valency , girth , and each edge contained in exactly cycles of length . Let be a prime power and let . Araujo-Pardo–Leemans conjecture. There exists a family of
graphs, and these graphs are extremal edge-girth-regular graphs, meaning that they attain the minimum possible order for their parameters. The conjecture proposes infinite families in the cases and . The paper states that its computations disprove the conjecture for cubic graphs of girths and , so the conjecture is refuted as stated.
Sources & referencesView supporting material
Primary source
Jan Goedgebeur and Jorik Jooken, “Exhaustive generation of edge-girth-regular graphs”, arXiv:2401.08271 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.