The randomHyperGraph method follows a backtracking algorithm to generate edges with no inclusions between them. At each step in the recursive tree, randomHyperGraph will make `BranchLimit` attempts to complete its list of edges. Thus, if a hypergraph with `N` edges is required, randomHyperGraph may take `BranchLimit^N` steps before terminating. To be more precise, the method is implemented so that it makes `BranchLimit + L` attempts at level `L` of the recursion. The default value is 3.

- TimeLimit -- optional argument for randomHyperGraph
- randomHyperGraph -- returns a random hypergraph

- randomHyperGraph(...,BranchLimit=>...) -- limit recursive branching in randomHyperGraph

The object BranchLimit is a symbol.