Abstract. We will examine the maximal number of edges of a graph on p vertices of order dimension 4. We will show that the lower bound for this number is greater than 3 8 p2 + 2p − 13. In particular the Turán-4 graph on p vertices does not have the maximal number of edges among the graphs of order dimension 4. 1
We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integ...
AbstractWe consider the following problem as a generalization of that solved by Tura´n's theorem. Le...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractThe object of this paper is to determine the minimum possible number of edges for a graph of...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
By extremal number ex(n;t ) = ex(n;{C₃, C₄, ..., Ct}) we denote the maximum size (that is, number of...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
For a graph H, the extremal number ex(n,H) is the maximum number of edges in a graph of order n not ...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integ...
AbstractWe consider the following problem as a generalization of that solved by Tura´n's theorem. Le...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractThe object of this paper is to determine the minimum possible number of edges for a graph of...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
By extremal number ex(n;t ) = ex(n;{C₃, C₄, ..., Ct}) we denote the maximum size (that is, number of...
AbstractWe consider a new type of extremal hypergraph problem: given an r-graph F and an integer k≥2...
For a graph H, the extremal number ex(n,H) is the maximum number of edges in a graph of order n not ...
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integ...
AbstractWe consider the following problem as a generalization of that solved by Tura´n's theorem. Le...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
DOI
Add to ORKG