Metraipolis › archive › dc_241b4321990f
On the lower- and upper bounds of three-colored anti-Ramsey numbers — arXiv:2611.03878
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03878
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T19:00:14.679Z
- SHA-256 of the archived text
d3918e87338f3e7c9715ef144424ce88f7809044fa64c39c20aebe5b9f949aa8- Stable URL of this page
https://metraipolis.com/documento/dc_241b4321990f
How to cite
On the lower- and upper bounds of three-colored anti-Ramsey numbers — arXiv:2611.03878 — arXiv (en), https://arxiv.org/abs/2611.03878 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_241b4321990f (Metraipolis archive dc_241b4321990f, sha256 d3918e87338f3e7c9715ef144424ce88f7809044fa64c39c20aebe5b9f949aa8)
BibTeX
@misc{dc241b4321990f,
title = {On the lower- and upper bounds of three-colored anti-Ramsey numbers — arXiv:2611.03878},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03878},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_241b4321990f; sha256 d3918e87338f3e7c9715ef144424ce88f7809044fa64c39c20aebe5b9f949aa8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03878. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper we study a relatively new Ramsey type graph parameter introduced by my Bachelor's thesis supervisor Nóra Almási, and her Master's thesis supervisor Maria Axenovich. The parameter $\xi(G)$ denotes the largest natural number $n$, such that there is a red-blue-green edge coloring of $K_n$, such that in the edge coloring all copies of $G$ represent all three colors. After a brief recap on Ramsey numbers, we precisely define $\xi(G)$, and take a look at its relations to the Ramsey numbers. In the third chapter we establish lower bounds on $\xi(G)$, in the cases $G=K_5$ and $G=K_6$, namely $\xi(K_5)\ge 19$ and $\xi(K_6)\ge 31$. 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/2611.03878 — 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-11-04T18:38:22.299Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).