Title of article
Dense Graphs without 3-Regular Subgraphs
Author/Authors
Pyber، نويسنده , , L. and Rodl، نويسنده , , V. and Szemeredi، نويسنده , , E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
14
From page
41
To page
54
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1995
Journal title
Journal of Combinatorial Theory Series B
Record number
1525969
Link To Document