75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. Ziegler

First Page		Document Content
Date: 2012-07-25 10:24:45 Convex geometry Polytopes Linear programming Operations research Polyhedral combinatorics Hirsch conjecture KleeMinty cube Simplex algorithm Convex polytope Simplex 4-polytope Simple polytope		75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. Ziegler Add to Reading List Source URL: www.math.uiuc.edu Download Document from Source Website File Size: 608,09 KB Share Document on Facebook

	SOME PROBLEMS MOTIVATED BY THE NOTION OF THRESHOLD GRAPHS MURALI K. SRINIVASAN Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshold graphs, degree sequences of graphs and DocID: 1uO9A - View Document
	POLYMATROID SUBDIVISION ALEX FINK These notes are a draft exposition, written for a portion of Jack Edmonds’ minicourse Existential Polytime and Polyhedral Combinatorics at the London Taught Course Center in June 2015. DocID: 1uCMM - View Document
	181 Documenta Math. Edmonds, Matching and the Birth of Polyhedral Combinatorics DocID: 1s9cj - View Document
	75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. Ziegler DocID: 1rnGl - View Document
	Combinatorial graph theory and connectivity Keith Briggs more.btexact.com/people/briggsk2/cgt.html Mathematics of Networks 2004 July DocID: 1qy0E - View Document