Hypergraph families with bounded edge cover or transversal number
From MaRDI portal
Publication:790130
Recommendations
Cites work
Cited in
(15)- Simplicial complexes and closure systems induced by indistinguishability relations
- Covering and coloring problems for relatives of intervals
- Gallai-type results for multiple boxes and forests
- Hypergraphs with large transversal number and with edge sizes at least 3
- Indiscernibility structures induced from function sets: graph and digraph case
- Covering with Euclidean boxes
- Disjointness graphs of short polygonal chains
- Decision systems in rough set theory: a set operatorial perspective
- Disjointness graphs of segments in the space
- Pairings and related symmetry notions
- The adjacency matrix of a graph as a data table: a geometric perspective
- Supervised box clustering
- Local dissymmetry on graphs and related algebraic structures
- Containment problems in high-dimensional spaces
- Granular computing on basic digraphs
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)