View Proposal #119
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 119 |
|---|---|
| First Name | Christopher |
| Last Name | French |
| Institution | Grinnell College |
| Speaker Category | faculty |
| Title of Talk | Graphs of Polytopes |
| Abstract | A polytope is a bounded intersection of half-spaces in R^n. The vertices and edges of a polytope form a graph. The graph of a 3 dimensional polytope is planar, since the surface of the polytope is homeomorphic to a sphere. It follows that such graphs cannot have K_5 minors. We generalize this fact, showing that graphs of n-dimensional polytopes cannot have K_{n+2} minors. |
| Subject area(s) | convex geometry |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | N |
| Bringing a laptop? | N |
| Overhead Needed? | Y |
| Software requests | |
| Special Needs | |
| Date Submitted | 3/1/2005 |
| Year | 2005 |