EUVIMEDEUVIMED entdecken
Crossref

Forbidding monochromatic odd cycles and rainbow cycles in complete graphs

Derrick DeMars, Peter Johnson

Congressus Numerantium · 22.06.2026 · 237 · 113-120

DOI: 10.61091/cn237-08 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 22.06.2026. Verfasst von Derrick DeMars und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A \(k\)-edge coloring \(c\) of the edge set \(E (G)\) of a graph \(G\) is a surjective mapping \(c : E (G) \to [k] = \{1, 2, \ldots, k\}\). If \(\mathcal{F}\) and \(\mathcal{H}\) are families of graphs, \(MRS(K_n; \mathcal{F}, \mathcal{H})\) is the set of numbers \(k\) such that there is a \(k\)-edge coloring of \(K_n\) with respect to which there is neither a monochromatic copy of any \(F \in \mathcal{F}\) nor a rainbow copy of any \(H \in \mathcal{H}\) in \(K_n\). Our main result is that for all \(n \geq 2\), \(MRS(K_n;\{\text{odd cycles}\},\{\text{cycles}\}) = \{\lceil \log_2 n \rceil, \ldots, n - 1\}\). The proof will exploit an idea for edge-coloring connected graphs so as to forbid rainbow cycles to be found in [4].

Zitieren

APA

DeMars, D., & Johnson, P. (2026). Forbidding monochromatic odd cycles and rainbow cycles in complete graphs. Congressus Numerantium, 237, 113-120. https://doi.org/10.61091/cn237-08

Vancouver

DeMars D, Johnson P. Forbidding monochromatic odd cycles and rainbow cycles in complete graphs. Congressus Numerantium. 2026;237:113-120. doi:10.61091/cn237-08

BibTeX
@article{DeMars2026,
  author = {DeMars, Derrick and Johnson, Peter},
  title = {Forbidding monochromatic odd cycles and rainbow cycles in complete graphs},
  journal = {Congressus Numerantium},
  year = {2026},
  volume = {237},
  pages = {113--120},
  doi = {10.61091/cn237-08}
}
Kostenlos starten →