most citedBounded-Degree Graphs have Arbitrarily Large Geometric Thickness

10 citations

7 papers

math.CO2005

Some composition determinants

J. M. Brunat, C. Krattenthaler, A. Lascoux +1

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in t…

math.CO2005

Drawing a Graph in a Hypercube

David R. Wood

A -dimensional hypercube drawing of a graph represents the vertices by distinct points in , such that the line-segments representing the edges do not cross. We study…

math.CO200510 cited

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

Janos Barat, Jiri Matousek, David R. Wood

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separa…

math.NT2005

On the critical pair theory in Z/pZ

Yahya Ould Hamidoune, Oriol Serra, Gilles Zemor

Let A and B be subsets of Z/pZ such that |A+B| < |A|+|B|+2. We prove that, if |A|>3, |B|>4, |A+B|<p-4 and p > 52, then A and B are included in arithmetic progressions with the same…

math.CO20052 cited

Induced Subgraphs of Bounded Degree and Bounded Treewidth

Prosenjit Bose, Vida Dujmovic, David R. Wood

We prove that for all and , every graph with treewidth at most has a `large' induced subgraph , where has treewidth at most and every v…

cs.CG2005

Point set stratification and Delaunay depth

Manuel Abellanas, Mercè Claverol, Ferran Hurtado

In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth funct…