Partitions
A partition theorem due to E. Dauber states that, for an edge-transitive hypergraph, there exists a partition
of the vertex set such that the subhypergraph generated by is transitive for each, and such that
where is the rank of H.
As a corollary, an edge-transitive hypergraph that is not vertex-transitive is bicolorable.
Graph partitioning (and in particular, hypergraph partitioning) has many applications to IC design and parallel computing.
Read more about this topic: Hypergraph
Famous quotes containing the word partitions:
“Walls have cracks and partitions ears.”
—Chinese proverb.
“Great wits are sure to madness near allied,
And thin partitions do their bounds divide.”
—John Dryden (1631–1700)