Publication date
May 2001
DOI Publisher
Elsevier Science B.V. ISSN
0012-365XAbstract
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branchings and a theorem of Frank on kernel systems
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branchings and a theorem of Frank on kernel systems
AbstractLet G be a tree and let H be a collection of subgraphs of G, each having at most d connected...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branc...
Edmonds\u27s fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combi...
Edmonds' fundamental theorem on arborescences [4] characterizes the exis-tence of k pairwise ed...
Let us write nt(r) for the minimal integer n such that any t-wise intersecting r-graph ℱ has a kerne...
AbstractWe prove that there is no degree of connectivity which will guarantee that a hypergraph cont...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
AbstractThe Erdös-Ko-Rado theorem states that if F is a family of k-subsets of an n-set no two of wh...
AbstractLet G = (V, A) be a digraph with a root r, and suppose that each arc a of G has integers b(a...
AbstractIn this paper we generalize to NECS's(M), certain results obtained in [2] for NECS's(2), nam...
AbstractWe disprove the following conjecture of Füredi and Seymour:Conjecture. If F is an intersecti...
In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of br...
AbstractLet c(x,y) denote the maximum number of edge-disjoint directed paths joining x to y in the d...
AbstractLet G be a tree and let H be a collection of subgraphs of G, each having at most d connected...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branc...
Edmonds\u27s fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combi...
Edmonds' fundamental theorem on arborescences [4] characterizes the exis-tence of k pairwise ed...
Let us write nt(r) for the minimal integer n such that any t-wise intersecting r-graph ℱ has a kerne...
AbstractWe prove that there is no degree of connectivity which will guarantee that a hypergraph cont...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
AbstractThe Erdös-Ko-Rado theorem states that if F is a family of k-subsets of an n-set no two of wh...
AbstractLet G = (V, A) be a digraph with a root r, and suppose that each arc a of G has integers b(a...
AbstractIn this paper we generalize to NECS's(M), certain results obtained in [2] for NECS's(2), nam...
AbstractWe disprove the following conjecture of Füredi and Seymour:Conjecture. If F is an intersecti...
In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of br...
AbstractLet c(x,y) denote the maximum number of edge-disjoint directed paths joining x to y in the d...
AbstractLet G be a tree and let H be a collection of subgraphs of G, each having at most d connected...
AbstractIn 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the...
AbstractThe main result of this paper is the following theorem: Let G = (X,E) be a digraph without l...
Add to ORKG