Algorithms, Combinatorics and Optimization Seminar

For more information, please visit the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.

Carnegie Mellon University offers an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. This program is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group). (Learn more...)

---

Kevin Milans
West Virginia University
Title: Forbidden Induced Posets in the Boolean Lattice

Abstract: We study an analogue of the classic Turan problem for partially ordered sets, or posets. For a poset P, the induced Turan number is the maximum size of a family of elements in the N-dimensional Boolean lattice that does not contain P as an induced subposet. Boehnlein and Jiang obtained the asymptotics of the induced Turan number for posets whose Hasse diagram is a tree. Not much is known about other posets. We present bounds on the induced Turan number for series-parallel posets and the family of standard examples. This is joint work with Linyuan Lu.

Date: Thursday, September 27, 2012
Time: 3:30 pm
Location: Wean 922-
Submitted by:  Loh