Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
On domination problems for permutation and other graphs
Theoretical Computer Science
Handbook of combinatorics (vol. 1)
Graph classes: a survey
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Line Graphs of Helly Hypergraphs
SIAM Journal on Discrete Mathematics
The helly property on subfamilies of limited size
Information Processing Letters
On the strong p-Helly property
Discrete Applied Mathematics
The colorful Helly theorem and general hypergraphs
European Journal of Combinatorics
| Hi-index | 0.89 |
In [V.I. Voloshin, On the upper chromatic number of a hypergraph, Australas. J. Combin. 11 (1995) 25-45], Voloshin proposed the following generalization of the Helly property. Let p ≥ 1, q ≥ 0 and s ≥ 0. A hypergraph H is (p, q)-intersecting when every partial hypergraph H' ⊆ H formed by p or less hyperedges has intersection of cardinality at least q. A hypergraph H is (p,q,s)- Helly when every partial (p,q)-intersecting hypergraph H' ⊆ H has intersection of cardinality at least s. In this work, we study the complexity of determining whether H is (p,q,s)-Helly.