= Extremal graph theory
{wiki=Extremal_graph_theory}
Extremal graph theory is a branch of combinatorial mathematics that studies the extremal properties of graphs. Specifically, it focuses on questions related to the maximal or minimal number of edges in a graph that satisfies certain properties or conditions. The primary goal is often to determine the extremal (that is, maximum or minimum) values for specific parameters of graphs (like the number of edges, number of vertices, etc.) that meet certain constraints, such as containing a particular subgraph or avoiding certain configurations.
Back to article page