Metraipolis › archive › dc_5477a3e33d78
On-line majority edge-colourings of graphs — arXiv:2609.37973
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37973
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:49.910Z
- SHA-256 of the archived text
467c6f4c19081c35b8f092e0906f2789c70c266e863964c7da77c5133e25b8f6- Stable URL of this page
https://metraipolis.com/documento/dc_5477a3e33d78
How to cite
On-line majority edge-colourings of graphs — arXiv:2609.37973 — arXiv (en), https://arxiv.org/abs/2609.37973 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5477a3e33d78 (Metraipolis archive dc_5477a3e33d78, sha256 467c6f4c19081c35b8f092e0906f2789c70c266e863964c7da77c5133e25b8f6)
BibTeX
@misc{dc5477a3e33d78,
title = {On-line majority edge-colourings of graphs — arXiv:2609.37973},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37973},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5477a3e33d78; sha256 467c6f4c19081c35b8f092e0906f2789c70c266e863964c7da77c5133e25b8f6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37973. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A majority edge-colouring of a graph $G$ is a colouring of the edges of $G$ such that, for every vertex $v$ of $G$, at most half of the edges incident with $v$ receive the same colour. This notion was introduced by Bock et al. in 2023, who proved that every graph of minimum degree at least $2$ has a majority $4$-edge-colouring. We investigate an on-line variant of majority edge-colouring in which the graph is revealed by the Presenter edge-by-edge and the Algorithm must colour each edge immediately and irrevocably. In particular. we prove that the greedy strategy, which uses at most five colours, is optimal among on-line algorithms if $\delta = O(\frac{\log n}{\log\log n})$. We further extend our results to $1/k$-majority edge-colourings.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37973 — 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-07T17:59:19.253Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).