1 citations · 1 across the 3 of their papers we have counts for
4 papers
Hilbert fragments
Csaba Biró, André E. Kézdy, Jen\Ho Lehel
In earlier work, we proved that the length polyhedron of an interval order has a unique Hilbert basis and that every element of this basis is a binary vector. The supports of these…
The Schrijver system of the length polyhedron of an interval order
André E. Kézdy, Jenő Lehel
The length polyhedron of an interval order is the convex hull of integer vectors representing the interval lengths in possible interval representations of in which all inte…
Two-count interval representation of a permutation
Csaba Biró, André E. Kézdy, Jenő Lehel
The interval count problem, a classical question in the study of interval orders, was introduced by Ronald Graham in the 1980s. This problem asks: given an interval order , what…
The length polyhedron of an interval order
Csaba Biró, André E. Kézdy, Jenő Lehel
The length polyhedron of an interval order is the convex hull of integral vectors representing the interval lengths in interval representations of . This polyhedron ha…