8 citations · 10 across the 12 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Optimally reconstructing caterpillars
Zach Hunter
For a graph , the -deck of is the multiset of induced subgraphs on having vertices. Recently, Groenland et al. proved that any tree can be reconstructed fro…
math.CO2021
Improved lower bounds for van der Waerden numbers
Zach Hunter
Recently, Ben Green proved that the two-color van der Waerden number is bounded from below by where $b_0(k) = c_0\left(\frac{\log k }{\log \log k}\right)^{1/3…
math.CO2021
An asymptotically tight lower bound for superpatterns with small alphabets
Zach Hunter
A permutation is a -superpattern (or -universal) if it contains each as a pattern. This notion of "superpatterns" can be generalized to words on smaller…