On interval clutters (Q1613531)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On interval clutters |
scientific article; zbMATH DE number 1792452
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On interval clutters |
scientific article; zbMATH DE number 1792452 |
Statements
On interval clutters (English)
0 references
29 August 2002
0 references
A hypergraph is called interval hypergraph, if its vertices can be linearly order that every edge is a consecutive set of vertices. Some thirty years back Tucker gave a characterization of interval hypergraphs in terms of excluded subhypergraphs. This paper characterizes interval clutter hypergraphs in terms of excluded minors and excluded subclutters (a clutter has no two comparable edges).
0 references
interval hypergraph
0 references
excluded minors
0 references
