Discrete Methods used in Graph Theory and Linear Programming
The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. Upper and lower bounds are given for the number of edges in a graph to ensure triangles and quadrilaterals respectively, when
