AbstractWe prove that whenever the edge number of a graph of order n ≥ 517 ensures that it contains every complete graph and every forest with at most n vertices and at most m edges, then the graph contains every graph with at most n vertices and m edges if m < n. The required edge numbers for complete graphs and for forests are derived from Turán′s Theorem and from an earlier result of the author, respectively
AbstractWe consider the following problem. Let t and n be positive integers with n⩾t⩾2. Determine th...
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractWe prove that whenever the edge number of a graph of order n ≥ 517 ensures that it contains ...
AbstractIn this paper we present sufficient edge-number and degree conditions for a graph to contain...
AbstractIn this paper we present sufficient edge-number and degree conditions for a graph to contain...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices whi...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
Turán’s Theorem states that every graphG of edge density ‖G‖/(|G|2)> k−2k−1 contains a complete ...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
AbstractFor a minimally n-connected digraph D, the subgraph spanned by the edges (x, y) with outdegr...
AbstractIn this note we complete an investigation started by Erdős in 1963 that aims to find the str...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
AbstractWe consider the following problem. Let t and n be positive integers with n⩾t⩾2. Determine th...
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractWe prove that whenever the edge number of a graph of order n ≥ 517 ensures that it contains ...
AbstractIn this paper we present sufficient edge-number and degree conditions for a graph to contain...
AbstractIn this paper we present sufficient edge-number and degree conditions for a graph to contain...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices whi...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
Turán’s Theorem states that every graphG of edge density ‖G‖/(|G|2)> k−2k−1 contains a complete ...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
AbstractFor a minimally n-connected digraph D, the subgraph spanned by the edges (x, y) with outdegr...
AbstractIn this note we complete an investigation started by Erdős in 1963 that aims to find the str...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
AbstractWe consider the following problem. Let t and n be positive integers with n⩾t⩾2. Determine th...
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
DOI
Add to ORKG