1 citations · 2 across the 8 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.DS2020
A backward ergodic theorem along trees and its consequences for free group actions
Anush Tserunyan, Jenna Zomback
We prove a new pointwise ergodic theorem for probability-measure-preserving (pmp) actions of free groups, where the ergodic averages are taken over arbitrary finite subtrees of the…
math.CO2020
Characterization of saturated graphs related to pairs of disjoint matchings
Zhengda Mo, Sam Qunell, Anush Tserunyan +1
We study the ratio, in a finite graph, of the sizes of the largest matching in any pair of disjoint matchings with the maximum total number of edges and the largest possible matchi…
math.CO2020★ 1 cited
Pairs of disjoint matchings and related classes of graphs
Huizheng, Guo, Kieran Kaempen +6
For a finite graph , we study the maximum -edge colorable subgraph problem and a related ratio , where is the matching number of , and is…