1 citations · 1 across the 5 of their papers we have counts for
6 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…
Infinite graphs with finite metric dimension
Csaba Biró, Caroline E. Boone, Beth Novick +1
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1)…
Semiorders induced by uniform random points
Csaba Biró, Caroline E. Boone
We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the…
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…
Packing independent cliques into planar graphs
Csaba Biró, Gabriel Collado, Oscar Zamora
The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of pl…