Hypergraph families with bounded edge cover or transversal number

DOI10.1007/BF02579191zbMATH Open0534.05052OpenAlexW2047637845MaRDI QIDQ790130FDOQ790130

Authors: N. E. Zubov 

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579191

Recommendations

• Hypergraphs with large transversal number
• Hypergraphs with large transversal number and with edge sizes at least four
• The largest transversal numbers of uniform hypergraphs
• Bounding the vertex cover number of a hypergraph
• Fractional v. integral covers in hypergraphs of bounded edge size

zbMATH Keywords

covering numberpacking numbertransversal numberHelly hypergraphsstrong stability number

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Combinatorial properties of polyominoes
• On chromatic number of graphs and set-systems
• Hypergraphes arbores
• Graph Theory and Probability. II
• A Ramsey-type theorem and its application to relatives of Helly's theorem

Cited In (15)

• Indiscernibility structures induced from function sets: graph and digraph case
• Disjointness graphs of short polygonal chains
• The adjacency matrix of a graph as a data table: a geometric perspective
• Decision systems in rough set theory: a set operatorial perspective
• Gallai-type results for multiple boxes and forests
• Pairings and related symmetry notions
• Granular computing on basic digraphs
• Covering with Euclidean boxes
• Simplicial complexes and closure systems induced by indistinguishability relations
• Supervised box clustering
• Local dissymmetry on graphs and related algebraic structures
• Disjointness graphs of segments in the space
• Containment problems in high-dimensional spaces
• Hypergraphs with large transversal number and with edge sizes at least 3
• Covering and coloring problems for relatives of intervals

This page was built for publication: Hypergraph families with bounded edge cover or transversal number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790130)