| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653369 | European Journal of Combinatorics | 2015 | 7 Pages |
Abstract
We prove that every graph with maximum degree ΔΔ admits a partition of its edges into O(Δ) parts (as Δ→∞Δ→∞) none of which contains C4C4 as a subgraph. This bound is sharp up to a constant factor. Our proof uses an iterated random colouring procedure.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ross J. Kang, Guillem Perarnau,