extremal problems
1Extremal graph theory — is a branch of mathematics. In the narrow sense, extremal graph theory studies the graphs which are extremal among graphs with a certain property. There are various meanings for the word extremal : with the largest number of edges, the largest… …
2Extremal optimization — (EO) is an optimization heuristic inspired by the Bak Sneppen model of self organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling… …
3Extremal length — In the mathematical theory of conformal and quasiconformal mappings, the extremal length of a collection of curves Gamma is a conformal invariant of Gamma. More specifically, suppose thatD is an open set in the complex plane and Gamma is a… …
4Moment problem — In mathematics, a moment problem arises as the result of trying to invert the mapping that takes a measure μ to the sequences of moments More generally, one may consider for an arbitrary sequence of functions Mn. Contents 1 …
5Möbius ladder — Two views of the Möbius ladder M16. In graph theory, the Möbius ladder Mn is a cubic circulant graph with an even number n of vertices, formed from an n cycle by adding edges (called rungs ) connecting opposite pairs of vertices in the cycle. It… …
6Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …
7Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic …
8Pál Turán — Paul (Pál) Turán Born 18 August 1910 …
9Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …
10Proportional (fair division) — Proportional division or simple fair division is the original and simplest problem in fair division. Fair division problems are also called cake cutting problems. A proportional division of a cake between N people would ensure each of them got at …
