1 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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.CO2014★ 1 cited
An upper bound on the extremal version of Hajnal's triangle-free game
Csaba Biró, Paul Horn, D. Jacob Wildstrom
A game starts with the empty graph on vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a ma…