An improved linear edge bound for graph linkages

European Journal of Combinatorics

Volumn 26, Issue 3-4 SPEC. ISS., 2005, Pages 309-324

  Thomas, Robin ^a   Wollan, Paul ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12944270357     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2004.02.013     Document Type: Article

References (13)

1. Bollobás B. Thomason A. Highly linked graphs Combinatorica 16 1996 313-320
2. Egawa Y. Faudree R.J. Györi E. Ishigami Y. Schelp R.H. Wang H. Vertex-disjoint cycles containing specified edges Graphs Combin. 16 2000 81-92
3. Jung H.A. Verallgemeinerung des n-fachen Zusammenhangs fuer graphen Math. Ann. 187 1970 95-103
4. K. Kawarabayashi, A. Kostochka, G. Yu, On sufficient degree conditions for a graph to be K-linked, Combin. Probab. Comput. (in press)
5. Kostochka A. A lower bound for the hadwiger number of a graph as a function of the average degree of its vertices Discret. Analyz 38 1982 37-58 Novosibirsk
6. Larman D.G. Mani P. On the existence of certain configurations within graphs and the 1-skeletons of polytopes Proc. London Math. Soc. 20 1974 144-160
7. Mader W. Homomorphieeigenschaften und Mittlere Kantendichte von graphen Math. Ann. 174 1967 265-268
8. Robertson N. Seymour P.D. Graph minors XIII. The disjoint paths problem J. Combin. Theory Ser. B 63 1995 65-110
9. Seymour P.D. Disjoint paths in graphs Discrete Math. 29 1980 293-309
10. Shiloach Y. A polynomial solution to the undirected two paths problem J. Assoc. Comp. Machinery 27 1980 445-456
11. R. Thomas, P. Wollan, The extremal function for 3-linked graphs (manuscript)
12. Thomason A. An extremal function for complete subgraphs Math. Proc. Camb. Phil. Soc. 95 1984 261-265
13. Thomassen C. 2-linked graphs European J. Combin. 1 1980 371-378