19 citations · 59 across the 25 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 2 cited
A stability version for a theorem of Erdős on nonhamiltonian graphs
Zoltán Füredi, Alexandr Kostochka, Ruth Luo
Let be integers with , and set and $e(n,d):= \max\{h(n,d),h(n, \left \lfloor \frac{…
math.CO2016
A forest building process on simple graphs
Zhanar Berikkyzy, Steve Butler, Jay Cummings +4
Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in…