arXiv (All)
open access
On rainbow saturated graphs with minimum number of edges
Let $F$ be a fixed graph without isolated vertices. An edge-colored graph is $F$-rainbow saturated if it contains no rainbow copy of $F$, but the addition of any missing edge in any color creates a rainbow copy of $F$. The rainbow saturation number $rsat(n,F)$ is the minimum number of edges in such
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
- The Rainbow Saturation Number of Cycles#1129052
- Lower bound on the maximum denominator of fractional chromatic numbers#280468
- Propionic Acid in Multiple Sclerosis#851725
- A Study of Apalutamide (Adjuvant Treatment) and Androgen Deprivation Therapy (ADT) in Participants Who Have Undergone Radical Prostatectomy (RP) for Non-metastatic Prostate Cancer and Who Are at High Risk for Metastases#1151013
- Special Investigation in Patients With Rheumatoid Arthritis (HOPEFUL III Study), a Follow-up Survey of Study P12-069#844214
Record · ID 1129509
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