Measurable versions of Vizing's theorem

DOI10.1016/j.aim.2020.107378zbMath1464.05150arXiv1905.01716OpenAlexW3082287476MaRDI QIDQ2006081

Oleg Pikhurko, Jan Grebík

Publication date: 8 October 2020

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.01716

zbMATH Keywords

graph colouringaugmenting pathVizing's theoremBorel graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15)

Related Items (5)

Approximate Schreier decorations and approximate Kőnig's line coloring theorem ⋮ A fast distributed algorithm for \((\Delta+1)\)-edge-coloring ⋮ Definable Kőnig theorems ⋮ Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022 ⋮ Orienting Borel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Borel chromatic numbers
• Topics in orbit equivalence
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
• Measurable chromatic and independence numbers for ergodic graphs and group actions
• Measurable versions of the Lovász local lemma and measurable graph colorings
• A determinacy approach to Borel combinatorics
• A survey of Measured Group Theory
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
• Orbit Equivalence and Measured Group Theory
• Borel oracles. An analytical approach to constant-time algorithms
• Closed Sets Without Measurable Matching
• BROOKS’ THEOREM FOR MEASURABLE COLORINGS
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Measurable versions of Vizing's theorem