Total transversals and total domination in uniform hypergraphs
From MaRDI portal
(Redirected from Publication:405218)
Abstract: The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs. We prove tight asymptotic upper bounds on the total transversal number in terms of the number of vertices, the number of edges, and the edge size.
Recommendations
- Transversals and domination in uniform hypergraphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Transversal total domination in graphs
- Transversal numbers of uniform hypergraphs
- Total transversals in hypergraphs and their applications
- Equality of domination and transversal numbers in hypergraphs
- The largest transversal numbers of uniform hypergraphs
- On the transversal number of \(k\)-uniform connected hypergraphs
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
Cites work
- scientific article; zbMATH DE number 5917555 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A survey of selected recent results on total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Covering all cliques of a graph
- Domination in hypergraphs
- How many disjoint 2-edge paths must a cubic graph have?
- Hypergraph domination and strong independence
- Hypergraphs with large domination number and with edge sizes at least three
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraphs with large transversal number and with edge sizes at least four
- Linear hypergraphs with large transversal number and maximum degree two
- Small transversals in hypergraphs
- Strong transversals in hypergraphs and double total domination in graphs
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Total domination in graphs
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
Cited in
(21)- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- On upper transversals in 3-uniform hypergraphs
- The minimum number of vertices in uniform hypergraphs with given domination number
- Domination game on uniform hypergraphs
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Transversals in 4-uniform hypergraphs
- Domination and total domination in hypergraphs
- Bounds on upper transversals in hypergraphs
- Domination numbers and noncover complexes of hypergraphs
- A note on improved upper bounds on the transversal number of hypergraphs
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Bounds on the game transversal number in hypergraphs
- Transversals and domination in uniform hypergraphs
- A note on fractional disjoint transversals in hypergraphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- Upper transversals in hypergraphs
- Transversals in uniform hypergraphs with property \((p,2)\)
- Total transversals in hypergraphs and their applications
This page was built for publication: Total transversals and total domination in uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405218)
