A. Jobson

activity

20152020

most citedAll minor-minimal apex obstructions with connectivity two

6 citations · 11 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2020

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…

math.CO2019

Petruska's question on planar convex sets

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

Given $2 k - 1$ convex sets in $R^{2}$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains…

math.CO2019★ 1 cited

On a conjecture of Szemerédi and Petruska

Adam S. Jobson, André E. Kézdy, Tim Pervenecki

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.CO2018★ 6 cited

All minor-minimal apex obstructions with connectivity two

Adam S. Jobson, André E. Kézdy

A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of mino…

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…

math.CO2015

Variations on Narrow Dots-and-Boxes and Dots-and-Triangles

Adam Jobson, Levi Sledd, Susan C. White +1

We verify a conjecture of Nowakowski and Ottaway that closed $1 \times n$ Dots-and-Triangles is a first-player win when $n \neq = 2$ . We also prove that in both the open and closed $…

The Szemerédi-Petruska conjecture for a few small values

Petruska's question on planar convex sets

On a conjecture of Szemerédi and Petruska

All minor-minimal apex obstructions with connectivity two

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

Variations on Narrow Dots-and-Boxes and Dots-and-Triangles

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

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