Odd-cycle-free facet complexes and the König property

DOI10.1216/RMJ-2011-41-4-1059MaRDI QIDQ635259zbMATHFDO

Authors Sara Faridi, Massimo Caboara

Publication date 19 August 2011

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0703459

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65)

Abstract: We use the definition of a simplicial cycle to define an odd-cycle-free facet complex (hypergraph). These are facet complexes that do not contain any cycles of odd length. We show that besides one class of such facet complexes, all of them satisfy the K"onig property. This new family of complexes includes the family of balanced hypergraphs, which are known to satisfy the K"onig property. These facet complexes are, however, not Mengerian; we give an example to demonstrate this fact.

Recommendations

• On connectivity of the facet graphs of simplicial complexes
• scientific article; zbMATH DE number 4033788
• scientific article; zbMATH DE number 426370
• scientific article; zbMATH DE number 1998859
• On the optimal transversals of the odd cycles

Cited in

(4)

• Monomial resolutions supported by simplicial trees
• Recursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posets
• Packing properties of cubic square-free monomial ideals
• Depths and Cohen-Macaulay properties of path ideals

Describes a project that uses

Uses Software

• SINGULAR

This page was built for publication: Odd-cycle-free facet complexes and the König property

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