In Borel unbalanced bipartite multigraphs there exists a Borel matching covering μ-almost every vertex in the higher-degree part for any Borel probability measure μ.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Existence of topologically free minimal F_∞-actions on the Cantor set without dynamical comparison (with or without invariant measures), plus separation of strict comparison in the crossed product from dynamical comparison, via monoid construction and embedding into a refinement monoid realized as a
Constructs equivariant E-theory and a natural Baum-Connes assembly map for Fell bundles of inverse semigroups, covering maximal, reduced, and essential cases with applications to groupoids and Cartan pairs.
Formulas are supplied for the type semigroup of C*-algebras arising from self-similar group actions on row-finite source-free graphs and from finite bipartite separated graphs.
citing papers explorer
-
Measurable matchings in unbalanced graphs
In Borel unbalanced bipartite multigraphs there exists a Borel matching covering μ-almost every vertex in the higher-degree part for any Borel probability measure μ.
-
Topologically free minimal actions without dynamical comparison
Existence of topologically free minimal F_∞-actions on the Cantor set without dynamical comparison (with or without invariant measures), plus separation of strict comparison in the crossed product from dynamical comparison, via monoid construction and embedding into a refinement monoid realized as a
-
A Baum-Connes assembly map for essential semigroup crossed products
Constructs equivariant E-theory and a natural Baum-Connes assembly map for Fell bundles of inverse semigroups, covering maximal, reduced, and essential cases with applications to groupoids and Cartan pairs.
-
An introduction to separated graphs and their type semigroups
Formulas are supplied for the type semigroup of C*-algebras arising from self-similar group actions on row-finite source-free graphs and from finite bipartite separated graphs.