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
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractThis paper shows that for any subset S of vertices of the n-dimensional hypercube, ind(S)≤2n...
AbstractCet article regroupe queiques remarques sur les relations d'inclusion entre aretes et ensemb...
AbstractLet F be uniform hypergraph. In the present paper I prove that of |F| < n13 42 then the chro...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(∗) if...
AbstractThe paper contains some basic results from “dart calculus” of induced subsets. We obtain as ...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(*) if...
AbstractIn [M. Sonntag, Antimagic vertex labelings of hypergraphs, Discrete Math. 247 (2002) 187–199...
AbstractA hypergraph is called normal if the chromatic index of any partial hypergraph H′ of it coin...
AbstractIn a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that ...
AbstractLet Gn be a complete transitively directed graph with n + 1 vertices v0, v1, …, vn. Let ψ(n)...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractThis paper shows that for any subset S of vertices of the n-dimensional hypercube, ind(S)≤2n...
AbstractCet article regroupe queiques remarques sur les relations d'inclusion entre aretes et ensemb...
AbstractLet F be uniform hypergraph. In the present paper I prove that of |F| < n13 42 then the chro...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractLet H be a hypergraph and t a natural number. The sets which can be written and the union of...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(∗) if...
AbstractThe paper contains some basic results from “dart calculus” of induced subsets. We obtain as ...
AbstractLet X be a finite set of n-melements and suppose t ⩾ 0 is an integer. In 1975, P. Erdös aske...
AbstractLovász asked whether the following is true for each hypergraph H and natural number k:(*) if...
AbstractIn [M. Sonntag, Antimagic vertex labelings of hypergraphs, Discrete Math. 247 (2002) 187–199...
AbstractA hypergraph is called normal if the chromatic index of any partial hypergraph H′ of it coin...
AbstractIn a recent paper, Borowiecki and Lazuka showed that h-hypergraphs having the property that ...
AbstractLet Gn be a complete transitively directed graph with n + 1 vertices v0, v1, …, vn. Let ψ(n)...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractThis paper shows that for any subset S of vertices of the n-dimensional hypercube, ind(S)≤2n...
AbstractCet article regroupe queiques remarques sur les relations d'inclusion entre aretes et ensemb...
DOI
Add to ORKG