On the transversal number of rank \(k\) hypergraphs (Q6111474): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-20796-9_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313349545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / 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: Hypergraphs with large transversal number / 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: An upper bound for the transversal numbers of 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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 12:42, 2 August 2024

scientific article; zbMATH DE number 7722393
Language Label Description Also known as
English
On the transversal number of rank \(k\) hypergraphs
scientific article; zbMATH DE number 7722393

    Statements

    On the transversal number of rank \(k\) hypergraphs (English)
    0 references
    0 references
    0 references
    3 August 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    transversal
    0 references
    rank-\(k\) hypergraphs
    0 references
    maximum degree 2
    0 references
    extremal hypergraphs
    0 references
    0 references