Combinatorial problems for graphs and partially ordered sets
This dissertation has three principal components. The first component is about the connections between the dimension of posets and the size of matchings in comparability and incomparability graphs. In 1951, Hiraguchi proved that for any finite poset P, the dimension of P is at most half of the numbe...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/54483 |