The numbers of dependent k-sets in a graph are log concave

Journal of Combinatorial Theory. Series B

Volumn 84, Issue 1, 2002, Pages 180-185

  Horrocks, David G C ^a  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036170715     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2077     Document Type: Article

References (9)

1. "Combinatorics of Finite Sets"
2. "Graph Theory with Applications"
3. Log-concave and unimodal sequences in algebra, combinatorics, and geometry: An update
4. On the numbers of independent k- sets in a claw free graph
5. On Lih's Conjecture concerning Spernerity
6. Doubly dependent sets in graphs
7. Log-concave and unimodal sequences in algebra, combinatorics, and geometry
8. 2(C)
9. On a conjecture on the Sperner property