Minors in random and expanding hypergraphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 351-360

  Wagner, Uli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Embeddings; Hypergraphs; Minors; Random complexes; Simplicial complexes; Thresholds

Indexed keywords

EMBEDDINGS; HYPER GRAPH; MINORS; RANDOM COMPLEXES; SIMPLICIAL COMPLEXES; THRESHOLDS;

COMPUTATIONAL GEOMETRY;

GRAPH THEORY;

EID: 79960167514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998256     Document Type: Conference Paper

References (50)

1. M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi. Crossing-free subgraphs. Ann. Discrete Math., 12:9-12, 1982.
2. L. Aronshtam, N. Linial, T. Luczak, and R. Meshulam. Vanishing of the top homology of a random complex. arXiv:1010.1400v1, 2010.
3. E. Babson, C. Hoffman, and M. Kahle. The fundamental group of random 2-complexes. J. Amer. Math. Soc., 24(1):1-28, 2011.
4. B. Bollobá s, P. A. Catlin, and P. Erdös. Hadwiger's conjecture is true for almost every graph. European J. Combin., 1(3):195-199, 1980.
5. B. Bollobá s and A. Thomason. Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs. European J. Combin., 19(8):883-887, 1998. (Pubitemid 128387430)
6. W. G. Brown, P. Erdös, and V. T. Sös. Some extremal problems on r-graphs. In New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971), pages 53-63. Academic Press, New York, 1973.
7. D. C. Cohen, M. Farber, and T. Kappeler. The homotopical dimension of random 2-complexes. arXiv:1005.3383v1, 2010.
8. A. Costa, M. Farber, and T. Kappeler. Topology of random 2-complexes. arXiv:1006.4229v2, 2010.
9. T. K. Dey. On counting triangulations in d dimensions. Comput. Geom., 3(6):315-325, 1993.
10. T. K. Dey and J. Pach. Extremal problems for geometric hypergraphs. Discrete Comput. Geom., 19(4):473-484, 1998.
11. T. K. Dey and N. R. Shah. On the number of simplicial complexes in Rd. Comput. Geom., 8(5):267-277, 1997.
12. P. Erdös. On extremal problems of graphs and generalized graphs. Israel J. Math., 2:183-190, 1964.
13. A. Flores. Über die Existenz n-dimensionaler Komplexe, die nicht in den R2n topologisch einbettbar sind. Ergeb. Math. Kolloqu., 5:17-24, 1933.
14. J. Geelen, B. Gerards, and G. Whittle. Towards a matroid-minor structure theory. In Combinatorics, complexity, and chance, volume 34 of Oxford Lecture Ser. Math. Appl., pages 72-82. Oxford Univ. Press, Oxford, 2007.
15. M. Gromov. Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry. Geom. Funct. Anal., 20(2):416-526, 2010.
16. A. Gundert. On the complexity of embeddable simplicial complexes. Diplomarbeit, Freie Universität Berlin, 2009.
17. H. Hadwiger. Über eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch. Ges. Zürich, 88:133-142, 1943.
18. A. Haefliger. Plongements de varié té s dans le domaine stable. Sém. Bourbaki, 245, 1982.
19. T. Kaiser. Minors of simplicial complexes. Discrete Appl. Math., 157(12):2597-2602, 2009.
20. G. Kalai. The diameter of graphs of convex polytopes and f-vector theory. In Applied geometry and discrete mathematics, volume 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 387-411. Amer. Math. Soc., Providence, RI, 1991.
21. J. Komló s and E. Szemeré di. Topological cliques in graphs. II. Combin. Probab. Comput., 5(1):79-90, 1996.
22. D. Kozlov. Combinatorial Algebraic Topology, volume 21 of Algorithms and Computation in Mathematics. Springer, Berlin, 2008.
23. D. Kozlov. The threshold function for vanishing of the top homology group of random d-complexes. Proc. Amer. Math. Soc., 138(12):4517-4527, 2010.
24. M. Krivelevich and B. Sudakov. Minors in expanding graphs. Geom. Funct. Anal., 19(1):294-331, 2009.
25. K. Kuratowski. Sur le problème des courbes gauches en topologie. Fundamenta, 15:271-283, 1930.
26. F. T. Leighton. Complexity Issues in VLSI. MIT Press, Cambridge, MA, 1983.
27. N. Linial and R. Meshulam. Homological connectivity of random 2-complexes. Combinatorica, 26(4):475-487, 2006. (Pubitemid 44496610)
28. L. Lová sz. Graph minor theory. Bull. Amer. Math. Soc. (N.S.), 43(1):75-86 (electronic), 2006. (Pubitemid 43202398)
29. T. fiLuczak, B. Pittel, and J. C. Wierman. The structure of a random graph at the point of the phase transition. Trans. Amer. Math. Soc., 341(2):721-748, 1994.
30. W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann., 174:265-268, 1967.
31. W. Mader. 3n -5 edges do force a subdivision of K5. Combinatorica, 18(4):569-595, 1998.
32. J. Matoušek. Using the Borsuk-Ulam theorem. Springer-Verlag, Berlin, 2003.
33. J. Matoušek, M. Tancer, and U. Wagner. Hardness of embedding simplicial complexes in Rd. J. Eur. Math. Soc., 13(2):259-295, 2011.
34. P. McMullen. The maximum numbers of faces of a convex polytope. Mathematika, 17:179-184, 1970.
35. S. A. Melikhov. The van Kampen obstruction and its relatives. Proc. Steklov Inst. Math., 266(1):142-176, 2009.
36. R. Meshulam and N. Wallach. Homological connectivity of random k-dimensional complexes. Random Structures Algorithms, 34(3):408-417, 2009.
37. J. R. Munkres. Elements of Algebraic Topology. Addison-Wesley, Menlo Park, CA, 1984.
38. E. Nevo. Higher minors and van Kampen's obstruction. Math. Scand., 101:161-176, 2007.
39. I. Newman and Y. Rabinovich. Finite volume spaces and sparsification. arXiv:1002.3541v3, 2010.
40. N. Robertson, P. Seymour, and R. Thomas. Hadwiger's conjecture for K6-free graphs. Combinatorica, 13(3):279-361, 1993.
41. N. Robertson and P. D. Seymour. Graph minors. XX. Wagner's conjecture. J. Combin. Theory Ser. B, 92(2):325-357, 2004. (Pubitemid 39546548)
42. K. S. Sarkaria. Shifting and embeddability of simplicial complexes. Technical report, Max-Planck-Institut für Mathematik, Bonn, MPI/92-51, 1992.
43. A. B. Skopenkov. Embedding and knotting of manifolds in Euclidean spaces. In Surveys in contemporary mathematics, volume 347 of London Math. Soc. Lecture Note Ser., pages 248-342. Cambridge Univ. Press, Cambridge, 2008.
44. R. P. Stanley. The upper bound conjecture and Cohen-Macaulay rings. Studies in Appl. Math., 54(2):135-142, 1975.
45. A. Thomason. The extremal function for complete minors. J. Combin. Theory Ser. B, 81(2):318-338, 2001. (Pubitemid 33667135)
46. B. R. Ummel. Imbedding classes and n-minimal complexes. Proc. Amer. Math. Soc., 38:201-206, 1973.
47. E. R. van Kampen. Komplexe in euklidischen Räumen. Abh Math. Sem. Univ. Hamburg, 9:72-78, 1932.
48. K. Wagner. Über eine Eigenschaft der ebenen Komplexe. Math. Ann., 114(1):570-590, 1937.
49. C. Weber. Plongements de polyedres dans le domaine metastable. Comment. Math. Helv., 42:1-27, 1967.
50. J. Zaks. On minimal complexes. Pacif. J. Math., 28:721-727, 1969.