Homogeneous sets in graphs and hypergraphs
A set of vertices in a graph or a hypergraph is called homogeneous if it is independent, that is it does not contain any edge, or if it is complete, that is it contains all possible pairs or subsets of it as edges. We investigate the properties of graphs and hypergraphs in two cases of imposed restr...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Oxford
2017
|
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.748712 |