Metraipolis › archive › dc_d1c290da87af

Rainbow connecting $2$-colorings of super-Dirac graphs — arXiv:2609.11437

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11437
License (as archived)
CC0-1.0
Archived
2026-10-16T06:13:51.805Z
SHA-256 of the archived text
f7fedb45a3d2def9102ecefb9cd6c3071ebf0a08415bed25c1e2a0a068a60632
Stable URL of this page
https://metraipolis.com/documento/dc_d1c290da87af

How to cite

Rainbow connecting $2$-colorings of super-Dirac graphs — arXiv:2609.11437 — arXiv (en), https://arxiv.org/abs/2609.11437 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d1c290da87af (Metraipolis archive dc_d1c290da87af, sha256 f7fedb45a3d2def9102ecefb9cd6c3071ebf0a08415bed25c1e2a0a068a60632)
BibTeX
@misc{dcd1c290da87af,
  title = {Rainbow connecting $2$-colorings of super-Dirac graphs — arXiv:2609.11437},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11437},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d1c290da87af; sha256 f7fedb45a3d2def9102ecefb9cd6c3071ebf0a08415bed25c1e2a0a068a60632},
  year = {2026}
}

Archived text

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

Let $G$ be a graph with minimum degree $\delta(G)\ge|V(G)|/2$. Can we color the edges of $G$ with red and blue so that every pair of non-adjacent vertices is connected by a path consisting of exactly one red edge and one blue edge? We provide an affirmative answer to this question for a class of graphs that are ``close'' to a complete balanced bipartite graph or the disjoint union of two cliques of the same order. Surprisingly, our methods extend to a much broader class of graphs with minimum degree slightly above $|V(G)|/2$. Furthermore, we answer an asymptotic version of this question in full, proving that every graph $G$ satisfying $\delta(G)\ge(|V(G)|-1)/2$ has a $2$-edge-coloring such that almost all pairs of vertices are connected by a rainbow path. In addition, we propose a number of related open problems.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11437 — 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-16T05:59:08.304Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).