On the number of minimal transversals in 3-uniform hypergraphs
From MaRDI portal
(Redirected from Publication:932689)
Recommendations
Cites work
- A Note on Independent Sets in Trees
- Circumscription - a form of non-monotonic reasoning
- Circumscriptive theories: A logic-based framework for knowledge representation
- Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets
- Logic Programming
- New methods for 3-SAT decision and worst-case analysis
- On cliques in graphs
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- The Number of Maximal Independent Sets in a Tree
- The number of maximal independent sets in a connected graph
- The number of maximal independent sets in connected graphs
Cited in
(12)- Extremal problems related to Betti numbers of flag complexes
- On Triple Systems with Independent Neighbourhoods
- On the number of minimal dominating sets on some graph classes
- On upper transversals in 3-uniform hypergraphs
- scientific article; zbMATH DE number 165088 (Why is no real title available?)
- On the number of \(A\)-transversals in hypergraphs
- Minimum size transversals in uniform hypergraphs
- Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs
- Small cores in 3-uniform hypergraphs
- Counting minimal transversals of -acyclic hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
This page was built for publication: On the number of minimal transversals in 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932689)