JenHo Lehel

activity

20172026

most citedEscaping from the corner of a grid by edge disjoint paths

3 citations · 4 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2026

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…

math.CO2024

The Schrijver system of the length polyhedron of an interval order

André E. Kézdy, Jenő Lehel

The length polyhedron of an interval order $P$ is the convex hull of integer vectors representing the interval lengths in possible interval representations of $P$ in which all inte…

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 $P$ , what…

math.CO2022

An asymptotic resolution of a conjecture of Szemerédi and Petruska

André E. Kézdy, Jenő Lehel

Consider a $3$ -uniform hypergraph of order $n$ with clique number $k$ such that the intersection of all its $k$ -cliques is empty. Szemerédi and Petruska proved $n \leq 8 m^{2} + 3 m$ , for…

math.CO2021

On the hollow enclosed by convex sets

Jenő Lehel, Géza Tóth

For $n \leq d$ , a family $F = {C_{0}, C_{1}, \dots, C_{n}}$ of compact convex sets in $R^{d}$ is called an $n$ -critical family provided any $n$ members of $F$ have a non-empty…

math.CO2017★ 3 cited

Escaping from the corner of a grid by edge disjoint paths

Adam S. Jobson, André E. Kézdy, Jenő Lehel

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$ , called `terminal pairs'. Escaping a subset $X\subset T…

math.CO2017

Escaping from a quadrant of the $6 \times 6$ grid by edge disjoint paths

Adam S. Jobson, André E. Kézdy, Jenő Lehel

Let $G$ be the Cartesian product of two finite paths, called a grid, and let $T$ be the set of eight distinct vertices of $G$ , called terminals. Assume that $T$ is partitioned into…

math.CO2017★ 1 cited

The $6 \times 6$ grid is $4$ -path-pairable

Adam S. Jobson, André E. Kézdy, Jenő Lehel

Let $G = P_{6} □ P_{6}$ be the $6 \times 6$ grid, the Cartesian product of two paths of six vertices. Let $T$ be the set of eight distinct vertices of $G$ , called terminals, and assume…

Hilbert fragments

The Schrijver system of the length polyhedron of an interval order

Two-count interval representation of a permutation

An asymptotic resolution of a conjecture of Szemerédi and Petruska

On the hollow enclosed by convex sets

Escaping from the corner of a grid by edge disjoint paths

Escaping from a quadrant of the 6×6 grid by edge disjoint paths

The 6×6 grid is 4-path-pairable

Escaping from a quadrant of the $6 \times 6$ grid by edge disjoint paths

The $6 \times 6$ grid is $4$ -path-pairable