The paper determines extremal edge counts (minimum, sum, product) for rainbow graph collections avoiding both a fixed graph F and a matching of size s+1.
Falgas-Ravry, K
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Rainbow Tur\'an problems for a matching and any other graph
The paper determines extremal edge counts (minimum, sum, product) for rainbow graph collections avoiding both a fixed graph F and a matching of size s+1.