Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decomposition of Geometric Set Systems and Graphs   We study two decomposition problems in combinatorial geometry. The first part
deals with the decomposition of multiple coverings of the plane. We say that a
planar set is cover-decomposable if there is a constant m such that any m-fold
covering of the plane with its translates is decomposable into two disjoint
coverings of the whole plane. Pach conjectured that every convex set is
cover-decomposable. We verify his conjecture for polygons. Moreover, if m is
large enough, we prove that any m-fold covering can even be decomposed into k
coverings. Then we show that the situation is exactly the opposite in 3
dimensions, for any polyhedron and any $m$ we construct an m-fold covering of
the space that is not decomposable. We also give constructions that show that
concave polygons are usually not cover-decomposable. We start the first part
with a detailed survey of all results on the cover-decomposability of polygons.
  The second part investigates another geometric partition problem, related to
planar representation of graphs. The slope number of a graph G is the smallest
number s with the property that G has a straight-line drawing with edges of at
most s distinct slopes and with no bends. We examine the slope number of
bounded degree graphs. Our main results are that if the maximum degree is at
least 5, then the slope number tends to infinity as the number of vertices
grows but every graph with maximum degree at most 3 can be embedded with only
five slopes. We also prove that such an embedding exists for the related notion
called slope parameter. Finally, we study the planar slope number, defined only
for planar graphs as the smallest number s with the property that the graph has
a straight-line drawing in the plane without any crossings such that the edges
are segments of only s distinct slopes. We show that the planar slope number of
planar graphs with bounded degree is bounded.

7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
28
The categories of this paper are: alg-geom