Minors in lifts of graphs

Random Structures and Algorithms

Volumn 29, Issue 2, 2006, Pages 208-225

  Drier, Yotam ^a   Linial, Nathan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748436493     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20100     Document Type: Article

References (15)

1. A. Amit and N. Linial Random Graph Coverings I: General Theory and Graph Connectivity, Combinatorica 22 (2002), 1-18.
2. A. Amit, N. Linial, and J. Matoušek, Random lifts of graphs: Independence and chromatic number, Random Struct Algor 20 (2002), 1-22.
3. A. Amit, N. Linial, J. Matoušek, and E. Rozenman, Random lifts of graphs SODA '01, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001), 883-894.
4. B. Bollobás, P.A. Catlin, and P. Erdös, Hadwiger's Conjecture is True for Almost Every Graph, Eur J Combinator 1 (1980), 195-199.
5. B. Bollobás and A. Thomason, Proof of a Conjecture of Mader Erdós and Hajnal on Topological Complete Subgraphs, Eur J Combinator 19 (1998), 883-887.
6. J. Bosák, Decompositions of Graphs, Kluwer, 1990.
7. P. J. Cameron, Cohomological aspects of two-graphs, Math Z 157 (1977), 101-119.
8. D. G. Corneil and R. A. Mathon (Editors), Geometry and Combinatorics: Selected Works of J.J. Seidel, Academic Press, Boston, 1991.
9. R. P. Gupta, Bounds on the Chromatic and Achromatic Numbers of Complementary Graphs, Recent Progress in Combinatorics W. T. Tutte (Editor), 1969, pp. 229-235.
10. J. Komlós and E. Szemerédi, Topological Cliques in Graphs II, Combinatori Probab Comput 5 (1996), 79-90.
11. A. V. Kostochka, The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz 38 (1982), 37-58, in Russian.
12. J. J. Seidel, A Survey of Two-Graphs, Colloquio Internazionale sulle Teorie Combinatorie 1 (Rome, 1973), pp. 481-511, Rome, 1976. Acc. Naz. Lincei. Reprinted in [8].
13. J. J. Seidel and D. E. Taylor, Two-graphs, a second survey, Algebraic Methods in Graph Theory II (Proc. Internat. Colloq., Szeged, 1978), pp. 689-711, Amsterdam, 1981, North-Holland, Reprinted in [8].
14. A. Thomason, An extremal function for contractions of graphs, Math Proc Cambridge Philos Soc 95 (1984), 261-265.
15. D. Kühn and D. Osthus, The extremal function for complete minors, J Combinator Theory B 81 (2001), 318-338.