AbstractFor each n and for each r⩽n−3 we obtain the maximum number of edges of a connected graph with n vertices which cannot be spanned by r disjoint paths. We also obtain all connected graphs which achieve the maximum, of which there are two types
AbstractWe study the problem of finding the maximum number of disjoint uni-color paths in an edge-co...
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that n...
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has...
For each n and for each r6n − 3 we obtain the maximum number of edges of a connected graph with n ve...
For each n and for each r6n − 3 we obtain the maximum number of edges of a connected graph with n ve...
AbstractFor each n and for each r⩽n−3 we obtain the maximum number of edges of a connected graph wit...
Abstract. We determine the maximum number of edges in a connected graph with n vertices if it contai...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
We consider the following problem: Given an integer K and a network G with two distinct vertices s a...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
AbstractLet ex∗ (D;H) be the maximum number of edges in a connected graph with maximum degree D and ...
AbstractLet H be a fixed forbidden graph and let f be a function of n. Denote by RT(n,H,f(n)) the ma...
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
AbstractWe study the problem of finding the maximum number of disjoint uni-color paths in an edge-co...
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that n...
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has...
For each n and for each r6n − 3 we obtain the maximum number of edges of a connected graph with n ve...
For each n and for each r6n − 3 we obtain the maximum number of edges of a connected graph with n ve...
AbstractFor each n and for each r⩽n−3 we obtain the maximum number of edges of a connected graph wit...
Abstract. We determine the maximum number of edges in a connected graph with n vertices if it contai...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
We consider the following problem: Given an integer K and a network G with two distinct vertices s a...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
AbstractLet ex∗ (D;H) be the maximum number of edges in a connected graph with maximum degree D and ...
AbstractLet H be a fixed forbidden graph and let f be a function of n. Denote by RT(n,H,f(n)) the ma...
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
AbstractWe study the problem of finding the maximum number of disjoint uni-color paths in an edge-co...
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that n...
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has...
DOI
Add to ORKG