Proves that colorings of K_n with >= g(n,s) colors lacking a rainbow matching of size s+2 contain a monochromatic K_{n-s} or monochromatic K_{n-2s-1} vee empty K_{2s+1}.
K¨ onig, Theorie der endlichen und unendlichen Graphen,Akademische Verlagsge- sellschaft
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stability for the Anti-Ramsey Number of Matchings
Proves that colorings of K_n with >= g(n,s) colors lacking a rainbow matching of size s+2 contain a monochromatic K_{n-s} or monochromatic K_{n-2s-1} vee empty K_{2s+1}.