1 citations · 1 across the 5 of their papers we have counts for
Showing 2024 · math.COShow all
3 papers · 2 filters
math.CO2024
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…
math.CO2024★ 1 cited
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…
math.CO2024
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…