output
19992026
most citedSparsistency and rates of convergence in large covariance matrix estimation

421 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2011 · math.COShow all

6 papers · 2 filters

math.CO2011★ 19 cited

Generalised k-Steiner Tree Problems in Normed Planes

Marcus N. Brazil, Charl J. Ras, Konrad J. Swanepoel +1

The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Pa…

math.CO2011

An improved error term for minimum H-decompositions of graphs

Peter Allen, Julia Böttcher, Yury Person

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let ϕ_H(n) denote the minimum number p such that any n-vertex G admits such a p…

math.CO2011

Favourite distances in high dimensions

Konrad J. Swanepoel

Let be a set of points in -dimensional Euclidean space. Assign to each an arbitrary distance . Let denote the number of points in at dist…

math.CO2011

The Reversal Ratio of a Poset

Graham Brightwell, Mitchel T. Keller

Felsner and Reuter introduced the linear extension diameter of a partially ordered set , denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear ex…

math.CO2011★ 2 cited

Some Properties of Strongly Regular Graphs

Norman Biggs

An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The…

math.CO2011★ 20 cited

Fire Containment in Planar Graphs

Louis Esperet, Jan van den Heuvel, Frédéric Maffray +1

In a graph , a fire starts at some vertex. At every time step, firefighters can protect up to vertices, and then the fire spreads to all unprotected neighbours. The -surv…