2 citations · 7 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
Reconstructing random pictures
Bhargav Narayanan, Corrine Yap
Given a random binary picture of size , i.e., an grid filled with zeros and ones uniformly at random, when is it possible to reconstruct from its -dec…
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…
Tower Gaps in Multicolour Ramsey Numbers
Quentin Dubroff, António Girão, Eoin Hurley +1
Resolving a problem of Conlon, Fox, and Rödl, we construct a family of hypergraphs with arbitrarily large tower height separation between their -colour and -colour Ramsey num…
Simplicial homeomorphs and trace-bounded hypergraphs
Jason Long, Bhargav Narayanan, Corrine Yap
Our first main result is a uniform bound, in every dimension , on the topological Turán numbers of -dimensional simplicial complexes: for each …
Properties for the Frechet Mean in Billera-Holmes-Vogtmann Treespace
Maria Anaya, Olga Anipchenko-Ulaj, Aisha Ashfaq +9
The Billera-Holmes-Vogtmann (BHV) space of weighted trees can be embedded in Euclidean space, but the extrinsic Euclidean mean often lies outside of treespace. Sturm showed that th…