Jump to content

Extremal graph theory

From Wikipedia, the free encyclopedia
The Turán graph T(n,r) is an example of an extremal graph. It has the maximum possible number of edges for a graph on n vertices without (r + 1)-cliques. This is T(13,4).

Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local substructure. [1] Results in extremal graph theory deal with quantitative connections between various graph properties, both global (such as the number of vertices and edges) and local (such as the existence of specific subgraphs), and problems in extremal graph theory can often be formulated as optimization problems: how big or small a parameter of a graph can be, given some constraints that the graph has to satisfy? [2] A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects of study in extremal graph theory.

Extremal graph theory is closely related to fields such as Ramsey theory, spectral graph theory, computational complexity theory, and additive combinatorics, and frequently employs the probabilistic method.



Extremal graph theory, in its strictest sense, is a branch of graph theory developed and loved by Hungarians.

Bollobás (2004) [3]

Mantel's Theorem (1907) and Turán's Theorem (1941) were some of the first milestones in the study of extremal graph theory. [4] In particular, Turán's theorem would later on become a motivation for the finding of results such as the Erdős–Stone theorem (1946).[1] This result is surprising because it connects the chromatic number with the maximal number of edges in an -free graph. An alternative proof of Erdős–Stone was given in 1975, and utilised the Szemerédi regularity lemma, an essential technique in the resolution of extremal graph theory problems.[4]

Topics and concepts


Graph coloring

The Petersen graph has chromatic number 3.

A proper (vertex) coloring of a graph is a coloring of the vertices of such that no two adjacent vertices have the same color. The minimum number of colors needed to properly color is called the chromatic number of , denoted . Determining the chromatic number of specific graphs is a fundamental question in extremal graph theory, because many problems in the area and related areas can be formulated in terms of graph coloring.[2]

Two simple lower bounds to the chromatic number of a graph is given by the clique number —all vertices of a clique must have distinct colors—and by , where is the independence number, because the set of vertices with a given color must form an independent set.

A greedy coloring gives the upper bound , where is the maximum degree of . When is not an odd cycle or a clique, Brooks' theorem states that the upper bound can be reduced to . When is a planar graph, the four-color theorem states that has chromatic number at most four.

In general, determining whether a given graph has a coloring with a prescribed number of colors is known to be NP-hard.

In addition to vertex coloring, other types of coloring are also studied, such as edge colorings. The chromatic index of a graph is the minimum number of colors in a proper edge-coloring of a graph, and Vizing's theorem states that the chromatic index of a graph is either or .

Forbidden subgraphs


The forbidden subgraph problem is one of the central problems in extremal graph theory. Given a graph , the forbidden subgraph problem asks for the maximal number of edges in an -vertex graph that does not contain a subgraph isomorphic to .

When is a complete graph, Turán's theorem gives an exact value for and characterizes all graphs attaining this maximum; such graphs are known as Turán graphs. For non-bipartite graphs , the Erdős–Stone theorem gives an asymptotic value of in terms of the chromatic number of . The problem of determining the asymptotics of when is a bipartite graph is open; when is a complete bipartite graph, this is known as the Zarankiewicz problem.

Homomorphism density


The homomorphism density of a graph in a graph describes the probability that a randomly chosen map from the vertex set of to the vertex set of is also a graph homomorphism. It is closely related to the subgraph density, which describes how often a graph is found as a subgraph of .

The forbidden subgraph problem can be restated as maximizing the edge density of a graph with -density zero, and this naturally leads to generalization in the form of graph homomorphism inequalities, which are inequalities relating for various graphs . By extending the homomorphism density to graphons, which are objects that arise as a limit of dense graphs, the graph homomorphism density can be written in the form of integrals, and inequalities such as the Cauchy-Schwarz inequality and Hölder's inequality can be used to derive homomorphism inequalities.

A major open problem relating homomorphism densities is Sidorenko's conjecture, which states a tight lower bound on the homomorphism density of a bipartite graph in a graph in terms of the edge density of .

Graph regularity

regularity partition
The edges between parts in a regular partition behave in a "random-like" fashion.

Szemerédi's regularity lemma states that all graphs are 'regular' in the following sense: the vertex set of any given graph can be partitioned into a bounded number of parts such that the bipartite graph between most pairs of parts behave like random bipartite graphs.[2] This partition gives a structural approximation to the original graph, which reveals information about the properties of the original graph.

The regularity lemma is a central result in extremal graph theory, and also has numerous applications in the adjacent fields of additive combinatorics and computational complexity theory. In addition to (Szemerédi) regularity, closely related notions of graph regularity such as strong regularity and Frieze-Kannan weak regularity have also been studied, as well as extensions of regularity to hypergraphs.

Applications of graph regularity often utilize forms of counting lemmas and removal lemmas. In simplest forms, the graph counting lemma uses regularity between pairs of parts in a regular partition to approximate the number of subgraphs, and the graph removal lemma states that given a graph with few copies of a given subgraph, we can remove a small number of edges to eliminate all copies of the subgraph.

See also


Related fields

Techniques and methods

Theorems and conjectures (in addition to ones mentioned above)


  1. ^ a b Diestel, Reinhard (2010), Graph Theory (4th ed.), Berlin, New York: Springer-Verlag, pp. 169–198, ISBN 978-3-642-14278-9, archived from the original on 2017-05-28, retrieved 2013-11-18
  2. ^ a b c Alon, Noga; Krivelevich, Michael (2008). "Extremal and Probabilistic Combinatorics". In Gowers, Timothy; Barrow-Green, June; Leader, Imre (eds.). The Princeton Companion to Mathematics. Princeton, New Jersey: Princeton University Press. pp. 562–575. doi:10.1515/9781400830398. ISBN 978-0-691-11880-2. JSTOR j.ctt7sd01. LCCN 2008020450. MR 2467561. OCLC 227205932. OL 19327100M. Zbl 1242.00016.
  3. ^ Bollobás, Béla (2004), Extremal Graph Theory, New York: Dover Publications, ISBN 978-0-486-43596-1
  4. ^ a b Bollobás, Béla (1998), Modern Graph Theory, Berlin, New York: Springer-Verlag, pp. 103–144, ISBN 978-0-387-98491-9