activity
20232026
most citedThe maximum number of odd cycles in a planar graph

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

collaborators

7 papers

math.MG2026

Isoperimetric Inequalities in the cube and torus

Ben Baker, Joseph Briggs, Manuel Fernandez +1

We prove an exact isoperimetric inequality for cubes and tori under the $\ell_{\infty} metric. As a corollary, we recover the celebrated grid edge-isoperimetric inequality of Bollo…

math.CO2026

A finite victory over de Bruijn-Erdős in interval discrepancy

Jared DeLeo, Owen Henderschedt, Chris Wells

We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until intervals have…

math.DG2026

A discrete view of Gromov's filling area conjecture

Joseph Briggs, Chris Wells

A compact metric surface isometrically fills a closed metric curve if and for every ; that is, does not introduc…

math.AT2024

Facets in the Vietoris--Rips complexes of hypercubes

Joseph Briggs, Ziqin Feng, Chris Wells

In this paper, we investigate the facets of the Vietoris--Rips complex where denotes the -dimensional hypercube. We are particularly interested in t…

math.CO2024

Frogs, hats and common subsequences

Joseph Briggs, Alex Parker, Coy Schwieder +1

Write to mean the -letter word obtained by repeating a fixed word and let denote a uniformly random -letter word sampled from the same alphabet as . We…

math.CO2024

Phase transitions in isoperimetric problems on the integers

Joseph Briggs, Chris Wells

Barber and Erde asked the following question: if generates as an additive group, then must the extremal sets for the vertex/edge-isoperimetric inequality on the C…

math.CO2023★ 2 cited

The maximum number of odd cycles in a planar graph

Emily Heath, Ryan R. Martin, Chris Wells

How many copies of a fixed odd cycle, , can a planar graph contain? We answer this question asymptotically for and prove a bound which is tight up to a fa…