Hypergraph families with bounded edge cover or transversal number

DOI10.1007/BF02579191zbMath0534.05052OpenAlexW2047637845MaRDI QIDQ790130

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

zbMATH Keywords

packing numbercovering numbertransversal numberHelly hypergraphsstrong stability number

Mathematics Subject Classification ID

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

Related Items (14)

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

Cites Work

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

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