The largest transversal numbers of uniform hypergraphs (Q1910524)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The largest transversal numbers of uniform hypergraphs
scientific article

    Statements

    The largest transversal numbers of uniform hypergraphs (English)
    0 references
    0 references
    24 March 1996
    0 references
    If \(H\) is an \(r\)-uniform hypergraph of order \(p\) without \((r+ 1)\)-cliques, then the transversal number of \(H\) has an upper bound in terms of \(c= p- 2r\). As corollaries of this result, lower bounds for the largest order of \(r\)-uniform hypergraphs with specified transversal number and for the stability number of triangle-free graphs are given.
    0 references
    0 references
    0 references
    hypergraph
    0 references
    transversal number
    0 references
    stability number
    0 references