Jason O’Neill

activity

20172022

collaborators

6 papers

math.CO2022

Odd Covers of Graphs

Calum Buchanan, Alexander Clifton, Eric Culver +4

Given a finite simple graph $G$ , an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and…

math.CO2021

Saturation Problems in Convex Geometric Hypergraphs

Jason O'Neill, Sam Spiro

A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensive…

math.CO2020

A note on $k$ -wise oddtown problems

Jason O'Neill, Jacques Verstraëte

For integers $2 \leq t \leq k$ , we consider a collection of $k$ set families $A_{j} : 1 \leq j \leq k$ where $A_{j} = {A_{j, i} \subseteq [n] : 1 \leq i \leq m}$ …

math.CO2020

Extremal problems for pairs of triangles

Zoltán Füredi, Dhruv Mubayi, Jason O'Neill +1

A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two…

math.CO2018

A generalization of the Bollobás set pairs inequality

Jason O'Neill, Jacques Verstraete

The Bollobás set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \geq k \geq t \geq 2$ , we consider a collection of $k…

math.CO2017

On the poset and asymptotics of Tesler Matrices

Jason O'Neill

Tesler matrices are certain integral matrices counted by the Kostant partition function and have appeared recently in Haglund's study of diagonal harmonics. In 2014, Drew Armstrong…