A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size (Q2111206): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering triangles in edge-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex cover number of 3-uniform hypergraph / 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: Q3270978 / 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: Total domination in 2-connected graphs and in graphs with no induced 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three / 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: Hypergraphs with large transversal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4483164 / 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 05:56, 31 July 2024

scientific article
Language Label Description Also known as
English
A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references