1 citations · 1 across the 5 of their papers we have counts for
5 papers
Bounding mean orders of sub--trees of -trees
Stijn Cambie, Bradley McCoy, Stephan Wagner +1
For a -tree , we prove that the maximum local mean order is attained in a -clique of degree and that it is not more than twice the global mean order. We also bound the…
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy +2
Let be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if is self-overlapping by geometrically constructing a combinatorial word fro…
Trees maximizing the number of almost-perfect matchings
Stijn Cambie, Bradley McCoy, Gunjan Sharma +2
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the numbe…
Catching Polygons
Bradley McCoy, Eli Quist, Anna Schenfisch
Consider an arrangement of lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio with $p\…
If You Must Choose Among Your Children, Pick the Right One
Benjamin Holmgren, Bradley McCoy, Brittany Fasy +1
Given a simplicial complex and an injective function from the vertices of to , we consider algorithms that extend to a discrete Morse function on . W…