On the number of minimal transversals in 3-uniform hypergraphs

DOI10.1016/j.disc.2007.07.024zbMath1154.05046OpenAlexW2121301226MaRDI QIDQ932689

Zbigniew Lonc, Miroslaw Truszczynski

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.024

zbMATH Keywords

uniform hypergraphmaximal independent setminimal transversal

Mathematics Subject Classification ID

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

Related Items

Extremal problems related to Betti numbers of flag complexes, On the number of minimal dominating sets on some graph classes

Cites Work

• The number of maximal independent sets in a connected graph
• Circumscription - a form of non-monotonic reasoning
• Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
• Circumscriptive theories: A logic-based framework for knowledge representation
• New methods for 3-SAT decision and worst-case analysis
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• The number of maximal independent sets in connected graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Logic Programming
• On cliques in graphs