2 citations · 3 across the 6 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.CO2008
High degree graphs contain large-star factors
Noga Alon, Nicholas Wormald
We show that any finite simple graph with minimum degree contains a spanning star forest in which every connected component is of size at least . This sett…
math.CO2008★ 1 cited
Regular induced subgraphs of a random graph
Michael Krivelevich, Benny Sudakov, Nicholas Wormald
An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, w…