8 citations · 24 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
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…
Independent Sets in Algebraic Hypergraphs
Anton Bernshteyn, Michelle Delcourt, Anush Tserunyan
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics…
A short nonalgorithmic proof of the containers theorem for hypergraphs
Anton Bernshteyn, Michelle Delcourt, Henry Towsner +1
Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason, has been used to study sparse rand…