Metraipolis › archive › dc_424fb70e4a7e

Regular $K_3$-Irregular Graphs of Every Regularity at Least Nine — arXiv:2610.08478

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08478
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:21.155Z
SHA-256 of the archived text
7313ae184908d1cf93218aca8bdb4d5a44c5ec4b6efb9fd6edd72485831e09e7
Stable URL of this page
https://metraipolis.com/documento/dc_424fb70e4a7e

How to cite

Regular $K_3$-Irregular Graphs of Every Regularity at Least Nine — arXiv:2610.08478 — arXiv (en), https://arxiv.org/abs/2610.08478 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_424fb70e4a7e (Metraipolis archive dc_424fb70e4a7e, sha256 7313ae184908d1cf93218aca8bdb4d5a44c5ec4b6efb9fd6edd72485831e09e7)
BibTeX
@misc{dc424fb70e4a7e,
  title = {Regular $K_3$-Irregular Graphs of Every Regularity at Least Nine — arXiv:2610.08478},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08478},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_424fb70e4a7e; sha256 7313ae184908d1cf93218aca8bdb4d5a44c5ec4b6efb9fd6edd72485831e09e7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08478. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a vertex $v$ of a graph $G$, the triangle-degree $\operatorname{td}_G(v)$ is the number of triangles containing $v$. A graph is triangle-distinct, or $K_3$-irregular, if its vertex triangle-degrees are pairwise distinct. Chartrand, Erdős, and Oellermann asked whether a regular $K_3$-irregular graph exists. We prove that such graphs exist for every regularity $r\ge 9$. More precisely, for every integer $k\ge 15$ we construct a $2k$-regular triangle-distinct graph on $4k+2$ vertices; complementation gives a $(2k+1)$-regular example of the same order. The construction uses two antiregular threshold blocks joined by a zero-one matrix with prescribed margins, followed by matrix $2$-switches that preserve those margins. After a uniform reference perturbation, exactly three triangle-degree collisions remain. Switches chosen according to parity remove two of them, and the last possible collision is controlled by a short quadratic discriminant argument. Odd $k\ge 17$ and even $k\ge 62$ are handled symbolically, while the remaining 24 values are settled by exact finite verification. Together with the known examples for $9\le r\le 29$, this closes the positive existence problem for every $r\ge 9$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.08478 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.566Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).