This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in over five decades of original papers by: T. van Aardenne-Ehrenfest.- R.L. Brooks.- N.G. de Bruijn.- G.F. Clements.- H.H. Crapo.- R.P. Dilworth.- J. Edmonds.- P. Erdos.- L.R. Ford, Jr.- D.R. Fulkerson.- D. Gale.- L. Geissinger.- I.J. Good.- R.L. Graham.- A.W. Hales.- P. Hall.- P.R. Halmos.- R.I. Jewett.- I. Kaplansky.- P.W. Kasteleyn.- G. Katona.- D.J. Kleitman.- K. Leeb.- B. Lindstrom.- L. Lovasz.- D. Lubell.- C. St. J.A. Nash-Williams.- G. Polya.-R. Rado.- F.P. Ramsey.- G.-C. Rota.- B.L. Rothschild.- H.J. Ryser.- C. Schensted.- M.P. Schutzenberger.- R.P. Stanley.- G. Szekeres.- W.T. Tutte.- H.E. Vaughan.- H. Whitney.
评分
评分
评分
评分
pigeonhole principle.的推广Ramsey's theorem(基础是递归,容斥) ;coloring problem for graphs. 的基础工具theory of matroids;matching theory的推广看做minimax combinatorial theorems (network flow theory ) characteristic polynomial的本质根据的是 the Mobius function of a partially ordered set, motivates Stanley's 。
评分pigeonhole principle.的推广Ramsey's theorem(基础是递归,容斥) ;coloring problem for graphs. 的基础工具theory of matroids;matching theory的推广看做minimax combinatorial theorems (network flow theory ) characteristic polynomial的本质根据的是 the Mobius function of a partially ordered set, motivates Stanley's 。
评分pigeonhole principle.的推广Ramsey's theorem(基础是递归,容斥) ;coloring problem for graphs. 的基础工具theory of matroids;matching theory的推广看做minimax combinatorial theorems (network flow theory ) characteristic polynomial的本质根据的是 the Mobius function of a partially ordered set, motivates Stanley's 。
评分pigeonhole principle.的推广Ramsey's theorem(基础是递归,容斥) ;coloring problem for graphs. 的基础工具theory of matroids;matching theory的推广看做minimax combinatorial theorems (network flow theory ) characteristic polynomial的本质根据的是 the Mobius function of a partially ordered set, motivates Stanley's 。
评分pigeonhole principle.的推广Ramsey's theorem(基础是递归,容斥) ;coloring problem for graphs. 的基础工具theory of matroids;matching theory的推广看做minimax combinatorial theorems (network flow theory ) characteristic polynomial的本质根据的是 the Mobius function of a partially ordered set, motivates Stanley's 。
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有