| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5776855 | Discrete Mathematics | 2017 | 17 Pages |
Abstract
An r-edge coloring of a graph or hypergraph G=(V,E) is a map c:Eâ{0,â¦,râ1}. Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove that
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Márton Elekes, Dániel T. Soukup, Lajos Soukup, Zoltán Szentmiklóssy,