AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of different edges of H form a new hypergraph which is denoted by H′. Let us suppose that H has the Helly property and we want to state something similar for H′. We prove a conjecture of C, Berge and two negative results
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
AbstractA (strongly) Helly graph* is a connected graph for which any finite (resp. finite or infinit...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
The aim of this note is to point out that some well-known theorems and their generalizations can be ...
AbstractA hypergraph (finite set system) H is called a bi-Helly family if it satisfies the following...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
Eduard Helly (18$4- 1943) discovered his famous theorem concerning the intersection of certain famil...
I will discuss the combinatorial relationship between the colorful Helly theorem and the fractional ...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
AbstractIt is shown that for chordless path convexity in any graph, the Helly number equals the size...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
AbstractA (strongly) Helly graph* is a connected graph for which any finite (resp. finite or infinit...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
AbstractIn this article we characterize bipartite graphs whose associated neighborhood hypergraphs h...
The aim of this note is to point out that some well-known theorems and their generalizations can be ...
AbstractA hypergraph (finite set system) H is called a bi-Helly family if it satisfies the following...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
In 1923, Eduard Helly published his celebrated theo-rem, which originated the well known Helly prope...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
Eduard Helly (18$4- 1943) discovered his famous theorem concerning the intersection of certain famil...
I will discuss the combinatorial relationship between the colorful Helly theorem and the fractional ...
AbstractThe notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C...
AbstractIt is shown that for chordless path convexity in any graph, the Helly number equals the size...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
AbstractA (strongly) Helly graph* is a connected graph for which any finite (resp. finite or infinit...
International audienceWe show that very weak topological assumptions are enough to ensure the existe...
DOI
Add to ORKG