London School of Economics and Political Science

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 2019 · math.COShow all

8 papers · 2 filters

math.CO2019

Successive shortest paths in complete graphs with random edge weights

Stefanie Gerke, Balázs F. Mezei, Gregory B. Sorkin

Consider a complete graph $K_{n}$ with edge weights drawn independently from a uniform distribution $U (0, 1)$ . The weight of the shortest (minimum-weight) path $P_{1}$ between two given…

math.CO2019★ 1 cited

Bounding the tripartite-circle crossing number of complete tripartite graphs

Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4

A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…

math.CO2019★ 10 cited

The size-Ramsey number of powers of bounded degree trees

Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka +4

Given a positive integer $s$ , the $s$ -colour size-Ramsey number of a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that,…

math.CO2019★ 3 cited

Uniform Orderings for Generalized Coloring Numbers

Jan van den Heuvel, H. A. Kierstead

The generalized coloring numbers col_r(G) (also denoted by scol_r(G)) and wcol_r(G) of a graph G were introduced by Kierstead and Yang as a generalization of the usual coloring num…

math.CO2019★ 2 cited

The size-Ramsey number of 3-uniform tight paths

Jie Han, Yoshiharu Kohayakawa, Shoham Letzter +2

Given a hypergraph $H$ , the size-Ramsey number $r^_{2} (H)$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that in any colouring…

math.CO2019

The independent set problem is FPT for even-hole-free graphs

Edin Husic, Stephan Thomasse, Nicolas Trotignon

The class of even-hole-free graphs is very similar to the class of perfect graphs, and was indeed a cornerstone in the tools leading to the proof of the Strong Perfect Graph Theore…

math.CO2019

Ordinary hyperspheres and spherical curves

Aaron Lin, Konrad Swanepoel

An ordinary hypersphere of a set of points in real $d$ -space, where no $d + 1$ points lie on a $(d - 2)$ -sphere or a $(d - 2)$ -flat, is a hypersphere (including the degenerate case of a…

math.CO2019★ 4 cited

Decomposing tournaments into paths

Allan Lo, Viresh Patel, Jozef Skokan +1

We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomp…