---
tag: DD640Y8FK5
kind: concept
name: Uniform
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section U
    note: adopted
    mention: wikipedia://en/325802#9HSN
    sections: [Summary]
inventory: [YPPV0P9HZD]
---

## Summary

A hypergraph is $k$-uniform when all its edges have $k$ endpoints, and uniform when it is $k$-uniform for some $k$. For instance, ordinary graphs are the same as $2$-uniform hypergraphs.