1 citations · 2 across the 8 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022★ 1 cited
One-ended spanning trees and definable combinatorics
Matthew Bowen, Antoine Poulin, Jenna Zomback
Let be a Polish space with Borel probability measure and a locally finite one-ended Borel graph on We show that admits a Borel one-ended spanning tree gen…
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…