TR-2005-05

A note on [k,l]-sparse graphs

Zsolt Fekete, László Szegő

In this note we provide a Henneberg-type constructive characterization theorem of [k,l]-sparse graphs, that is, the graphs for which the number of induced edges in any subset X of nodes is at most k|X|-l. We consider the case 0 <= l <= k.

Bibtex entry:

@techreport{egres-05-05,

AUTHOR	=	{Fekete, Zsolt and Szeg{\H o}, L{\'a}szl{\'o}},
TITLE	=	{A note on $[k,l]$-sparse graphs},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2005},
NUMBER	=	{TR-2005-05}

}