Dense Graphs without 3-Regular Subgraphs

In this paper, we show the existence of graphs with cn log log n edges that contain no 3-regular subgraphs. On the other hand, we show that graphs with ckn log Δ(G) edges contain k-regular subgraphs. We also consider a related problem for graphs with cn2 edges.