A note on restricted list edge-colourings (Q1715081)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7011214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on restricted list edge-colourings |
scientific article; zbMATH DE number 7011214 |
Statements
A note on restricted list edge-colourings (English)
0 references
1 February 2019
0 references
By extending the method of \textit{F. Galvin} [J. Comb. Theory, Ser. B 63, No. 1, 153--158 (1995; Zbl 0826.05026)] and using the stable marriage theorem of \textit{D. Gale} and \textit{L. S. Shapley} [Am. Math. Mon. 69, 9--15 (1962; Zbl 0109.24403)], the author proves an extension of Galvin's theorem, namely that any graph is $L$-edge-choosable if $\vert L(e)\vert \geq \chi '(G)$ and the edge-lists of no odd cycle contain a common colour.
0 references
restricted list edge-colourings
0 references
$L$-edge-choosable graph
0 references
odd cycle
0 references
stable matching
0 references
Galvin's theorem
0 references
Gale-Shapley's theorem
0 references
0.8085492253303528
0 references
0.7962527275085449
0 references
0.7946508526802063
0 references
0.7939260601997375
0 references
