Find link

language:

Find link is a tool written by Edward Betts.

searching for Min-max theorem 14 found (29 total)

Haven (graph theory) (2,133 words) [view diff] exact match in snippet view article

have a haven of order 5, it must have treewidth exactly 3. The same min-max theorem can be generalized to infinite graphs of finite treewidth, with a definition

Jack Edmonds (1,543 words) [view diff] exact match in snippet view article find links to article

proved the matroid intersection theorem, a very general combinatorial min-max theorem which, in modern terms, showed that the matroid intersection problem

Road coloring theorem (676 words) [view diff] exact match in snippet view article find links to article

98, doi:10.1090/memo/0098. Hegde, Rajneesh; Jain, Kamal (2005), "A min-max theorem about the road coloring conjecture", Proc. EuroComb 2005 (PDF), Discrete

Pursuit–evasion (1,322 words) [view diff] exact match in snippet view article find links to article

Co Inc. 2. Seymour, P.; Thomas, R. (1993). "Graph searching, and a min-max theorem for tree-width". Journal of Combinatorial Theory, Series B. 58 (1):

Halin's grid theorem (891 words) [view diff] exact match in snippet view article find links to article

MR 0190031. Seymour, Paul D.; Thomas, Robin (1993), "Graph searching and a min-max theorem for tree-width", Journal of Combinatorial Theory, Series B, 58 (1):

Bramble (graph theory) (955 words) [view diff] exact match in snippet view article

treewidth. Seymour, Paul D.; Thomas, Robin (1993), "Graph searching and a min-max theorem for tree-width", Journal of Combinatorial Theory, Series B, 58 (1):

Hermitian matrix (3,028 words) [view diff] exact match in snippet view article find links to article

_{\max })=\lambda _{\max }.} The Rayleigh quotient is used in the min-max theorem to get exact values of all eigenvalues. It is also used in eigenvalue

Erdős–Pósa theorem (1,324 words) [view diff] exact match in snippet view article find links to article

Min-max theorem in graph theory

Paul Seymour (mathematician) (2,285 words) [view diff] exact match in snippet view article

JSTOR 1990903. Seymour, P.; Thomas, R. (1993). "Graph searching and a min-max theorem for tree-width". Journal of Combinatorial Theory, Series B. 58 (1):

Degeneracy (graph theory) (3,769 words) [view diff] exact match in snippet view article

1007/s00778-019-00587-4, S2CID 85519668 Matula, David W. (1968), "A min-max theorem for graphs with application to graph coloring", SIAM 1968 National

Treewidth (4,569 words) [view diff] exact match in snippet view article find links to article

MR 1050503. Seymour, Paul D.; Thomas, Robin (1993), "Graph searching and a min-max theorem for tree-width", Journal of Combinatorial Theory, Series B, 58 (1):

Greedy coloring (3,887 words) [view diff] exact match in snippet view article find links to article

doi:10.1006/jctb.1996.0030, MR 1385380. Matula, David W. (1968), "A min-max theorem for graphs with application to graph coloring", SIAM 1968 National

Cop-win graph (3,239 words) [view diff] exact match in snippet view article find links to article

1–3. Seymour, Paul D.; Thomas, Robin (1993), "Graph searching and a min-max theorem for tree-width", Journal of Combinatorial Theory, Series B, 58 (1):

Multiplicative weight update method (3,928 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle i} would minimize this payoff. By John Von Neumann's Min-Max Theorem, we obtain: min P max j A ( P , j ) = max Q min i A ( i , Q ) {\displaystyle