19 citations · 82 across the 27 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
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 .
math.CO2020★ 4 cited
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…