simplicialComplexToHyperGraph -- makes a (hyper)graph from a simplicial complex

Synopsis

• Usage:

  H = simplicialComplexToHyperGraph(D)

• Inputs:
  • D, a simplicial complex, the input
• Outputs:
  • H, a hypergraph, whose edges are the facets of D

Description

i1 : S = QQ[a..f];

i2 : Delta = simplicialComplex {a*b*c,b*c*d,c*d*e,d*e*f}

o2 = | def cde bcd abc |

o2 : SimplicialComplex

i3 : H = simplicialComplexToHyperGraph Delta

o3 = HyperGraph{edges => {{a, b, c}, {b, c, d}, {c, d, e}, {d, e, f}}}
                ring => S
                vertices => {a, b, c, d, e, f}

o3 : HyperGraph

See also

• hyperGraphToSimplicialComplex -- makes a simplicial complex from a (hyper)graph
• Constructor Overview -- a summary of the many ways of making graphs and hypergraphs