Highly linked graphs

Combinatorica

Volumn 16, Issue 3, 1996, Pages 313-320

  Bollobás, Béla ^a   Thomason, Andrew ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042997112     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01261316     Document Type: Article

References (20)

1. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, London, (1978).
2. B. BOLLOBÁS, and A. THOMASON: Topological complete subgraphs, (submitted to European Journal of Combinatorics).
3. G. A. DIRAC: Généralisations du théorème de Menger, C. R. Acad Sci. Paris, 250 (1960), 4252-4253.
4. G. A. DIRAC, and S. SCHUSTER: A theorem of Kuratowski, Indag. Math 16 (1954), 343-348.
5. P. ERDOS, and A. HAJNAL: On topological complete subgraphs of certain graphs, Annales Univ. Sci. Budapest., (1969), 193-199.
6. A. HUCK: A sufficient condition for a graph to be weakly k-linked, Graphs and Combinatorics, 7 (1991), 323-351.
7. H. A. JUNG: Verallgemeinerung des n-fachen zusammenhangs für Graphen, Math. Ann., 187 (1970), 95-103.
8. R. M. KARP: On the complexity of combinatorial problems, Networks, 5 (1975), 45-68.
9. J. KOMLÓS, and E. SZEMERÉDI: Topological cliques in graphs, Combinatorics, Probability and Computing, 3 (1994), 247-256.
10. J. KOMLÓS, and E. SZEMERÉDI: Topological cliques in graphs II, Combinatorics, Probrability and Computing, 5 (1996), 79-90.
11. A. KOSTOCHKA: A lower bound for the Hadwiger number of a graph as a function of the average degree of its vertices, Discret. Analyz, Novosibirsk 38 (1982) 37-58.
12. D. G. LARMAN, and P. MANI: On the existence of certain configurations within graphs and the 1-skeletons of polytopes, Proc. London Math. Soc., 20 (1974), 144-160.
13. W. MADER: Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math. Annalen, 174 (1967), 265-268.
14. W. MADER: Existenz n-fach zusammenhängender Teilgraphen in Graphen genugend grossen Kantendichte, Abh. Math. Sem. Hamburg Univ., 37 (1972), 86-97.
15. W. MADER: Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homomorph sind, Math. Nachr., 53 (1972), 145-150.
16. N. ROBERTSON, and P. SEYMOUR: Graph Minors XIII, The disjoint paths problem, Journal of Combin. Theory, Ser. B, 63 (1995), 65-100.
17. P. SEYMOUR: Disjoint paths in graphs, Discrete Math., 29 (180), 293-309.
18. A. THOMASON: An extremal function for complete subgraphs, Math. Proc. Camb. Phil. Soc., 95 (1984), 261-265.
19. C. THOMASSEN: 2-linked graphs, Europ. J. Combinatorics, 1 (1980), 371-378.
20. C. THOMASSEN: Highly connected non-2-linked graphs, Combinatorica, 11 (1991), 393-395.