Intersection Graphs and Geometric/Combinatorial Optimization.
Abstract
This project focused on the interaction between geometric objects and combinatorial structures, especially intersection graphs and containment orders. Let sigma denote a family of sets. We call a graph G a sigma-intersection graph provided there is a mapping f: V(G) right arrow sigma with the property that uv is in E(G) exactly when f(u) intersection f(v) not equal empty set. Similarly, we call a partially ordered set P a sigma-containment order provided there is a mapping f : P right arrow sigma so that x <= y exactly when f(x) is a subset contained in f(y). A second theme in the research was the use of random methods and the development of novel models and applications of random graphs, including intermingling the intersection and random graph paradigms.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 13, 1996
- Accession Number
- ADA308575
Entities
People
- Edward R. Scheinerman
Organizations
- Johns Hopkins University