8 citations · 14 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 5 cited
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles
H. A. Kierstead, A. V. Kostochka, E. C. Yeager
In 1963, Corrádi and Hajnal proved that for all and , every (simple) graph on n vertices with minimum degree at least 2k contains k disjoint cycles. The same ye…
math.CO2014
Large subposets with small dimension
Benjamin Reiniger, Elyse Yeager
Dorais asked for the maximum guaranteed size of a dimension subposet of an -element poset. A lower bound of order was found by Goodwillie. We provide a sublinear…