2 citations · 4 across the 3 of their papers we have counts for
4 papers
On a topological Erdős similarity problem
John Gallagher, Chun-Kit Lai, Eric Weber
A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erdős proposed…
A Proof of the Strict Monotone 5-step Conjecture
J. Mackenzie Gallagher, Walter D. Morris
A computer search through the oriented matroid programs with dimension 5 and 10 facets shows that the maximum strictly monotone diameter is 5. Thus . This enumerati…
Tail diameter upper bounds for polytopes and polyhedra
J. Mackenzie Gallagher, Edward D. Kim
In 1992, Kalai and Kleitman proved a quasipolynomial upper bound on the diameters of convex polyhedra. Todd and Sukegawa-Kitahara proved tail-quasipolynomial bounds on the diameter…
An improved upper bound on the diameters of subset partition graphs
J. Mackenzie Gallagher, Edward D. Kim
In 1992, Kalai and Kleitman proved the first subexponential upper bound for the diameters of convex polyhedra. Eisenbrand et al. proved this bound holds for connected layer familie…