33 search results - page 4 / 7 » endm 2008 |
ENDM
2008
13 years 8 months ago
2008
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
ENDM
2008
13 years 8 months ago
2008
This paper shows that a well-known algorithm proposed to compute the canonical polygonal schema of a surface can be transferred onto a 2-dimensional generalized map. We show that ...
ENDM
2008
13 years 8 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
ENDM
2008
13 years 8 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
ENDM
2008
13 years 8 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...