The largest transversal numbers of uniform hypergraphs (Q1910524): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:12, 5 March 2024

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
    hypergraph
    0 references
    transversal number
    0 references
    stability number
    0 references

    Identifiers