Total domination of graphs and small transversals of hypergraphs (Q949753): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q858107
Property / author
 
Property / author: Steéphan Thomassé / rank
Normal rank
 

Revision as of 10:10, 21 February 2024

scientific article
Language Label Description Also known as
English
Total domination of graphs and small transversals of hypergraphs
scientific article

    Statements

    Total domination of graphs and small transversals of hypergraphs (English)
    0 references
    0 references
    21 October 2008
    0 references
    This paper proves the upper bound \((5n+4m)/21\) on the cardinality of a minimal transversal of a 4-uniform hypergraph with \(n\) vertices and \(m\) edges. In case of \(n=m\) it turns to \(3n/7\) and it is sharp. The paper proves some sharp results on the domination number of graphs with minimum degree 3 and 4, respectively.
    0 references
    transversal
    0 references
    domination number
    0 references

    Identifiers