arXiv (All)
open access
The Rainbow Saturation Number of Cycles
An edge-colored graph $(G,\mathcal C)$ is $F$-rainbow saturated if it contains no rainbow copy of $F$, but adding any nonedge in any prescribed color creates one. The rainbow saturation number $\operatorname{rsat}(n,F)$ is the minimum number of edges in such a graph of order $n$. In this paper w
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On rainbow saturated graphs with minimum number of edges#1129509
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Coloring Queens with Thousands of Encodings#1064218
- Lower bound on the maximum denominator of fractional chromatic numbers#280468
- On colorful Helly numbers and the growth of Tverberg numbers#1014791
Record · ID 1129052
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive