D-interval hypergraph
Summary
In graph theory, a -interval hypergraph is a kind of a hypergraph constructed using intervals of real lines. The parameter is a positive integer. The vertices of a -interval hypergraph are the points of disjoint lines (thus there are uncountably many vertices). The edges of the graph are -tuples of intervals, one interval in every real line.
Further reading
- Wikipedia, page 65615982, revision 1292748286, D-interval hypergraph. adopted
About this page
| Tag | 36XXAY0WXK |
|---|---|
| URI | m2://36XXAY0WXK |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.