scientific article; zbMATH DE number 3616474
From MaRDI portal
Publication:4180391
zbMath0397.05040MaRDI QIDQ4180391
No author found.
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (47)
Generalizations and strengthenings of Ryser's conjecture ⋮ Inequalities for minimal covering sets in set systems of given rank ⋮ A new construction of non-extendable intersecting families of sets ⋮ Uniform intersecting families with covering number four ⋮ Pseudo sunflowers ⋮ Load balancing in quorum systems ⋮ Symmetric designs as the solution of an extremal problem in combinatorial set theory ⋮ The geometry and combinatorics of discrete line segment hypergraphs ⋮ Fractional \(K_{4}\)-covers ⋮ Matching and domination numbers in \(r\)-uniform hypergraphs ⋮ On a theorem of Lovász on covers in \(r\)-partite hypergraphs ⋮ Color the cycles ⋮ Exchange Properties of Finite Set-Systems ⋮ Covering random graphs with monochromatic trees ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Uniform intersecting families with large covering number ⋮ Approximating vertex cover in dense hypergraphs ⋮ Maximum degree and fractional matchings in uniform hypergraphs ⋮ Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs ⋮ Covers in partitioned intersecting hypergraphs ⋮ On symmetric intersecting families ⋮ Partitioning random graphs into monochromatic components ⋮ A note on a series of families constructed over the cyclic graph ⋮ Independence-domination duality ⋮ Membership criteria and containments of powers of monomial ideals ⋮ Intersecting balanced families of sets ⋮ Unnamed Item ⋮ Linear kernelizations for restricted 3-Hitting Set problems ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ Approximability of clique transversal in perfect graphs ⋮ Monochromatic components in edge-colored complete uniform hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Invitation to intersection problems for finite sets ⋮ Nonintersecting Ryser Hypergraphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Approximating the discrete time-cost tradeoff problem with bounded depth ⋮ Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs ⋮ Matchings and covers in hypergraphs ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Regular intersecting families ⋮ Quorum systems constructed from combinatorial designs ⋮ Critical hypergraphs and interesting set-pair systems ⋮ Intersecting designs from linear programming and graphs of diameter two ⋮ Covering complete graphs by monochromatically bounded sets
This page was built for publication:
