10 citations · 23 across the 10 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation
Kristóf Bérczi, András Frank
Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with matching number at least $\el…
math.CO2016★ 2 cited
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs
Kristóf Bérczi, András Frank
By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree…
math.CO2016
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
Kristóf Bérczi, András Frank
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, chara…