## Abstract

Let*G=(V, E)* be a graph with*n* vertices. The direct product dimension pdim (*G*) (c.f. [10], [12]) is the minimum number*t* such that*G* can be embedded into a product of*t* copies of complete graphs*K*_{n}.

In [10], Lovász, Nešetřil and Pultr determined the direct product dimension of matchings and paths and gave sharp bounds for the product dimension of cycles, all logarithmic in the number of vertices.

Here we prove that pdim (*G*)≤*cd*log*n* for any graph with maximum degree*d* and*n* vertices and show that up to a factor of\(1/\left( {\log d + \log \log \frac{n}{{2d}}} \right)\) this bound is the best possible.

We also study set representations of graphs. Let*G=(V,E)* be a graph and*p*≥1 an integer. A familyF={*A*_{ x },*x*∈*V*} of (not necessarily distinct) sets is called a*p*-intersection representation of*G* if |*A*_{x}↓*A*_{y}|≥*p*⇔{*x,y*}∈*E* for every pair*x, y* of distinct vertices of*G*. Let θ_{ G }(*G*) be the minimum size of |*U*F| taken over all intersection representations of*G*. We also study the parameter θ(*G*)=\(\mathop {\min }\limits_p \)(θ_{ p }(*G*)).

It turns out that these parameters can be bounded in terms of maximum degree and linear density of a graph*G* or its complement\(\bar G\). While for example, θ_{1}(*G*)=|*E(G)*| holds if*G* contains no triangle, N. Alon proved that θ_{1}(*G*)≤*c*Δ(\(\bar G\)) log*n*, where Δ(\(\bar G\)) denotes the maximum degree of\(\bar G\). We extend this by showing that Δ(\(\bar G\)) can be replaced by ϱ(\(\bar G\)), the linear density of\(\bar G\). We also show that this bound is close to best possible as there are graphs with\(\theta _1 (G) \geqslant c_2 \frac{{\Delta ^2 (\bar G)}}{{\log \Delta (G)}}\) log*n*.

*c*not dependent on Δ(\(\bar G\)) or

*n*and show that θ(

*G*)≤

*c*Δ(\(\bar G\)) log

^{2}Δ(\(\bar G\)) log

*n*if

*G*is bipartite. This is, up to the factor 1/log

^{2}Δ(\(\bar G\)) best possible.

Finally, we give an upper bound on θ(*G*) in terms of Δ(*G*) and prove θ(*G*)≤*c*Δ^{2}(*G*) log*n*.

## Mathematics Subject Classification (1991)

05 C## Preview

Unable to display preview. Download preview PDF.

## References

- [1]N. Alon: Covering graphs by the minimum number of equivalence relations.
*Combinatorica*,**6**(3) (1986), 201–206.Google Scholar - [2]M. S. Chung, andD. B. West: The
*p*-intersection number of a complete bipartite graph and orthogonal double coverings of a clique, to appear.Google Scholar - [3]
- [4]P. Erdős, A.W. Goodman, andL. Pósa: The representation of a graph by set intersections,
*Canad. J. of Math.***18**(1966), 106–112.Google Scholar - [5]P. Erdős andL. Lovász: Problems and results on 4-chromatic hypergraphs and some related questions, In:
*Colloquia Mathematica Societatis János Bolyai, 10. Infinite and Finite Sets, Vol. II.*, North-Holland Publishing, 1975.Google Scholar - [6]Z. Füredi: A random representation of the complete bipartite graph, to appear.Google Scholar
- [7]Z. Füredi, andJ. Kahn: On the dimensions of ordered sets of bounded degree,
*Order*,**3**(1986), 15–20.Google Scholar - [8]W. Hoeffding, Probability inequalities for sums of bounded random variables.
*J. of the Amer. Math. Stat. Assoc.***58**(1963), 13–30.Google Scholar - [9]M. S. Jacobson, A. E. Kézdy, andD. B. West: The 2-intersection number of paths and bounded-degree trees, to appear.Google Scholar
- [10]L. Lovász, J. Nešetřil, andA. Pultr: On a product dimension of graphs,
*J. of Combin. Theory, Ser. B*,**29**(1980), 47–67.Google Scholar - [11]T. Luczak, A. Ruciński, andB. Voigt: Ramsey properties of random graphs,
*J. of Combin. Theory, Ser. B*,**56**(1), (1992), 66.Google Scholar - [12]J. Nešetřil, andV. Rödl: A simple proof of the Galvin-Ramsey Property of the class of all finite graphs and a dimension of a graph,
*Discrete Mathematics*,**23**(1978), 49–55.Google Scholar - [13]S. Poljak, andV. Rödl: Orthogonal partitions and covering of graphs,
*Czechoslovak Mathematical Journal*,**30**(105), (1980), 475–485.Google Scholar - [14]J. Reitman, V. Rödl, andE. Šiňajová: On embedding of graphs into Euclidean Spaces of small dimension,
*J. of Combin. Theory, Ser. B***54**(1992).Google Scholar