Linked from

The 15 pages that link to Hypergraph, each with the reason it gives.

• Graph theoryCompared with: Ordinary graph edges connect pairs, while hyperedges can represent group relationships directly.

• Graph (discrete mathematics)Compared with: It extends pairwise graph edges to relationships involving three or more vertices.

• Edge (graph theory)Compared with: Its connections can involve more than the two endpoints typical of graph edges.

• Vertex (graph theory)Compared with: A vertex may belong to a single connection involving several other vertices at once.

• MultigraphCompared with: It generalizes edge endpoints rather than allowing repeated ordinary edges.

• Ramsey theoryRelated: Hypergraph Ramsey theory extends coloring guarantees beyond pairs of vertices.

• Simple graphCompared with: Its edges can represent relationships more complex than a simple graph's vertex pairs.

• Weighted graphCompared with: It changes what an edge connects, whereas weighting changes the value attached to an edge.

• Undirected graphCompared with: Ordinary undirected edges connect exactly two endpoints; hyperedges need not.

• Ramsey's theoremRelated: Fixed-size subsets can be treated as the edges of a uniform hypergraph.

• Erdős–Rado theoremRelated: Colorings of finite subsets can be viewed as colorings of hyperedges.

• Lovász local lemmaRelated: The motivating coloring problem concerned avoiding monochromatic edges in a hypergraph.

• Erdős–Faber–Lovász conjectureNarrower topic: The graphs can be viewed as complete hyperedges whose pairwise intersections contain at most one vertex.

• Directed networkCompared with: Its links may join groups of nodes rather than oriented pairs.

• Multilayer and multiplex networksCompared with: Hyperedges represent group interactions, whereas layers distinguish multiple network relations or contexts.