501 search results - page 3 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
TCS
2002
13 years 5 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
DM
2008
13 years 6 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
COCOA
2010
Springer
13 years 4 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
ENDM
2007
13 years 6 months ago
2007
We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-...
COMGEO
2011
ACM
13 years 1 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...