Highly connected graphs have highly connected spanning bipartite subgraphs

For integers $k,n$ with $1 \le k \le n/2$, let $f(k,n)$ be the smallest integer $t$ such that every $t$-connected $n$-vertex graph has a spanning bipartite $k$-connected subgraph. A conjecture of Thomassen asserts that $f(k,n)$ is upper bounded by some function of $k$. The best upper bound for $f(k,n)$ is by Delcourt and Ferber who proved that $f(k,n) \le 10^{10}k^3 \log n$. Here it is proved that $f(k,n) \le 22k^2 \log n$. For larger $k$, stronger bounds hold. In the linear regime, it is proved that for any $0<c<\frac{1}{2}$ and all sufficiently large $n$, if $k=\lfloor cn \rfloor$, then $f(k, n) \le 30\sqrt{c} n \le 30\sqrt{n(k+1)}$. In the polynomial regime, it is proved that for any $\frac{1}{3} \le \alpha<1$ and all sufficiently large $n$, if $k = \lfloor n^\alpha \rfloor$, then $f(k ,n) \le 9n^{(1+\alpha)/2} \le 9\sqrt{n(k+1)}$.


Introduction
All graphs and digraphs considered here are finite and simple.For k ≥ 1, a graph G is k-connected if it has at least k + 1 vertices, but does not contain a set of k − 1 vertices whose removal disconnects G. Let κ(G) be the largest k such that G is k-connected.
The study of k-connectivity and κ(G) are central in graph theory with several classical results relating properties of G to its k-connectivity or to the k-connectivity of a subgraph of G.One such result is a theorem of Mader [8] that any graph with n vertices and at least 2kn edges has a kconnected subgraph.For large n, the constant 2 can be replaced with 19  12 as proved by Bernshteyn and Kostochka [2], improving an earlier result of the author [13], and arriving close to Mader's conjectured optimal value of 3  2 [9].As any graph has a bipartite subgraph with at least half the number of edges, it follows that any graph with at least, say, 4kn edges contains a bipartite k-connected subgraph.But what if we require the subgraph to be spanning?As observed by Thomassen, if G is 2k − 1 edge-connected (a graph is t edge-connected if one must remove at least t edges to disconnect it), then every maximum edge cut (which, in turn, is a spanning bipartite subgraph) is k edge-connected.A longstanding conjecture of Thomassen [12] asserts that a similar statement (replacing 2k − 1 with any function of k) should hold for k-connectivity.Let us be more formal regarding this problem, as we are addressing it for k that may depend on the number of vertices of G.
For integers k, n with 1 ≤ k ≤ n/2, let f (k, n) be the smallest integer t such that every tconnected n-vertex graph has a spanning bipartite k-connected subgraph.It is clear that f (1, n) = 1 as shown by taking any spanning tree.It is also clear that the requirement k ≤ n/2 is necessary.Indeed, κ(H) ≤ n/2 for any bipartite graph H with n vertices.Also notice that f (k, n) ≤ n − 1 as K n is (n − 1)-connected.It is also not difficult to prove that f (2, n) = 3 for all n ≥ 5 (see Section 3 for such a proof).Thomassen's conjecture states that f (k, n) is upper bounded by some function of k.
The presently best upper bound on f (k, n) is by Delcourt and Ferber [4] who proved that f (k, n) ≤ 10 10 k 3 log n1 .While this does not prove Thomassen's conjecture, it does show that the dependence on n is at most logarithmic.It should be noted that Delcourt and Ferber explicitly state that their main focus is the dependence on n and not the dependence on k.Nevertheless, the problem is intriguing also for large k that depends on n.For example, is it true that if G has linear connectivity, then it has a spanning bipartite subgraph of reasonable linear connectivity?Here we give a positive answer to this question and significantly improve the dependence on k and the absolute constants in all regimes.
Note that while the constant c in Item (c) covers every possible value, it is only meaningful if c < 1 900 since we always have It should be noted that Theorem 1.1 does not shed more light on Thomassen's conjecture as the dependence on n in Case (a) is still logarithmic as in [4].On the other hand, it scales the dependence on k from at most quadratic to ever smaller polynomials as k grows beyond n 1/3 .We also note that while we did not try to optimize the absolute constants, they are reasonably small.
Finally, we note that problem addressed here falls under the following general paradigm (see Perarnau and Reed [10]).Given a graph parameter ρ, a value k, and a family of graphs F, determine the largest value of ℓ such that for every graph G with ρ(G) ≥ k there exists an F-free subgraph H of G with ρ(H) ≥ ℓ.In our case ρ = κ and F is the family of odd cycles.Some interesting results following under this paradigm are [3,5,6,7,10,11].
2 Proof of Theorem 1.1 Our proof of Theorem 1.1 is an adaptation of the method of Delcourt and Ferber, but with several changes.In particular, we rely on their lemma on subgraph connectivity of digraphs with high minimum out-degree (Lemma 2.1 below), but we do not rely on Mader's Theorem (the one mentioned in the introduction) which makes the choices of our maximum counter-example (which we use for contradiction) more economical, and resulting in meaningful bounds also when k is large.
We first need the following simple and useful lemma from [4].For a directed graph D and a vertex v ∈ V (D), let d + D (v) denote the out-degree of v in D and let U (D) denote the underlying graph of D which is the undirected graph obtained by ignoring the directions of the edges (each cycle of length 2, which is possible in D, corresponds to a single edge in U (D)).

