Edge coloring multigraphs without small dense subsets
| dc.contributor.author | Haxell, P.E. | |
| dc.contributor.author | Kierstead, H.A. | |
| dc.date.accessioned | 2020-07-06T14:42:00Z | |
| dc.date.available | 2020-07-06T14:42:00Z | |
| dc.date.issued | 2015-12-06 | |
| dc.description | © 2015. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| dc.description.abstract | One consequence of a long-standing conjecture of Goldberg and Seymour about the chromatic index of multigraphs would be the following statement. Suppose $G$ is a multigraph with maximum degree $\Delta$, such that no vertex subset $S$ of odd size at most $\Delta$ induces more than $(\Delta+1)(|S|-1)/2$ edges. Then $G$ has an edge coloring with $\Delta+1$ colors. Here we prove a weakened version of this statement. | en |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council | en |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2015.06.022 | |
| dc.identifier.uri | http://hdl.handle.net/10012/16027 | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | multigraphs | en |
| dc.subject | edge coloring | en |
| dc.subject | Goldberg's conjecture | en |
| dc.title | Edge coloring multigraphs without small dense subsets | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Haxell, P. E., and H. A. Kierstead. “Edge Coloring Multigraphs without Small Dense Subsets.” Discrete Mathematics 338, no. 12 (December 6, 2015): 2502–6. https://doi.org/10.1016/j.disc.2015.06.022. | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
| uws.typeOfResource | Text | en |