output
19942026
most citedBrownian distance covariance

857 citations

Showing 2009 · math.COShow all

6 papers · 2 filters

math.CO2009

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Morić +1

By a polygonization of a finite point set in the plane we understand a simple polygon having as the set of its vertices. Let and be sets of blue and red points, res…

math.CO2009★ 3 cited

On splitting infinite-fold covers

Márton Elekes, Tamás Mátrai, Lajos Soukup

Let be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of which covers each at least $\ka$ times. What assumptions can ensure that $\iH$ can…

math.CO2009★ 1 cited

Borel oracles. An analytical approach to constant-time algorithms

Gabor Elek, Gabor Lippner

Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…

math.CO2009★ 1 cited

On directed local chromatic number, shift graphs, and Borsuk-like graphs

Gábor Simonyi, Gábor Tardos

We investigate the local chromatic number of shift graphs and prove that it is close to their chromatic number. This implies that the gap between the directed local chromatic numbe…

math.CO2009★ 2 cited

Limits of randomly grown graph sequences

C. Borgs, J. Chayes, L. Lovász +2

Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs,…

math.CO2009

Degree-based graph construction

Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…