Total transversals and total domination in uniform hypergraphs (Q405218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.7359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear hypergraphs with large transversal number and maximum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large domination number and with edge sizes at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number and with edge sizes at least four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number and with edge sizes at least 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in 2-connected graphs and in graphs with no induced 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Transversals in Hypergraphs and Double Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and matchings in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph domination and strong independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many disjoint 2-edge paths must a cubic graph have? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the transversal numbers of 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank

Latest revision as of 00:49, 9 July 2024

scientific article
Language Label Description Also known as
English
Total transversals and total domination in uniform hypergraphs
scientific article

    Statements

    Total transversals and total domination in uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2014
    0 references
    Summary: \textit{C. Bujtás} et al. [Eur. J. Comb. 33, No. 1, 62--71 (2012; Zbl 1284.05224)] 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.
    0 references
    0 references
    0 references
    0 references
    0 references
    total domination
    0 references
    total transversal
    0 references
    hypergraph
    0 references
    0 references