Titlebook: Building Bridges; Between Mathematics Martin Grötschel,Gyula O. H. Katona,Gábor Sági Book 2008 Springer-Verlag Berlin Heidelberg 2008 Comb

radionuclides

书目名称Building Bridges影响因子(影响力)




书目名称Building Bridges影响因子(影响力)学科排名




书目名称Building Bridges网络公开度




书目名称Building Bridges网络公开度学科排名




书目名称Building Bridges被引频次




书目名称Building Bridges被引频次学科排名




书目名称Building Bridges年度引用




书目名称Building Bridges年度引用学科排名




书目名称Building Bridges读者反馈




书目名称Building Bridges读者反馈学科排名

牛马之尿

无关紧要

CLEAR

,Surplus of Graphs and the Lovász Local Lemma,×. chessboard, and alternately mark previously unmarked little squares. Maker uses (say) mark . and Breaker uses (say) ., exactly like in Tic-Tac-Toe; Maker’s goal is to achieve a large . in some line, where a “line” means either a row or a column. Let . denote the maximum number of .s (“Maker’s mar

询问

Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries,lane arrangements. This paper explores similar walks on complex hyperplane arrangements. This is achieved by involving certain cell complexes naturally associated with the arrangement. In a particular case this leads to walks on libraries with several shelves..We also show that interval greedoids gi

暗语

Glower

Small Linear Dependencies for Binary Vectors of Low Weight,dependency. Our proof is based on showing that in every graph of average degree at least . log log ., every legal edge coloring produces a cycle in which one of the colors appears either once or twice.} (In both results, . is some constant.) The results proved are used (in a companion work) in refut

compassion

,Plünnecke’s Inequality for Different Summands,size of the sumsets .+..+…+.. for all choices of indices ..,…,... Then we prove the existence of a non-empty subset . of . such that we have good control’ over the size of the sumset .+..+…+... As an application of this result we generalize an inequality of [.] concerning the submultiplicativity of

libertine

贪心

Combinatorial Problems in Chip Design,important and challenging open problems in various areas of chip design. Although the problems are motivated by chip design, they are formulated mathematically; understanding and solving them does not require any knowledge of chip design. We give some partial results and argue why a full resolution