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

DOI10.1006/JCTB.2001.2077MaRDI QIDQ1850583zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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; zbMATH DE number 4142076
• scientific article; zbMATH DE number 1792666

Cites work

• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• scientific article; zbMATH DE number 568836 (Why is no real title available?)
• scientific article; zbMATH DE number 718851 (Why is no real title available?)
• scientific article; zbMATH DE number 1556740 (Why is no real title available?)
• Graph theory with applications
• Logarithmic concavity and \({\mathfrak {sl}}_2({\mathbf C})\)
• On Lih's conjecture concerning Spernerity
• On a conjecture on the Sperner property
• On the numbers of independent k-sets in a claw free graph

Cited in

(4)

• scientific article; zbMATH DE number 1792666 (Why is no real title available?)
• On the unimodality of domination polynomials
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• scientific article; zbMATH DE number 1556740 (Why is no real title available?)

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)