3 citations · 5 across the 4 of their papers we have counts for
6 papers
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…
On a conjecture of Szemerédi and Petruska
Adam S. Jobson, André E. Kézdy, Tim Pervenecki
Consider a -uniform hypergraph of order with clique number such that the intersection of all its -cliques is empty. Szemerédi and Petruska proved , for…
Escaping from the corner of a grid by edge disjoint paths
Adam S. Jobson, André E. Kézdy, Jenő Lehel
Let be a finite subgraph of the integer grid in the plane, and let be a set of pairs of distinct vertices in , called `terminal pairs'. Escaping a subset $X\subset T…
Escaping from a quadrant of the grid by edge disjoint paths
Adam S. Jobson, André E. Kézdy, Jenő Lehel
Let be the Cartesian product of two finite paths, called a grid, and let be the set of eight distinct vertices of , called terminals. Assume that is partitioned into…
The grid is -path-pairable
Adam S. Jobson, André E. Kézdy, Jenő Lehel
Let be the grid, the Cartesian product of two paths of six vertices. Let be the set of eight distinct vertices of , called terminals, and assume…