Lemma 2.1 ([4]
).If D is a digraph on at most n vertices and with minimum out-degree larger than (k − 1) log n, then it contains a subdigraph D ′ with κ(U (D ′ )) ≥ k and where Lemma 2.2.Let G 1 and G 2 be two vertex-disjoint bipartite k-connected subgraphs of a graph G.
If there are at least 2k − 1 pairwise vertex-disjoint edges of G each having an endpoint in G 1 and an endpoint in G 2 , then one can pick k of these edges such that the union of G 1 and G 2 , together with the k picked edges, forms a bipartite k-connected subgraph of G.
Proof.Let (A 1 , A 2 ) be a proper bipartition of V (G 1 ) and let (A 3 , A 4 ) be a proper bipartition of V (G 2 ).Let F be 2k −1 pairwise vertex-disjoint edges, each with an endpoint in G 1 and an endpoint in G 2 .Let F i,j be the subset of F consisting of the edges with one endpoint in A i and the other in In the former case, we can take F 1,3 ∪ F 2,4 and the union of G 1 and G 2 to form a bipartite graph with proper bipartition (A 1 ∪ A 4 , A 2 ∪ A 3 ).In the latter case, we can take F 1,4 ∪ F 2,3 and the union of G 1 and G 2 to form a bipartite graph with proper bipartition (A In any case, the obtained union is k-connected as the removal of any k − 1 vertices keeps G 1 and G 2 connected and at least one of the connecting edges is still intact so the union remains connected as well.
then one can pick k of these neighbors such that the union of G 1 and v, together with the k edges connecting v to the picked neighbors, forms a bipartite k-connected subgraph of G.
Proof.Let (A 1 , A 2 ) be a proper bipartition of V (G 1 ) where, without loss of generality, v has at least k neighbors in A 1 .Taking G 1 together with v and the k edges connecting v to A 1 gives a bipartite graph with bipartition (A 1 , A 2 ∪ {v}) which is clearly k-connected.
We begin by proving Case (a) of Theorem 1.1.We then show how to modify the proof to obtain the other cases.
Proof of Theorem 1.1, Case (a).Recall that we must prove that f (k, n) ≤ 22k 2 log n.We assume k ≥ 3 (as k = 1 is trivial and k = 2 follows form Proposition 3.1).Let s = ⌊22k 2 log n⌋.We may assume that s Let G be an s-connected graph with n vertices.We prove that G has a bipartite spanning k-connected subgraph. Let has a bipartite spanning subgraph B i that is k-connected (for convenience, when V i is a singleton, let B i denote the graph with a single vertex; it is "bipartite" with one part of the bipartition being empty).Hereafter we shall consider a partition P = {V 1 , . . ., V t } where t is minimum and show that we must have t = 1, concluding the proof.So, assume that t > 1. Suppose vertices of the endpoints of M i , once removed from G, disconnect the remaining vertices of V i from the remaining vertices of V (G) \ V i , contradicting the s-connectivity of G. Let S i ⊆ M i be such that for any j = i, there is a single edge incident with V j , if such an edge exists.By Lemma 2.2, as otherwise t would not be minimum.
Next, suppose that V i = {v} ∈ P is a singleton.We say that V i is of type α if v has at least 3d neighbors in V , where each of them is a singleton part of P .Otherwise, we say that V i is of type β.Now, if V i is of type α, let S i be a set 3d edges connecting v to 3d singleton parts of P .Suppose now that V i is of type β.As the degree of v in G is at least s, we have that at least s − 3d edges connect v to non-singleton parts of P .By Lemma 2.3 and as t is minimum, at most 2k − 2 such edges connect v to the same non-singleton part of P .Thus, there is a set S i of edges connecting v to non-singleton parts of P such that no two edges of S i are incident with the same part and To summarize, for each part V i ∈ P we have chosen a set of edges S i incident to that part and connecting it to other parts, such than no other part V j has more than one vertex incident with S i .If V i is non-singleton, then S i is a matching and if V i is a singleton, then S i is a star.In all cases, Independently for each i, take a random red-blue proper vertex coloring of the bipartite graph B i (so either one part of the bipartition of B i is red and the other part is blue, or vice versa).Once making these t choices, let T i ⊆ S i be those edges whose endpoints have different colors.Observe that the union of all B 1 , . . ., B t and the edge sets T 1 , . . ., T t is a bipartite spanning subgraph of G.
2 ) we have by Chernoff's inequality, Since t ≤ n and since s > 64k ln n, we have from (1) and the union bound that with positive probability, |T i | ≥ |S i |/4 for all 1 ≤ i ≤ t.Hereafter, we shall assume that this is indeed the case.We construct a directed graph D on vertex set [t] where (i, j) is an edge whenever T i is incident with a vertex of V j .Notice that the out-degree of i is precisely i ⊆ T i be the set of edges in T i incident with some V j where j = i and j ∈ V (D ′ ).Notice that Consider the bipartite graph B obtained by taking the union of all B i for i ∈ V (D ′ ) and all edge sets But in the latter case, all these singletons must be of type α (if V i is of type β, then any edge (i, j) and thus B is a bipartite graph with minimum degree at least d/2 so it has at least d vertices.
We will prove that B is k-connected.Note that once we do that, we arrive at a contradiction, as the number of parts of the partition obtained by replacing all the parts of P of the form V i with i ∈ V (D ′ ) with the single element V (B), is smaller than t.
To prove that B is k-connected, consider some set K of k − 1 vertices of B. We must show that B * , the graph remaining from B after removing K, remains connected.Suppose x ∈ V i and y ∈ V j (possibly i = j) are two vertices of B * .We must show that there is a path in B * connecting them.
Hence, there is a path between x and y entirely inside It therefore suffices to show that there is a (possibly trivial) path connecting x to some vertex of V m where m / ∈ L and there is a (possibly trivial) path connecting y to some vertex of V m * where m * / ∈ L. As the two claims are identical, we prove it for x.Notice that the claimed path trivially exists if i / ∈ L. If, however i ∈ L (namely, some of the vertices of K are in V i ), then V i cannot be a singleton (as it contains both x and a vertex of K).So, T * i is matching of size at least k (since U (D ′ ) is k-connected, its minimum degree is at least k).Hence, at least one edge of T * i is not incident with K nor with V ℓ where ℓ ∈ L. Such an edge is of the form uv where u ∈ V i \ K (possibly u = x) and v ∈ V m with m / ∈ L. As there is a path in B i [V i \ K] between x and u, the claim follows.
Proof of Theorem 1.1, Case (b).Recall that we must prove that for all 0 ≤ α < 1 and sufficiently large n, if k = ⌊n α ⌋, then f (k, n) ≤ 9n (1+α)/2 .The proof is very similar to Case (a).We use the same notation and outline the differences.Set s = ⌊9n (1+α)/2 ⌋ and let k = ⌊n α ⌋.We set d = ⌊s/4⌋ ≥ k and use a partition P = {V 1 , . . ., V t } where t is minimum, as in Case (a), aiming to prove that t = 1.Assume, to the contrary, that t > 1.Let t * denote the number of non-singleton parts (i.e.those of size at least d) and observe that t Suppose V i ∈ P is not a singleton and recall that we have defined M i to be a maximum matching of the edge cut (V i , V (G) \ V i ) and that as in Case (a) we have |M i | ≥ d.By Lemma 2.2, at most (2k − 2)t * edges of M i are incident with non-singleton parts, so after removing them from M i we obtain a subset . Notice that this definition of S i is slightly different from the one used in Case (a), as we may take advantage of the fact that there are many singleton parts.
Consider now a singleton part V i and recall that if V i is of type α, then S i is the set of edges of a star connecting V i only to singleton parts and |S i | = 3d.We claim that there are no singletons of type β.Suppose that V i is of type β, i.e., at least s − 3d edges connect it to non-singleton parts.However, by Lemma 2.3 at most (2k − 2)t * edges connect it to non-singleton parts, which is impossible since (2k − 2)t * < n (1+α)/2 < s − 3d.
We observe that as in (1), we have that Pr 4 holds for all 1 ≤ i ≤ t with positive probability, so we assume this is the case.Thus, we have that in the directed graph D, the out-degree of i is We therefore apply Lemma 2.1 to obtain D ′ as in Case (a).The analogue of (2), which, recall, is only applied when V i is of type α, now becomes so, as in Case (a), |V (B)| ≥ d, the new partition has fewer parts than P , and B is k-connected, contradicting the minimality of t.
Prior to proving Case (c) of Theorem 1.1, we require the following variant of Lemma 2.1.
Lemma 2.4.Let 0 < c < 1 2 .For all sufficiently large n, if D is a digraph on at most n vertices and with minimum out-degree at least 3c log(1/c)n, then it contains a subdigraph D ′ with κ(U (D ′ )) ≥ cn and where ≥ cn, there is nothing to prove.So, assume that γ < 1 and that κ(U (D)) < cn.Delete a separating set of size at most cn.The smallest component, denoted by A, has fewer than n/2 vertices and for any v ∈ V (A), every out-neighbor of v is either in V (A) or in the separating set that we removed.Hence, We repeatedly apply this step, and note that this process must terminate.However, after step r = ⌈γ/2c⌉, we are left with a component which consists of fewer than n/2 r vertices where each of these vertices has out-degree at least γn − rcn.However, this is impossible since Thus, the process ends after at most r − 1 steps, finding the desired D ′ and we have d Proof of Theorem 1.1, Case (c).Recall that we must prove that for all 0 < c < 1 2 and sufficiently large n, if k = ⌊cn⌋, then f (k, n) ≤ 30 √ cn.The proof is similar to Case (b).We use the same notation and outline the differences.Let c * = 30 √ c and observe that Case (c) holds vacuously when c ≥ 1/900, hence we assume that c < 1/900.let k = ⌊cn⌋, s = ⌊c * n⌋, d = ⌊s/4⌋.We now have the number of non-singleton parts is t * ≤ n/d ≤ 4n/(s − 3) < 5/c * .If V i ∈ P is not a singleton we have, as in Case (b), that Consider now a singleton part V i and recall that if V i is of type α, then S i is a star connecting V i only to singleton parts and |S i | = 3d.We again claim that there are no singletons of type β.
Suppose that V i is of type β, i.e., at least s − 3d edges connect it to non-singleton parts.However, by Lemma 2.3 at most (2k − 2)t * edges connect it to non-singleton parts, which is impossible since As in Case (b), since |S i |/8 = ω(ln n), we may assume that |T i | ≥ |S i | 4 holds for all 1 ≤ i ≤ t.Thus, we have that in the directed graph D, the out-degree of i is where in the last inequality we have used that c < 1/900.We therefore apply Lemma 2.4 to obtain D ′ with with κ(U (D ′ )) ≥ cn and where ).The analogue of (2), which, recall, is only applied when V i is of type α, now becomes so, as in Case (a), |V (B)| ≥ d, the new partition has fewer parts than P , and B is k-connected, contradicting the minimality of t.
and v 2 is the only neighbor of y in A ∪ B, then we can remove v 1 , v 2 from G thereby separating X from the rest of the graph (recall that M is a maximum matching).Otherwise, w.l.o.g., x has two neighbors in A ∪ B, one of which is v 1 and the other denoted by v 3 (possibly v 3 = v 2 ).If y also has two neighbors in A ∪ B, then by (i) and (ii) it must be that these neighbors are also v 1 and v 2 = v 3 .We can then remove v 1 , v 2 from G and disconnect X.Otherwise, v 2 is the only neighbor of y in A ∪ B. Now, if v 2 = v 3 we can delete v 1 and v 2 from G thereby separating X from the rest of the graph.Otherwise, we can delete x and v 2 thereby separating y from the rest of the graph.
Recall that if G is 2k − 1 edge-connected, then every maximum edge cut is k edge-connected.It is easy to generalize this observation and show that if the edge connectivity of G is larger than r(k − 1)/(r − 1), then G has a spanning r-chromatic subgraph that is k edge-connected.Indeed, any maximum r-cut validates this fact.Stated otherwise, by allowing more colors for the spanning subgraph, we can keep the edge-connectivity close to its original value.The following proposition shows that the same holds for the case of k-connectivity in the linear regime.Proposition 3.2.Let 0 < c < c ′ < 1.There is a constant r = r(c, c ′ ) such that for all n sufficiently large, if G has n vertices and is ⌊c ′ n⌋-connected, then G has an r-colorable spanning subgraph that is ⌊cn⌋-connected.
Proof.Throughout the proof we assume that cn and c ′ n are integers as this does not affect the correctness of the proposition.Let t = c ′ n and let G be a t-connected graph on n vertices.Let r = r(c, c ′ ) ≥ 3 be a constant whose existence is shown later.Consider an r-coloring of V (G) where each vertex independently chooses its color uniformly at random.Let G ′ be the r-colorable spanning subgraph of G consisting of all edges whose endpoints receive distinct colors.We will prove that with positive probability, G ′ is cn-connected.
By Menger's Theorem, for any two distinct vertices a, b ∈ V (G), there is a set P a,b of t − 1 paths connecting a and b, each of length at least two, such that any two paths in P a,b are internally vertex-disjoint.We say that a path P ∈ P a,b survives if P is present in G ′ .It suffices to prove that the probability that fewer than cn paths of P a,b survive is less than 1/n 2 as then, by the union bound and Menger's theorem, G ′ is cn-connected with positive probability.
Fix two vertices a and b and fix a coloring of these two vertices (it is possible for a and b to have the same color).Consider some path P ∈ P a,b and let ℓ = |E(P )| − 1 denote the number of its internal vertices.The number of possible colorings of these internal vertices is r ℓ and at least (r − 1) ℓ−1 (r − 2) ≥ (r − 2) ℓ of these colorings yield a surviving path.Hence, the probability that P survives is at least (1−2/r) ℓ .If X P denotes the indicator variable for survival and X = P ∈P a,b X P is the number of surviving paths, .
Let c * = (c + c ′ )/2.Recalling that t = c ′ n we have from the last inequality, that for all r sufficiently large as a function of c ′ and c * , E[X] ≥ c * n .
Notice, however, that X is the sum of t − 1 independent indicator variables, as the paths are internally vertex-disjoint.Hence, by Chernoff's inequality (in particular, Corollary A.1.7 of [1]) implying that Pr[X < cn] < 1/n 2 .As the last statement holds for any choice of the colors of a and b, we have that the probability that the number of surviving paths in P a,b (regardless of the colors of a and b) is smaller than cn is less than 1/n 2 .

1 .
The total number of internal vertices in all paths of P ∈ P a,b is at most n−2, so the average number of internal vertices is at most (n − 2)/(t − 1).By the last inequality and the AM-GM inequality we haveE[X] ≥ (t − 1) 1 − 2 r(n−2)/(t−1)