4 citations · 7 across the 13 of their papers we have counts for
1 paper · 1 filter
Deepak Bal, Louis DeBiasio
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r−1 monochromatic components; this is a strengthening of a conj…