Showing math.COShow all
2 papers · 1 filter
math.CO2010
Cycles in Sparse Graphs II
Jacques Verstraete, Benny Sudakov
The {\em independence ratio} of a graph is defined by \[ ι(G) := \sup_{X \subset V(G)} \frac{|X|}{α(X)},\] where is the independence number of the subgraph of induce…
math.CO2002
Arithmetic Progressions of Cycle Lengths in Graphs
Jacques Verstraete
A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecu…