Efficiently list‐edge coloring multigraphs asymptotically optimally
type: Item
instance of: scholarly article
title: Efficiently list‐edge coloring multigraphs asymptotically optimally
author: Fotis Iliopoulos
author: Alistair Sinclair
publication date: 2023-10-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7751090
zbMATH Keywords: edge coloring
zbMATH Keywords: Goldberg-Seymour conjecture
zbMATH Keywords: list-edge-coloring conjecture
zbMATH Keywords: multigraphs
MaRDI profile type: Publication
full work available at URL: rsa.21074
OpenAlex ID: W4210692625
cites work: Random Walks That Find Perfect Objects and the Lovász Local Lemma
cites work: A Local Lemma for Focused Stochastic Algorithms
cites work: Stochastic Control via Entropy Compression
cites work: Multicoloured Hamilton cycles
cites work: Approximating the chromatic index of multigraphs
cites work: Rainbow Hamilton cycles in uniform hypergraphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q4074927
cites work: Lopsided Lovász Local lemma and Latin transversals
cites work: Q4411281
cites work: What can be sampled locally?
cites work: Q5090918
cites work: New Constructive Aspects of the Lovász Local Lemma
cites work: A New Notion of Commutativity for the Algorithmic Lovász Local Lemma
cites work: An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles
cites work: Q5009540
cites work: Approximating the Permanent
cites work: Asymptotically good list-colorings
cites work: Asymptotics of the chromatic index for multigraphs
cites work: Q4511485
cites work: On the stochastic independence properties of hard-core distributions
cites work: On Brooks' Theorem for Sparse Graphs
cites work: Q5585020
cites work: Commutativity in the Algorithmic Lovász Local Lemma
cites work: Q5202862
cites work: The list chromatic number of graphs with small clique number
cites work: A bound on the total chromatic number
cites work: Graph colouring and the probabilistic method
cites work: A constructive proof of the Lovász local lemma
cites work: A constructive proof of the general lovász local lemma
cites work: On the $1.1$ Edge-Coloring of Multigraphs
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: A sublinear bound on the chromatic index of multigraphs
cites work: Q4230353
cites work: An asymptotic approximation scheme for multigraph edge coloring
cites work: Graph edge colouring: Tashkinov trees and Goldberg's conjecture
cites work: Entropy, optimization and counting
DOI: 10.1002/RSA.21074
published in: Random Structures \& Algorithms
description: scientific article; zbMATH DE number 7751090