randomHyperGraph -- returns a random hypergraph

Synopsis

• Usage:

  H = randomHyperGraph(R,D)

• Inputs:

  • R, a polynomial ring, which gives the vertex set of H
  • D, a list, of integers that are the cardinalities of the edges of H
• Outputs:

  • H, a hypergraph, a hypergraph with edges E_i each of size D_i. Returns null if none can be found.
• Optional inputs:

  • BranchLimit => ..., -- limit recursive branching in randomHyperGraph
  • TimeLimit => ..., -- limit the running time of randomHyperGraph

Description

i1 : R = QQ[x_1..x_5];

i2 : randomHyperGraph(R,{3,2,4})

i3 : randomHyperGraph(R,{3,2,4})

o3 = HyperGraph{edges => {{x , x , x }, {x , x }, {x , x , x , x }}}
                            4   5   3     1   3     2   1   5   4
                ring => R
                vertices => {x , x , x , x , x }
                              1   2   3   4   5

o3 : HyperGraph

i4 : randomHyperGraph(R,{3,2,4})

i5 : randomHyperGraph(R,{4,4,2,2}) -- impossible, returns null when time/branch limit reached

See also

• randomGraph -- returns a random graph
• randomUniformHyperGraph -- returns a random uniform hypergraph
• BranchLimit -- optional argument for randomHyperGraph
• TimeLimit -- optional argument for randomHyperGraph
• Constructor Overview -- a summary of the many ways of making graphs and hypergraphs