International audienceWe focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1.4977^n and at most like 1.5012^n
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
International audienceWe focus on the maximum number of minimal transversals in 3-partite 3-uniform ...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergrap...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
This book gives the state-of-the-art on transversals in linear uniform hypergraphs. The notion of tr...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
Let t r (n; r + 1) denote the smallest integer m such that every r-uniform hypergraph on n vertices ...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
International audienceWe focus on the maximum number of minimal transversals in 3-partite 3-uniform ...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergrap...
We study the maximum number of hyperedges in a 3-uniform hypergraph on n vertices that does not cont...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
This book gives the state-of-the-art on transversals in linear uniform hypergraphs. The notion of tr...
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is ...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
Let t r (n; r + 1) denote the smallest integer m such that every r-uniform hypergraph on n vertices ...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
ABSTRACT: Let 0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph we define 0() to be t...
International audienceWe prove that one can count in polynomial time the number of minimal transvers...
DOI
Add to ORKG