arXiv (All)
open access
There is no $8$-regular $K_3$-irregular graph
A graph is $K_3$-irregular if its vertices belong to pairwise distinct numbers of triangles. We prove that no $8$-regular $K_3$-irregular graph exists, settling the last unresolved case. Following the initial discovery of such graphs for regularities $r \in \{10,11,12\}$ (Stevanovi'c et al., 2024),
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From the Lagrange Triangle to the Figure Eight Choreography: Proof of Marchal's Conjecture#1144695
- Triangle Tiling: The case $3α+ 2β= π$#1115443
- The Delta of the Triple Elevens#40422
- Removable matchings in $2$-connected graphs#974996
- Hexagonal Tiling of the Plane#177103
Record · ID 1142280
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive