论文信息 - The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems - 字舞流文

The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems

In this lecture we are concerned with the use of linear programming duality to prove combinatorial theorems, and the role played in such investigations by ummodular matrices and related concepts.

[1] A. J. Hoffman,et al. Local Unimodularity in the Matching Polytope , 1978 .

[2] Curtis Greene. Some Partitions Associated with a Partially Ordered Set , 1976, J. Comb. Theory, Ser. A.

[3] D. R. Fulkerson,et al. On balanced matrices , 1974 .

[4] A. Hoffman. On lattice polyhedra III: Blockers and anti-blockers of lattice clutters , 1978 .

[5] Manfred W. Padberg,et al. Perfect zero–one matrices , 1974, Math. Program..

[6] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[7] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[8] Alan J. Hoffman,et al. A generalization of max flow—min cut , 1974, Math. Program..

[9] László Lovász,et al. Certain Duality Principles in Integer Programming , 1977 .

[10] Daniel J. Kleitman,et al. The Structure of Sperner k-Families , 1976, J. Comb. Theory, Ser. A.

[11] A. Hoffman. Total unimodularity and combinatorial theorems , 1976 .