| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902833 | Discrete Mathematics | 2018 | 7 Pages |
Abstract
Furthermore, we present a stability version for the countable case of the latter result: We prove that the edge-colouring is uniquely determined on a large subgraph, as soon as the upper density of monochromatic paths in colour r+1 is bounded by âiâ[r]1âi.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz,