Abstract
A graph G is k-linked if G has at least 2k vertices, and for any 2k vertices x 1,x 2, …, x k ,y 1,y 2, …, y k , G contains k pairwise disjoint paths P 1, …, P k such that P i joins x i and y i for i = 1,2, …, k. We say that G is parity-k-linked if G is k-linked and, in addition, the paths P 1, …, P k can be chosen such that the parities of their length are prescribed. Thomassen [22] was the first to prove the existence of a function f(k) such that every f(k)-connected graph is parity-k-linked if the deletion of any 4k-3 vertices leaves a nonbipartite graph.
In this paper, we will show that the above statement is still valid for 50k-connected graphs. This is the first result that connectivity which is a linear function of k guarantees the Erdős-Pósa type result for parity-k-linked graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Böhme, K. Kawarabayashi, J. Maharry and B. Mohar: Linear connectivity forces large complete bipartite graph minors, to appear in J. Combin. Theory Ser. B 99(2) (2009), 323.
B. Bollobás and A. Thomason: Highly linked graphs, Combinatorica 16(3) (1996), 313–320.
M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour: Packing non-zero A-paths in group labelled graphs, Combinatorica 26(5) (2006), 521–532.
I. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.
R. Diestel: Graph Theory, 2nd Edition, Springer, 2000.
P. Erdős and L. Pósa: On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen 9 (1962), 3–12.
J. Geelen, B. Gerards, L. Goddyn, B. Reed, P. Seymour and A. Vetta: The odd case of Hadwiger’s conjecture, preprint.
H. A. Jung: Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen, Math. Ann. 187 (1970), 95–103.
K. Kawarabayashi, A. Kostochka and G. Yu: On sufficient degree conditions for a graph to be k-linked, Combin. Probab. Comput. 15 (2006), 685–694.
K. Kawarabayashi and A. Nakamoto: The Erdős-Pósa property for odd cycles on an orientable fixed surface, Discrete Math. 307 (2007), 764–768.
K. Kawarabayashi: Coloring graphs without totally odd K k-subdivisions, and the Erdős-Pósa property; preprint.
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.
L. Lovász and M. D. Plummer: Matching Theory, Ann. of Discrete Math. 29, (1986).
W. Mader: Homomorphiesätze für Graphen, Math. Ann. 178 (1968), 154–168.
W. Mader: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großr Kantendichte, Abh. Math. Sem. Univ. Hamburg 37 (1972), 86–97.
W. Mader: Über die Maximalzahl kreuzungsfreier H-Wege, Arch. Math. 31 (1978), 387–402.
D. Rautenbach and B. Reed: The Erdős-Pósa property for odd cycles in highly connected graphs, Combinatorica 21(2) (2001), 267–278.
B. Reed: Mangoes and blueberries, Combinatorica 19(2) (1999), 267–296.
P. Seymour: Matroid minors, in: Handbook of Combinatorics (eds: R. L. Graham, M. Grötschel and L. Lóvasz), North-Holland, Amsterdam, 1985, 419–431.
R. Thomas and P. Wollan: An improved linear edge bound for graph linkages, Europ. J. Combinatorics 26 (2005), 253–275.
C. Thomassen: On the presence of disjoint subgraphs of a specified type, J. Graph Theory 12 (1988), 101–111.
C. Thomassen: The Erdős-Pósa property for odd cycles in graphs with large connectivity, Combinatorica 21(2) (2001), 321–333.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partly supported by the Japan Society for the Promotion of Science for Young Scientists, by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research and by Inoue Research Award for Young Scientists.