On interval clutters (Q1613531)

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).