We determine the minimum number of edges in a connected r-graph with covering number α and characterize the extremal r-graphs, when α≡1 (mod r-1). © 1981 Academic Press, Inc
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
A set A of vertices in an r-uniform hypergraph H is covered inH if there is some vertex u∉ A such th...
The following very natural problem was raised by Chung and Erdős in the early 80’s and has since bee...
AbstractWe show that any connected graph with ϵ edges and covering number β satisfies the inequality...
For a hypergraph H, we denote by (i) τ(H) the minimum k such that some set of k vertices meets all t...
The r-expansion G+ of a graph G is the r-uniform hypergraph obtained from G by enlarging each edge o...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete ...
Ryser's Conjecture states that for any r-partite r-uniform hypergraph the vertex cover number is at ...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
International audienceLet $G=(V(G),E(G))$ be a graph. Determining the minimum and/or maximum size $(...
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
We determine the minimum number of edges in a connected r-graph with covering number α and character...
A set A of vertices in an r-uniform hypergraph H is covered inH if there is some vertex u∉ A such th...
The following very natural problem was raised by Chung and Erdős in the early 80’s and has since bee...
AbstractWe show that any connected graph with ϵ edges and covering number β satisfies the inequality...
For a hypergraph H, we denote by (i) τ(H) the minimum k such that some set of k vertices meets all t...
The r-expansion G+ of a graph G is the r-uniform hypergraph obtained from G by enlarging each edge o...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete ...
Ryser's Conjecture states that for any r-partite r-uniform hypergraph the vertex cover number is at ...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
International audienceLet $G=(V(G),E(G))$ be a graph. Determining the minimum and/or maximum size $(...
A cover of a hypergraph is a collection of edges whose union contains all vertices. Let H = (V, E) b...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
DOI
Add to ORKG