1 citations · 1 across the 4 of their papers we have counts for
8 papers
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…
Helly-type theorems for the ordering of the vertices of a hypergraph
Csaba Biró, Jenő Lehel, Géza Tóth
Let be a complete -uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of is called an {\em…
The equivalence of the Szemerédi and Petruska conjecture and the maximum order of -uniform -critical hypergraphs
André E. Kézdy, Jenő Lehel
Recently we asymptotically resolved the long-standing Szemerédi and Petruska conjecture. Several decades ago Gyárfás et al. observed, via a straightforward but unpublished argument…
The Szemerédi-Petruska conjecture for a few small values
Adam S. Jobson, André E. Kézdy, Jenő Lehel
Let H be a 3-uniform hypergraph of order n with clique number k such that the intersection of all maximum cliques of H is empty. For fixed m=n-k, Szemerédi and Petruska conjectured…
Petruska's question on planar convex sets
Adam S. Jobson, André E. Kézdy, Jenő Lehel +2
Given convex sets in such that no point of the plane is covered by more than of the sets, is it true that there are two among the convex sets whose union contains…
Red-blue clique partitions and (1-1)-transversals
Andras Gyarfas, Jeno Lehel
Motivated by the problem of Gallai on -transversals of -intervals, it was proved by the authors in 1969 that if the edges of a complete graph are colored with red and…