Random lifts of graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 883-894

  Amit, Alon ^a   Linial, Nathan ^a   Matoušek, Jiří ^b   Rozenman, Eyal ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 34748827952     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Alon Amit and Nathan Linial. Random lifts of graph I: General theory and connectivity. To appear.
2. Alon Amit and Nathan Linial. Random lifts of graphs II: Edgeexpansion. To appear.
3. Dana Anglujn, Local and global properties in network of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.82-93, April 28-30, 1980, Los Angeles, California, United States [doi〉 10.1145/800141.804655]
4. D. Archdeacon , R. B. Richter, On the parity of planar covers, Journal of Graph Theory, v.14 n.2, p.199-204, Jun. 1990 [doi〉10.1002/jgt.3190140208]
5. Hyman Bass and Ravi Kulkarni. Uniform tree lattices. Journal of the Americn Mathematical Society, 3(4):843-902, October 1990.
6. Béla Bollobás, The isoperimetric number of random regular graphs, European Journal of Combinatorics, v.9 n.3, p.241-244, May 1988
7. J. L Gross and T. W. Tucker. Generating all graph coverings by permutation voltage assignments. Discrete Mathematics, 18:273-283, 1977.
8. Jonathan L. Gross , Thomas W. Tucker, Topological graph theory, Wiley-Interscience, New York, NY, 1987
9. Jeong Han Kim. On Brooks' theorem for sparse graphs. Combin. Probab. Comput., 4 (2):97-132, 1995.
10. Frank Thomson Leighton. Finite common coverings of graphs. Journal of Combinatorial Theory Ser. B, 33:231-238, 1982.
11. Alon Amit Nathan Linial and Jill Matousek. Random lifts of graphs III: Independence and chromatic number. To appear.
12. Nathan Linial and Eyal Rozenman. Random lifts of graphs IV: Matching. To appear.
13. Michael J. Fischer , Nancy A. Lynch , Michael Merritt, Easy impossibility proofs for distributed consensus problems, Distributed Computing, v.1 n.1, p.26-39, Jan. 1986 [doi〉10.1007/BF01843568]
14. Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi〉10.1145/3149.214121]
15. Seiya Negami. The spherical genus and virtually planar graphs. Discrete Mathematics, 70:159-168, 1988.
16. John Stallings. Topology of finite graphs. Inventiones Mathematicae, 71:551-565, 1983.
17. John Stillwell. Classical Topology and Combinatorial Group Theory. Springer-Verlag, 1993.