Measurable Vizing's theorem

DOI10.1017/FMS.2024.83MaRDI QIDQ7026977zbMATH OpenFDO

Authors Jan Grebík

Publication date 17 February 2025

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/FMS.2024.83

Mathematics Subject Classification ID

Descriptive set theory (03E15) Coloring of graphs and hypergraphs (05C15) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Combinatorial probability (60C05)

Cites work

• A determinacy approach to Borel combinatorics
• A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
• Amenable Actions and Weak Containment of Certain Representations of Discrete Groups
• Approximate Schreier decorations and approximate Kőnig's line coloring theorem
• Baire measurable paradoxical decompositions via matchings
• Banach-Tarski paradox using pieces with the property of Baire.
• Borel asymptotic dimension and hyperfinite equivalence relations
• Borel chromatic numbers
• Borel circle squaring
• Borel combinatorics of locally finite graphs
• BROOKS’ THEOREM FOR MEASURABLE COLORINGS
• Cost of equivalence relations and groups
• Definable Kőnig theorems
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
• Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
• Factor-of-iid Schreier decorations of lattices in Euclidean spaces
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Invariant Schreier decorations of unimodular random networks
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
• Measurable circle squaring
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Measurable versions of Vizing's theorem
• Measure reducibility of countable Borel equivalence relations
• On Homomorphism Graphs
• The power of multi-step Vizing chains
• Topics in orbit equivalence
• Unfriendly colorings of graphs with finite average degree

Cited in

(3)

• Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
• Fast algorithms for Vizing's theorem on bounded degree graphs
• A linear-time algorithm for (1+)-edge-coloring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026977)