Proper Bounded Edge-Colorings
Claudia Bertram‐Kretzberg, Hanno Lefmann, Vojtěch Rödl, Beata Wysocka · 1997
Abstract. For an n-element set X and a proper coloring ∆: [X] k −→ {0, 1,...} where each color class is a matching with cardinality bounded by u, we show that there exists a totally multicolored subset Y ⊆ X with |Y | ≥ max c1 · ( n k) 1 ( ) 1 ( ( 2k−1 k 1