4 citations · 4 across the 3 of their papers we have counts for
5 papers · 1 filter
A note on the largest induced matching in graphs avoiding a fixed bipartite graph
Ben Lund, Daniel Reichman
We give a simple proof that every -vertex graph -regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size .
On the list recoverability of randomly punctured codes
Ben Lund, Aditya Potukuchi
We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are l…
Perfect matchings and derangements on graphs
Matija Bucic, Pat Devlin, Mo Hendon +2
We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the perman…
A Construction for Difference Sets with Local Properties
Sara Fish, Ben Lund, Adam Sheffer
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set of real numbers such that $|A-A|=n^…
Bisectors and pinned distances
Ben Lund, Giorgis Petridis
We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of…