An inequality relating the size and order of a simple graph to the average number of triangles containing a fixed edge is proven. It is shown that the only graphs for which equality holds in this inequality are the Turin graphs with the same number of vertices in each partite set
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
We prove the following extension of Turán's theorem, conjectured by Erdös. Let tr(n) be the number o...
The main theorem gives a class of inequalities concerning finite hypergraphs with a fixed number of ...
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier res...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. I...
Let f(r)(n;k,s) denote the smallest t for which every r-graph with n vertices and t r-tuples contain...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows t...
AbstractWe consider an extremal problem for directed graphs which is closely related to Turán's theo...
In this note we complete an investigation started by Erdo{double acute}s in 1963 that aims to find t...
We prove a selection of results from different areas of extremal combinatorics, including complete o...
Turán’s Theorem states that every graphG of edge density ‖G‖/(|G|2)> k−2k−1 contains a complete ...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
We prove the following extension of Turán's theorem, conjectured by Erdös. Let tr(n) be the number o...
The main theorem gives a class of inequalities concerning finite hypergraphs with a fixed number of ...
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier res...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. I...
Let f(r)(n;k,s) denote the smallest t for which every r-graph with n vertices and t r-tuples contain...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows t...
AbstractWe consider an extremal problem for directed graphs which is closely related to Turán's theo...
In this note we complete an investigation started by Erdo{double acute}s in 1963 that aims to find t...
We prove a selection of results from different areas of extremal combinatorics, including complete o...
Turán’s Theorem states that every graphG of edge density ‖G‖/(|G|2)> k−2k−1 contains a complete ...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
We prove the following extension of Turán's theorem, conjectured by Erdös. Let tr(n) be the number o...