Total transversals and total domination in uniform hypergraphs
From MaRDI portal
Publication:405218
zbMATH Open1300.05196arXiv1310.7359MaRDI QIDQ405218FDOQ405218
Authors: Csilla Bujtás, Michael A. Henning, Zsolt Tuza, A. Yeo 
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1310.7359
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Transversal (matching) theory (05D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Transversal numbers of uniform hypergraphs
- Total domination in graphs
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Domination in hypergraphs
- Title not available (Why is that?)
- Strong transversals in hypergraphs and double total domination in graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large domination number and with edge sizes at least three
- Transversals and domination in uniform hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- Transversals and matchings in 3-uniform hypergraphs
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- How many disjoint 2-edge paths must a cubic graph have?
Cited In (21)
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
- Upper transversals in hypergraphs
- Transversals and domination in uniform hypergraphs
- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- The minimum number of vertices in uniform hypergraphs with given domination number
- On upper transversals in 3-uniform hypergraphs
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- A note on improved upper bounds on the transversal number of hypergraphs
- A note on fractional disjoint transversals in hypergraphs
- A Transition from Total Domination in Graphs to Transversals in Hypergraphs
- Domination and total domination in hypergraphs
- Bounds on the game transversal number in hypergraphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- Domination numbers and noncover complexes of hypergraphs
- Transversals in uniform hypergraphs with property \((p,2)\)
- Domination game on uniform hypergraphs
- Total transversals in hypergraphs and their applications
- Transversals in 4-uniform hypergraphs
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Bounds on upper transversals in hypergraphs
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)
