Professional Documents
Culture Documents
OF BOXES IN Rd
arXiv:1412.8190v2 [math.CO] 18 Jan 2015
Furthermore,
Observation 1. For n k and d 1,
T (n + d, k, 1) T (n, k, 1) = d(k 1).
To simplify the notation let us define, for n k > d 1,
(n, k, d) = t(n k + d, d) + T (n, k d + 1, 1). (4)
Observation 2. For every n k > d 1,
d
(n + d, k, d) (n, k, d) = (d 1)n + k + d.
2
Proof. (n + d, k, d) (n, k, d) = t((n + d k) + d, d) t(n k +
d, d)) + T (n + d, k d + 1, 1) T (n, k d + 1, 1). So, by Lemma 2 and
Observation 1, (n + d, k, d) (n, k, d) = (d 1)(n k + d) + d2 +
d(k d) = (d 1)n + k + d2 d.
Proposition 1. For every k > d 1 and 0 s < d,
k+s
(k + s, k, d) = t(k + s, k) = s.
2
4 A. MARTINEZ-PEREZ, L. MONTEJANO AND D. OLIVEROS
4. Semi-algebraic Graphs
Definition. A graph G is semi-algebraic if its vertices are represented
by a set of points in P Rd and its edges are defined as pairs of points
(p, q) P P that satisfy a Boolean combination of a fixed number of
polynomial equations and inequalities in 2d-coordinates. For example,
the intersection graph of a finite family of boxes in Rd is semi-algebraic.
An equipartition of a finite set is a partition of the set into subsets
whose sizes differ by at most one.
Theorem 3 (FoxGromovLafforgueNaorPach [5]). Given >
0, there is K() such that if k K(), the following statement is true.
For any n-vertex semi-algebraic graph G, there is an equipartiton of
the set of vertices V (G) into k classes such that, with the exception of
at most a fraction of all pairs of classes, any two classes are either
completely connected in G or no edge of G runs between them.
As a corollary we obtain a fractional ErdosStone theorem (see
[3]) for the family of semi-algebraic graphs. That is;
Theorem 4. Given > 0, there is () > 0 such that if G is a semi-
2
algebraic graph with n vertices and more than (1 1d + ) n2 edges,
G contains a complete (d + 1)-partite subgraph, with each class being
almost the same size ()n (a Turan graph).
EXTREMAL RESULTS ON INTERSECTION GRAPHS OF BOXES IN Rd 7
5. Acknowledgements
The second and third author wish to acknowledge support by CONA-
CyT under project 166306, and the support of PAPIIT under project
IN112614 and IN101912 respectively. The first author was partially
supported by MTM 2012-30719.
References
[1] I. Barany, F. Fodor, A. Martinez Perez, L. Montejano, D. Oliveros and A. Por.
A fractional Helly theorem for boxes. Computational Geometry 48 No. 3 (2015),
221224.
[2] L. Danzer, B. Grunbaum and V. Klee. Hellys theorem and its relatives, Proc.
Sympos. Pure Math., Vol. VII, Amer. Math. Soc., Providence, R.I. (1963), 101
180.
[3] R. Diestel. Graph Theory. Graduate Texts in Mathematics, Vol. 173, Springer,
Heidelberg, 2010.
[4] M. Katchalski and A.C. Liu, A problem in geometry in Rn . Proc. Amer. Math.
Soc. 75 (1979) 284288.
[5] J. Fox, M. Gromov, V. Lafforgue, A. Naor, and J. Pach. Overlap properties
of geometric expanders. To appear in Journal fur die reine angewandte Mathe-
matik. arXiv:1005.1392 [math.CO]
[6] J. Fox, J. Pach, A. Sheffer, A. Suk and J. Zahl. A semi-algebraic version of
Zarankiewiczs problem. arXiv:1406.5705v1 [math.CO].
8 A. MARTINEZ-PEREZ, L. MONTEJANO AND D. OLIVEROS
[7] J.S. Roberts. On the boxicity and cubicity of a graph. In: W.T. Tutte (ed.)
Recent Progress in Combinatorics. Academic Press (1969), 301310.