Abstract
Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs are proved using the eigenvalues of their adjacency matrices.
These graphs enable us to improve previous results on a parallel sorting problem that arises in structural modeling, by describing an explicit algorithm to sortn elements ink time units using\(O(n^{\alpha _k } )\) parallel processors, where, e.g., α2=7/4, α3=8/5, α4=26/17 and α5=22/15.
Our approach also yields several applications to Ramsey Theory and other extremal problems in combinatorics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Abelson, A note on time space tradeoffs for computing continuous functions,Infor. Proc. Letters 8 (1979), 215–217.
M. Ajtai, J. Komlós andE. Szemerédi, Sorting inc logn parallel steps,Combinatorica 3 (1983), 1–9.
N. Alon, Expanders, sorting in rounds and superconcentrators of limited depth,Proc. 17th Annual ACM Symp. on Theory of Computing, Providence, RI (1985), 98–102.
N. Alon, Eigenvalues and expanders,Combinatorica,6 (1986), 83–96.
N. Alon, Z. Galil andV. D. Milman, Better expanders and superconcentrators,J. of Algorithms, to appear.
N. Alon andV. D. Milman, λ1, isoperimetric inequalities for graphs and superconcentrators,J. Combinatorial Theory Ser. B,38 (1985), 73–88.
N. Alon andV. D. Milman, Eigenvalues, expanders and superconcentrators,Proc. 25 th Annual Symp. on Foundations of Comp. Sci., Florida (1984), 320–322.
B. Bollobás,Extremal Graph Theory, Academic Press, London and New York (1978).
N. G. de Bruijn andP. Erdős, On a combinatorial problem,Indagationes Math. 20 (1948), 421–423.
B. Bollobás andP. Hell, Sorting and Graphs, in:Graphs and Order, (I. Rival, ed.) D. Reidel (1985), 169–184.
B. Bollobás andM. Rosenfeld, Sorting in one round,Israel J. Math. 38 (1981), 154–160.
B. Bollobás andA. Thomason, Parallel sorting,Discrete Appl. Math. 6 (1983), 1–11.
F. R. K. Chung, On concentrators, superconcentrators, generalizers, and nonblocking networks,Bell Sys. Tech. J. 58 (1978), 1765–1777.
P. Erdős, Problems and results in Graph Theory,in: Proc. Inter. 4th Conf. on the theory and applications of graphs (G. Chartrand et al. eds.), Kalamazoo, Michigan (1980), pp. 331–341.
P. Erdős, Extremal problems in Number Theory,Combinatorics and Geometry, Proc. Inter. Conf. in Warsaw, 1983, to appear.
P. Erdős andA. Hajnal, On complete topological subgraphs of certain graphs,Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 7 (1964), 143–149.
P. Erdős andA. Rényi, On a problem in the theory of graphs,Publ. Math. Inst. Hungar. Acad. Sci. 7 (1962), 215–235 (in Hungarian).
P. Frankl, V. Rődl andR. M. Wilson, The number of submatrices of given type in a Hadamard martrix,J. of Combinatorial Theory B, to appear.
P. Frankl andR. M. Wilson, Intersection theorems with geometric consequences,Combinatorica 1 (1981), 357–368.
O. Gabber andZ. Galil, Explicit construction of linear sized superconcentrators,J. Comp. and Sys. Sci. 22 (1981), 407–420.
S. Golomb,Shift Register Sequences, Holden Day, Inc., San Francisco, 1967.
R. K. Guy andS. Znam, A problem of Zarankiewicz, in:Recent Progress in Combinatorics (W. T. Tutte, ed.) Academic Press, 1969, 237–243.
M. Hall, Jr.,Combinatorial Theory, Wiley and Sons, New York and London, 1967.
R. Häggkvist andP. Hell, Graphs and parallel comparison algorithms.Congr. Num. 29 (1980), 497–509.
R. Häggkvist andP. Hell, Parallel sorting with constant time for comparisons,SIAM J. Comp. 10, (1981), 465–472.
R. Häggkvist andP. Hell, Sorting and merging in rounds,SIAM J. Alg. and Disc. Meth. 3 (1982), 465–473.
J. Ja’Ja, Time space tradeoffs for some algebraic problems,Proc. 12 th Ann. ACM Symp. on Theory of Computing, 1980, 339–350.
M. Klawe, Non-existence of one-dimensional expanding graphs,Proc. 22 nd Ann. Symp. Found. Comp. Sci. Nashville (1981). 109–113.
T. Lengauer andR. E. Tarjan, Asymptotically tight bounds on time space trade-offs in a pebble game,J. ACM 29 (1982), 1087–1130.
G. A. Margulis, Explicit constructions of concentrators,Prob. Per. Infor. 9 (1973), 71–80, (English translation inProblems of Infor. Trans. (1975), 325–332).
R. Meshuluam, A geometric construction of a superconcentrator of depth 2,preprint.
M. Pinsker, On the complexity of a concentrator,7th International Teletraffic Conference, Stockholm, June 1973, 318/1–318/4.
N. Pippenger, Superconcentrators,SIAM J. Computing 6 (1977), 298–304.
N. Pippenger, Advances in pebbling, Internat.Colloq. on Autom. Lang. and Prog. 9 (1982), 407–417.
N. Pippenger, Explicit construction of highly expanding graphs,preprint.
W. J. Paul, R. E. Tarjan andJ. R. Celoni, Space bounds for a game on graphs,Math. Sys. Theory 20 (1977), 239–251.
S. Scheele,Final report to office of environmental education. Dept. of Health, Education and Welfare, Social Engineering Technology, Los Angeles, CA 1977.
J. Spencer, Asymtotic lower bounds for Ramsey functions,Discrete Math. 20 (1977), 69–76.
R. M. Tanner, Explicit construction of concentrators from generalizedN-gons,SIAM J. Alg. Discr. Meth.,5 (1984), 287–293.
M. Tompa, Time space tradeoffs for computing functions, using connectivity properties of their circuits,J. Comp. and Sys. Sci. 20 (1980), 118–132.
L. G. Valiant, Paralelism in comparison networks.SIAM J. Comp. 4 (1975), 348–355.
L. G. Valiant, Graph theoretic properties in computational complexity,J. Com. and Sys. Sci. 13 (1976), 278–285.
N. Alon, Y. Azar, andU. Vizhkin, Tight complexity bounds for parallel comparison sorting,Proc. 27th FOCS, to appear.
A. Lubotzky, R. Phillips, andP. Sarnak, Ramanujan graphs,to appear.
N. Pippenger, Sorting and selecting in rounds,preprint.