Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On k-saturated graphs with restrictions on the degrees Ron Holzman
 

Summary: On k-saturated graphs with restrictions on the degrees
Noga Alon
Paul Erdos
Ron Holzman
Michael Krivelevich§
February 22, 2002
Abstract
A graph G is called k-saturated, where k 3 is an integer, if G is Kk
-free
but the addition of any edge produces a Kk
(we denote by Kk
a complete graph
on k vertices). We investigate k-saturated graphs, and in particular the function
Fk(n, D) defined as the minimal number of edges in a k-saturated graph on n
vertices having maximal degree at most D. This investigation was suggested by
Hajnal, and the case k = 3 was studied by F¨uredi and Seress. The following are
some of our results. For k = 4, we prove that F4(n, D) = 4n - 15 for n > n0 and
2n-1
3 D n - 2. For arbitrary k, we show that the limit limn Fk(n, cn)/n
exists for all 0 < c 1, except maybe for some values of c contained in a sequence

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics