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

DOI10.1006/jctb.2001.2077zbMath1027.05074OpenAlexW2043779144MaRDI QIDQ1850583

David G. C. Horrocks

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2077

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

On the unimodality of domination polynomials ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma

Cites Work

• On a conjecture on the Sperner property
• On Lih's conjecture concerning Spernerity
• On the numbers of independent \(k\)-sets in a claw free graph
• Logarithmic concavity and \({\mathfrak {sl}}_2({\mathbf C})\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The numbers of dependent \(k\)-sets in a graph are log concave