Minors in expanding graphs

Geometric and Functional Analysis

Volumn 19, Issue 1, 2009, Pages 294-331

  Krivelevich, Michael ^a   Sudakov, Benjamin ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Expanding graphs; Graph minors; Pseudo random graphs; Random graphs

Indexed keywords

EID: 67650315677     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00039-009-0713-z     Document Type: Article

References (46)

1. th Annual ACM Symposium on Theory of Computing (1987), 132-140.
2. N. ALÓN, U. FEIGE, A. WIGDERSON, D. ZUCKERMAN, Derandomized graph products, Computational Complexity 5 (1995), 60-75.
3. N. ALON, M. KRIVELEVTCH, B. SUDAKOV, Turan numbers of bipartite graphs and related Ramsey-type questions, Combinatorics, Probability and Computing 12 (2003), 477-494.
4. N. ALON, L. RÓNYAI, T. SZABÓ, Norm-graphs: variations and applications, J. Combinatorial Theory Ser. B 76 (1999), 280-290.
5. N. ALON, P. SEYMOUR, R. THOMAS, A separator theorem for nonplanar graphs, J. Amer. Math. Soc. 3 (1990), 801-808.
6. N. ALON, J. SPENCER, The Probabilistic Method, 2nd ed., Wiley, 2000.
7. B. BOLLOBÁS, Extremal graph theory, Academic Press, 1978.
8. B. BOLLOBÁS, P. CATLIN, P. ERDOS, Hadwiger's conjecture is true for almost every graph, Europ. J. Combinatorics 1 (1980), 195-199.
9. L. SUNIL CHANDRAN, C.R. SUBRAMANIAN, A spectral lower bound for the treewidth of a graph and its consequences, Information Processing Letters 87 (2003), 195-200.
10. th Symposium on Foundations of Computer Science (FOCS), IEEE Comput. Soc. Press (2005), 637-646.
11. R. DIESTEL, C. REMPEL, Dense minors in graphs of large girth, Combinatorica 25 (2005), 111-116.
12. Y. DRIER, N. LINIAL, Minor in lifts of graphs, Random Structures and Algorithms 29 (2006), 208-225.
13. P. ERDOS, J. SPENCER, Imbalances in k-colorations, Networks 1 (1971/72), 379-385.
14. N. FOUNTOULAKIS, D. KÜHN, D. OSTHUS, The order of the largest complete minor in a random graph, Random Structures and Algorithms 33 (2008), 127-141.
15. S. HOORY, N. LINIAL, A. WICDERSON, Expander graphs and their applications, Bulletin of the AMS 43 (2006), 439-561.
16. th ACM STOC (1988), 235-244.
17. th Symposium on Foundations of Computer Science (FOCS), IEEE Comput, Soc. Press (1996), 86-95.
18. A. KOSTOCHKA, The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37-58.
19. T. KÖVARI, V.T. SÓS, P. TURÁN, On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50-57.
20. M. KRIVELEVICH, B. SUDAKOV, Pseudo-random graphs, in "More Sets, Graphs and Numbers," Bolyai Soc. Math. Stud., 15, Springer, Berlin (2006), 199-262.
21. J.B. KRUSKAL, The theory of well-quasi-ordering: a frequently discovered concept, J. Combinatorial Theory Ser. A 13 (1972), 297-305.
22. D. KÜHN, D. OSTHUS, Minors in graphs of large girth, Random Structures Algorithms 22 (2003), 213-225.
23. s,s-free graphs, Combinatorica 25 (2005), 49-64.
24. K. KURATOWSKI, Sur le problème des courbes gauches en topologie, Fund. Math. 16 (1930), 271-283.
25. L. LOVÁSZ, Random walks on graphs: a survey, in "Combinatorics, Paul Erdos is Eighty", Vol. 2, Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest (1996), 353-397.
26. L. LOVÁSZ, Graph minor theory, Bull. Amer. Math. Soc. (N.S.) 43 (2006), 75-86.
27. A. LUBOTZKY, R. PHILLIPS, P. SARNAK, Ramanujan graphs, Combinatorica 8 (1988), 261-277.
28. G. MARGULIS, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Problems Inform. Transmission 24 (1988), 39-46.
29. B. MOHAR, What is ... a graph minor? Notices Amer. Math. Soc. 53 (2006), 338-339.
30. E. MOSSEL, R. O'DONNELL, O. REGEV, J. STEIF, B. SUDAKOV, Non-interactive correlation distillation, inhomogeneous Markov chains and the reverse Bonami-Beckner inequality, Israel Journal of Mathematics 154 (2006), 299-336.
31. J.S. MYERS, A. THOMASON, The extremal function for noncomplete minors, Combinatorica 25 (2005), 725-753.
32. A. NAOR, J. VERSTRAËTE, A note on bipartite graphs without 2k-cycles, Combinatorics, Probability and Computing 14 (2005), 845-849.
33. M.S. PINSKER., On the complexity of a concentrator, in "7th Annual teletraffic conference", 318/1-318/4. Stockholm (1973),
34. th ACM-SIAM Symposium on Discrete Al-gorithms (SODA), ACM, New York (1994), 462-470.
35. O. REINGOLD, S. VADHAN, A. WIGDERSON, Entropy waves, the zig-zag graph product, and new constant-degree expanders, Ann. of Math. 155 (2002), 157-187.
36. N. ROBERTSON, P.D. SEYMOUR, Graph minors. XX. Wagner's conjecture, J. Combin. Theory Ser. B 92 (2004), 325-357.
37. P. SARNAK, What is ... an expander? Notices Amer. Math. Soc. 51 (2004), 762-763.
38. A. THOMASON, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261-265.
39. A. THOMASON, Pseudorandom graphs, in "Random Graphs '85 (Poznań)", North-Holland Math. Stud. 144, Amsterdam (1987), 307-331.
40. A. THOMASON, Random graphs, strongly regular graphs and pseudorandom graphs, in "Surveys in Combinatorics", London Math. Soc. Lecture Note Ser. 123 Cambridge Univ. Press (1987), 173-195.
41. A. THOMASON, The extremal function for complete minors, J. Combinatorial Theory Ser. B 81 (2001), 318-338.
42. A. THOMASON, Extremal functions for graph minors, in "More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud. 15, Springer, Berlin (2006), 359-380.
43. C. THOMASSEN, Girth in graphs. J. Combin. Theory Ser. B 35 (1983), 129-141.
44. B. TOFT, A survey of Hadwiger's conjecture, Surveys in Graph Theory (San Francisco, CA, 1995), Congr. Numer. 115 (1996), 249-283.
45. J. VERSTRAËTE. On arithmetic progressions of cycle lengths in graphs, Combinatorics Probability and Computing 9 (2000). 369-373.
46. K. WAGNER, Über eine Eigenschaft des Satzes von Kuratowski, Deutsche Mathematik 2 (1937), 280-285.