Pages that link to "Item:Q2971036"
From MaRDI portal
The following pages link to KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036):
Displaying 12 items.
- Helly-type theorems for appropriate colorings of visibility sets (Q1601707) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Measurable versions of Vizing's theorem (Q2006081) (← links)
- Invariant Schreier decorations of unimodular random networks (Q2077204) (← links)
- Approximate Schreier decorations and approximate Kőnig's line coloring theorem (Q2136414) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022 (Q2693030) (← links)
- Orienting Borel graphs (Q5027220) (← links)
- Definable Kőnig theorems (Q6095830) (← links)
- The matroid of a graphing (Q6615766) (← links)