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

DOI10.1006/JCTB.2001.2077zbMATH Open1027.05074OpenAlexW2043779144MaRDI QIDQ1850583FDOQ1850583

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1556740
• On the log concavity of reliability and matroidal sequences
• On the numbers of independent \(k\)-sets in a claw free graph
• scientific article
• scientific article; zbMATH DE number 1792666

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph theory with applications
• On the numbers of independent \(k\)-sets in a claw free graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logarithmic concavity and \({\mathfrak {sl}}_2({\mathbf C})\)
• On a conjecture on the Sperner property
• On Lih's conjecture concerning Spernerity
• Title not available (Why is that?)

Cited In (4)

• On the unimodality of domination polynomials
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850583)