Universal Hypergraphs.
In this thesis, we study universal hypergraphs. What are these? Let us start with defining a universal graph as a graph on n vertices that contains each of the many possible graphs of a smaller size k < n as an induced subgraph. A hypergraph is a discrete structure on n vertices in which edges ca...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2011
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/1290 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2481&context=etd |