Nonexistence conjecture for 8-regular K3-irregular graphs
Nonexistence conjecture for 8-regular K3-irregular graphs
Let be an -regular graph. For a vertex of , let its -degree be the number of subgraphs isomorphic to that contain . The graph is -irregular if its vertices do not all have distinct -degrees.
Nonexistence conjecture. There are no -regular -irregular graphs.
The conjecture would improve the bounds obtained in the paper, which show that any -regular -irregular graph would have order between and . The preceding heuristic search found examples with exactly two equal pairs of -degrees for orders , , , and , so the conjecture remains open based on the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Artem Hak, Sergiy Kozerenko and Andrii Serdiuk, “Regular K_3-irregular graphs”, arXiv:2507.18776 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.