AbstractWe consider the following problem as a generalization of that solved by Tura´n's theorem. Let t and n be positive integers with n⩾t⩾2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,n−t as a subgraph. For n=2t, it is solved by Brualdi and Mellendorf (1994). We solve it for n=2t + 1
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractA graph is 2K2-free if it does not contain an independent pair of edges as an induced subgra...
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...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractWe consider the following problem. Let t and n be positive integers with n⩾t⩾2. Determine th...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractFor 1 ≤ k, 2k < n, and 2 ≤ j ≤ 2k + 1, let f(n, k, j) be the maximum possible number of comp...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractGiven a family L of graphs, set p=p(L)=minL∈Lχ(L)−1 and, for n⩾1, denote by P(n,L) the set o...
AbstractLet ƒ(n,H,X) be the maximal number of edges in a graph with n vertices not containing a subg...
Let σ(n; θ2k+1) denote the class of non-bipartite graphs on n vertices having no θ2k+1- graph and f(...
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractA graph is 2K2-free if it does not contain an independent pair of edges as an induced subgra...
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...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractWe consider the following problem. Let t and n be positive integers with n⩾t⩾2. Determine th...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractFor 1 ≤ k, 2k < n, and 2 ≤ j ≤ 2k + 1, let f(n, k, j) be the maximum possible number of comp...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
AbstractGiven a family L of graphs, set p=p(L)=minL∈Lχ(L)−1 and, for n⩾1, denote by P(n,L) the set o...
AbstractLet ƒ(n,H,X) be the maximal number of edges in a graph with n vertices not containing a subg...
Let σ(n; θ2k+1) denote the class of non-bipartite graphs on n vertices having no θ2k+1- graph and f(...
Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4....
AbstractA graph is 2K2-free if it does not contain an independent pair of edges as an induced subgra...
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...
DOI.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG