Title of article
The Numbers of Dependent k-Sets in a Graph Are Log Concave
Author/Authors
Horrocks، نويسنده , , David G.C. Owens، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
180
To page
185
Abstract
A set of vertices in a graph is said to be dependent if it is not independent. Let pk(G) denote the number of dependent sets of size k in the graph G. We show that, for any graph G, the sequence {pk(G)} is logarithmically concave.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2002
Journal title
Journal of Combinatorial Theory Series B
Record number
1526946
Link To Document