- matching theorem
- мат. теорема о паросочетаниях
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
matching — 1. adjective /ˈmætʃɪŋ/ The same as another; sharing the same design. A matching set of furniture 2. noun /ˈmætʃɪŋ/ A set of independent edges in a given graph, i.e. a set of edges which do not intersect: so called because pairs of vertices are… … Wiktionary
Matching (Graphentheorie) — Die Theorie um das Finden von Matchings in Graphen ist in der diskreten Mathematik ein umfangreiches Teilgebiet, das in die Graphentheorie eingeordnet wird. Folgende Situation wird dabei betrachtet: Gegeben eine Menge von Dingen und zu diesen… … Deutsch Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Matching pennies — This article is about the two person game. For the confidence trick, see coin matching game. Heads Tails Heads +1, −1 −1, +1 … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
Hall's marriage theorem — In mathematics, Hall s marriage theorem is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935). Contents 1 Definitions and … Wikipedia
Impedance matching — In electronics, impedance matching is the practice of designing the input impedance of an electrical load (or the output impedance of its corresponding signal source) to maximize the power transfer and/or minimize reflections from the load.… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
Maximum power transfer theorem — In electrical engineering, the maximum power transfer theorem states that, to obtain maximum external power from a source with a finite internal resistance, the resistance of the load must be equal to the resistance of the source as viewed from… … Wikipedia
Maximum power theorem — In electrical engineering, the maximum power (transfer) theorem states that, to obtain maximum external power from a source with a finite internal resistance, the resistance of the load must be made the same as that of the source. It is claimed… … Wikipedia
Marriage theorem — In mathematics, the marriage theorem (1935), usually credited to mathematician Philip Hall, is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of subsets.Formally, let S = { S … Wikipedia