This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Graphs with girth 2​ℓ+12\ell+1 and without longer odd holes are 33-colorable

Rong Chen

Center for Discrete Mathematics,Β Β Fuzhou University
Fuzhou,Β Β P. R. China
Abstract

For a number β„“β‰₯2\ell\geq 2, let 𝒒ℓ\mathcal{G}_{\ell} denote the family of graphs which have girth 2​ℓ+12\ell+1 and have no odd hole with length greater than 2​ℓ+12\ell+1. Plummer and Zha conjectured that every 3-connected and internally 4-connected graph in 𝒒2\mathcal{G}_{2} is 3-colorable. Wu, Xu, and Xu conjectured that every graph in ⋃ℓβ‰₯2𝒒ℓ\bigcup_{\ell\geq 2}\mathcal{G}_{\ell} is 3-colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in 𝒒2\mathcal{G}_{2} and 𝒒3\mathcal{G}_{3} is 3-colorable. In this paper, we prove that every graph in ⋃ℓβ‰₯5𝒒ℓ\bigcup_{\ell\geq 5}\mathcal{G}_{\ell} is 3-colorable.

Key Words: chromatic number; odd holes

111Mathematics Subject Classification: 05C15, 05C17, 05C69 Email: [email protected] (R. Chen).

1 Introduction

All graphs considered in this paper are finite, simple, and undirected. A proper coloring of a graph GG is an assignment of colors to the vertices of GG such that no two adjacent vertices receive the same color. A graph is kk-colorable if it has a proper coloring using at most kk colors. The chromatic number of GG, denoted by χ​(G)\chi(G), is the minimum number kk such that GG is kk-colorable.

The girth of a graph GG, denoted by g​(G)g(G), is the minimum length of a cycle in GG. A hole in a graph is an induced cycle of length at least four. An odd hole means a hole of odd length. For any integer β„“β‰₯2\ell\geq 2, let 𝒒ℓ\mathcal{G}_{\ell} be the family of graphs that have girth 2​ℓ+12\ell+1 and have no odd holes of length at least 2​ℓ+32\ell+3. Robertson conjectured in [3] that the Petersen graph is the only graph in 𝒒2\mathcal{G}_{2} that is 3-connected and internally 4-connected. Plummer and Zha [4] disproved Robertson’s conjecture and proposed the conjecture that all 3-connected and internally 4-connected graphs in 𝒒2\mathcal{G}_{2} have bounded chromatic number, and the strong conjecture that such graphs are 3-colorable. The first was proved by Xu, Yu, and Zha [7], who proved that all graphs in 𝒒2\mathcal{G}_{2} is 4-colorable. Chudnovsky and Seymour [2] proved that every graph in 𝒒2\mathcal{G}_{2} is 3-colorable. In the same paper, Chudnovsky and Seymour also gave a short and pretty proof of the result in [7]. Wu, Xu, and Xu [5] showed that graphs in ⋃ℓβ‰₯2𝒒ℓ\bigcup_{\ell\geq 2}\mathcal{G}_{\ell} are 4-colorable and proposed the following conjecture.

Conjecture 1.1.

([5], Conjecture 6.1.) Every graph in ⋃ℓβ‰₯2𝒒ℓ\bigcup_{\ell\geq 2}\mathcal{G}_{\ell} is 33-colorable.

We say that a graph GG has an odd K4K_{4}-subdivision if some subgraph HH of GG is isomorphic to a K4K_{4}-subdivision and whose face cycles are all odd holes of GG. The subgraph HH is also induced by ([1], Lemma 2.7). In the same paper, the author and Zhou proved

Theorem 1.2.

([1], Theorem 1.1.) For each graph GG in ⋃ℓβ‰₯5𝒒ℓ\bigcup_{\ell\geq 5}\mathcal{G}_{\ell}, if GG has an odd K4K_{4}-subdivision, then χ​(G)=3\chi(G)=3.

Based on Theorem 1.2, in this paper we prove that Conjecture 1.1 holds for β„“β‰₯5\ell\geq 5. That is,

Theorem 1.3.

All graphs in ⋃ℓβ‰₯5𝒒ℓ\bigcup_{\ell\geq 5}\mathcal{G}_{\ell} are 33-colorable.

We conjecture

Conjecture 1.4.

For a graph GG without triangles, if all odd holes of GG have the same length, then GG is 33-colorable.

Conjecture 1.5.

For an integer β„“β‰₯2\ell\geq 2 and a graph GG with g​(G)=2​ℓ+1g(G)=2\ell+1, if the set of lengths of odd holes of GG have kk members, then GG is (k+2)(k+2)-colorable.

2 Preliminary

A cycle is a connected 22-regular graph. Let GG be a graph. For any subset UβŠ†V​(G)U\subseteq V(G), let G​[U]G[U] be the induced subgraph of GG defined on UU. For subgraphs HH and Hβ€²H^{\prime} of GG, set |H|:=|E​(H)||H|:=|E(H)| and H​Δ​Hβ€²:=E​(H)​Δ​E​(Hβ€²)H\Delta H^{\prime}:=E(H)\Delta E(H^{\prime}). Let HβˆͺHβ€²H\cup H^{\prime} denote the subgraph of GG with vertex set V​(H)βˆͺV​(Hβ€²)V(H)\cup V(H^{\prime}) and edge set E​(H)βˆͺE​(Hβ€²)E(H)\cup E(H^{\prime}). Let H∩Hβ€²H\cap H^{\prime} denote the subgraph of GG with edge set E​(H)∩E​(Hβ€²)E(H)\cap E(H^{\prime}) and without isolated vertex. Let N​(H)N(H) be the set of vertices in V​(G)βˆ’V​(H)V(G)-V(H) that have a neighbour in V​(H)V(H). Set N​[H]:=N​(H)βˆͺV​(H)N[H]:=N(H)\cup V(H).

Let PP be an (x,y)(x,y)-path and QQ a (y,z)(y,z)-path. When PP and QQ are internally disjoint paths, let P​QPQ denote the (x,z)(x,z)-path PβˆͺQP\cup Q. Evidently, P​QPQ is a path when xβ‰ zx\neq z, and P​QPQ is a cycle when x=zx=z. Let Pβˆ—P^{*} denote the set of internal vertices of PP. When u,v∈V​(P)u,v\in V(P), let P​(u,v)P(u,v) denote the subpath of PP with ends u,vu,v. For simplicity, we will let Pβˆ—β€‹(u,v)P^{*}(u,v) denote (P​(u,v))βˆ—(P(u,v))^{*}.

For a number kβ‰₯2k\geq 2, a graph GG is kk-vertex-critical if χ​(G)=k\chi(G)=k and χ​(Gβˆ’v)≀kβˆ’1\chi(G-v)\leq k-1 for each vertex vv of GG.

Lemma 2.1.

([1], Lemma 2.2.) For any number kβ‰₯4k\geq 4, each kk-vertex-critical graph has no 22-edge-cut.

For an ii-vertex path PP of a connected graph GG, if Gβˆ’V​(P)G-V(P) is disconnected, then we say that PP is a PiP_{i}-cut. Usually, a P2P_{2}-cut is also called a K2K_{2}-cut. Evidently, every kk-vertex-critical graph has no K2K_{2}-cut. Chudnovsky and Seymour in [2] proved that every 44-vertex-critical graph GG in 𝒒2\mathcal{G}_{2} has no P3P_{3}-cut. In fact, their methods can also be used to prove the following result.

Lemma 2.2.

([2]) For any number β„“β‰₯2\ell\geq 2, every 44-vertex-critical graph in 𝒒ℓ\mathcal{G}_{\ell} has neither K2K_{2}-cut nor P3P_{3}-cut.

A theta graph is a graph that consists of a pair of distinct vertices joined by three internally disjoint paths. Let CC be a hole of a graph GG. A path PP of GG is a chordal path of CC if CβˆͺPC\cup P is an induced theta-subgraph of GG. Since g​(G)=2​ℓ+1g(G)=2\ell+1 and each odd hole of GG has length 2​ℓ+12\ell+1, by simple computation we have the following result, which will be frequently used.

Lemma 2.3.

([1], Lemma 2.3.) Let CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. Let PP be a chordal path of CC, and P1,P2P_{1},P_{2} be the internally disjoint paths of CC that have the same ends as PP. Assume that |P||P| and |P1||P_{1}| have the same parity. Then

|P1|=1​or​ℓβ‰₯|P2|<|P1|=|P|β‰₯β„“+1.|P_{1}|=1\ \text{or}\ \ell\geq|P_{2}|<|P_{1}|=|P|\geq\ell+1.

In particular, when |P1|β‰₯2|P_{1}|\geq 2, all chordal paths of CC with the same ends as P1P_{1} have length |P1||P_{1}|.

Let C1,C2C_{1},C_{2} be odd holes of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell} such that C1βˆͺC2C_{1}\cup C_{2} is a theta subgraph GG. When C1βˆͺC2C_{1}\cup C_{2} is not induced, since |C1​Δ​C2|≀4​ℓ|C_{1}\Delta C_{2}|\leq 4\ell and g​(G)=2​ℓ+1g(G)=2\ell+1, we have that |C1​Δ​C2|=4​ℓ|C_{1}\Delta C_{2}|=4\ell and G​[V​(C1βˆͺC2)]G[V(C_{1}\cup C_{2})] is an odd K4K_{4}-subdivision. For the similar reason, if CC is an even hole of length 4​ℓ4\ell of GG, then CC has at most two chords, and when CC has two chords, G​[V​(C)]G[V(C)] is an odd K4K_{4}-subdivision.

Refer to caption
Figure 1: u1,u2,u3,u4u_{1},u_{2},u_{3},u_{4} are the degree-3 vertices of HH. The face cycles C1,C2C_{1},C_{2} are odd holes, and C3,C4C_{3},C_{4} are even holes. {P1,P2}\{P_{1},P_{2}\}, {Q1,Q2}\{Q_{1},Q_{2}\}, {L1,L2}\{L_{1},L_{2}\} are the pairs of vertex disjoint arrises of HH.

3 Graphs has a subgraph isomorphic to a K4K_{4}-subdivision

Let HH be a graph that is isomorphic to a K4K_{4}-subdivision. For a path PP of HH whose ends are degree-3 vertices of HH, if PP contains exactly two degree-3 vertices of HH, then we say it is an arris of HH. Evidently, HH has exactly six arrises. We say that a graph GG contins a balanced K4K_{4}-subdivision if GG has an induced subgraph HH isomorphic to a K4K_{4}-subdivision and exactly two face cycles of HH are odd holes of GG.

Lemma 3.1.

If a graph GG in 𝒒ℓ\mathcal{G}_{\ell} contains a balanced K4K_{4}-subdivision HH that is pictured as the graph in Figure 1, then the following hold.

  • (1)

    |P1|≀ℓ|P_{1}|\leq\ell and 1∈{|Q1|,|Q2|,|L1|,|L2|}1\in\{|Q_{1}|,|Q_{2}|,|L_{1}|,|L_{2}|\}.

  • (2)

    |P2|β‰₯β„“|P_{2}|\geq\ell.

  • (3)

    Assume that GG has no odd K4K_{4}-subdivision. If |Q1|=1|Q_{1}|=1 and |L2|β‰₯2|L_{2}|\geq 2, then no vertex v∈V​(G)βˆ’V​(H)v\in V(G)-V(H) has two neighbours in V​(H)V(H).

Proof.

Since C1,C2C_{1},C_{2} are odd holes and g​(G)=2​ℓ+1g(G)=2\ell+1, we have |P1|≀ℓ|P_{1}|\leq\ell. Assume that 1βˆ‰{|Q1|,|Q2|,|L1|,|L2|}1\notin\{|Q_{1}|,|Q_{2}|,|L_{1}|,|L_{2}|\}. Since P2​Q2P_{2}Q_{2} is a chordal path of C1C_{1} and C4C_{4} is an even hole, we have |P2|+|Q2|=|L1||P_{2}|+|Q_{2}|=|L_{1}| by Lemma 2.3. Similarly, we have |P2|+|L1|=|Q2||P_{2}|+|L_{1}|=|Q_{2}|, which is a contradiction. So (1) holds.

Now we consider (2). By (1) and symmetry we may assume that |Q1|=1|Q_{1}|=1. Since |P1|≀ℓ|P_{1}|\leq\ell by (1), we have |L1|β‰₯β„“|L_{1}|\geq\ell, so Q1​P2Q_{1}P_{2} is a chordal path of C2C_{2}. Then |Q1​P2|β‰₯β„“+1|Q_{1}P_{2}|\geq\ell+1 by Lemma 2.3. So |P2|β‰₯β„“|P_{2}|\geq\ell. This proves (2).

Next, we prove that (3) is true. Assume not. Let v∈V​(G)βˆ’V​(H)v\in V(G)-V(H) have at least two neighbours in V​(H)V(H). Since |L2|>1|L_{2}|>1 and C3C_{3} is an even hole, C2​Δ​C3C_{2}\Delta C_{3} is an odd hole and |L2|β‰₯β„“+1|L_{2}|\geq\ell+1 by Lemma 2.3. Moreover, since a vertex not in an odd hole has at most one neighbour in the odd hole, each arris of HH has at most one vertex adjacent to vv.

3.1.1.

The vertex vv has exactly one neighbour in V​(C1βˆͺC2)V(C_{1}\cup C_{2}) and exactly one neighbour in V​(P2βˆ—)V(P^{*}_{2}).

Subproof..

Since vv has at most one neighbour in V​(P2)V(P_{2}), it suffices to show that vv has at most one neighbour in V​(C1βˆͺC2)V(C_{1}\cup C_{2}). Assume not. Then vv has exactly two neighbours in V​(C1βˆͺC2)V(C_{1}\cup C_{2}) with one in V​(C1)βˆ’V​(P1)V(C_{1})-V(P_{1}) and the other in V​(C2)βˆ’V​(P2)V(C_{2})-V(P_{2}). Then G​[V​(C1βˆͺC2)βˆͺ{v}]G[V(C_{1}\cup C_{2})\cup\{v\}] is a balanced K4K_{4}-subdivision as GG has no odd K4K_{4}-subdivision, which is not possible by (2). ∎

Note that C2​Δ​C3C_{2}\Delta C_{3} is an odd hole. Since vv can not have two neighbours in an odd hole of HH, the vertex vv has no neighbour in V​(P1)V(P_{1}). For the same reason, if vv has a neighbour in V​(Q1βˆͺQ2)V(Q_{1}\cup Q_{2}), the neighbours of vv in V​(H)V(H) must be in V​(C1βˆͺC2)V(C_{1}\cup C_{2}), which is not possible by 3.1.1. Hence, N​(v)∩V​(C1βˆͺC2)βŠ†V​(L1βˆ—βˆͺL2βˆ—)N(v)\cap V(C_{1}\cup C_{2})\subseteq V(L^{*}_{1}\cup L^{*}_{2}). Assume that vv has a neighbour in V​(L1βˆ—)V(L^{*}_{1}). Since |C4|≀4β€‹β„“βˆ’2|C_{4}|\leq 4\ell-2 and g​(G)=2​ℓ+1g(G)=2\ell+1, by 3.1.1, the two cycles in G​[V​(C4)βˆͺ{v}]G[V(C_{4})\cup\{v\}] containing vv are odd holes. Moreover, since |L2|β‰₯β„“+1|L_{2}|\geq\ell+1, the subgraph G​[V​(C4)βˆͺ{v}]βˆͺP1βˆͺQ1G[V(C_{4})\cup\{v\}]\cup P_{1}\cup Q_{1} is an odd K4K_{4}-subdivision, which is not possible. Similarly we can show that vv can not have a neighbour in V​(L2βˆ—)V(L^{*}_{2}). This proves (3). ∎

Let HH be an induced subgraph of GG pictured as the graph in Figure 1. When |Q1|=1|Q_{1}|=1, we say that HH is a balanced K4K_{4}-subdivision of type (1,2)(1,2) if |L2|>1|L_{2}|>1. Since |Q1|=1|Q_{1}|=1 implies that |L1|>1|L_{1}|>1, this definition is well defined.

Let H1,H2H_{1},H_{2} be vertex disjoint induced subgraphs of a graph GG. An induced (v1,v2)(v_{1},v_{2})-path PP is a direct connection linking H1H_{1} and H2H_{2} if v1v_{1} is the only vertex in V​(P)V(P) having a neighbour in H1H_{1} and v2v_{2} is the only vertex in V​(P)V(P) having a neighbour in H2H_{2}. Evidently, the set of internal vertices of each shortest induced path joining H1H_{1} and H2H_{2} induces a direct connection linking H1H_{1} and H2H_{2}.

Theorem 3.2.

Let β„“β‰₯5\ell\geq 5 be an integer and GG be a graph in 𝒒ℓ\mathcal{G}_{\ell}. If GG is 44-vertex critical, then GG does not contain a balanced K4K_{4}-subdivision of type (1,2)(1,2).

Proof.

By Theorem 1.2, GG does not have an odd K4K_{4}-subdivision. Assume to the contrary that GG has a balanced K4K_{4}-subdivision HH of type (1,2)(1,2) that is pictured as the graph in Figure 1. Without loss of generality we may assume that HH is chosen with |H||H| as small as possible.By Lemma 3.1 (1) and symmetry we may assume that |Q1|=1|Q_{1}|=1. By Lemmas 3.1 (2) and 2.3, we have

|Q1|=1,|P2|β‰₯β„“,|L1|,|L2|β‰₯β„“+1,and​|P1|<β„“.|Q_{1}|=1,\ |P_{2}|\geq\ell,\ |L_{1}|,|L_{2}|\geq\ell+1,\ \text{and}\ |P_{1}|<\ell. (4.1)

Let e,fe,f be the edges in P2P_{2} incident with u3,u4u_{3},u_{4}, respectively. Let PP be a direct connection in G\{e,f}G\backslash\{e,f\} linking P2βˆ—P^{*}_{2} and Hβˆ’V​(P2βˆ—)H-V(P^{*}_{2}). Lemma 2.1 implies that such PP exists. Let v1,v2v_{1},v_{2} be the ends of PP with v2v_{2} having a neighbour in V​(P2βˆ—)V(P^{*}_{2}) and v1v_{1} having a neighbour in V​(H)βˆ’V​(P2βˆ—)V(H)-V(P^{*}_{2}). By Lemma 3.1 (3), both v1v_{1} and v2v_{2} have a unique neighbour in V​(H)V(H). Let xx be the neighbour of v1v_{1} in V​(H)V(H) and yy the neighbour of v2v_{2} in V​(H)V(H). Set Pβ€²:=x​v1​P​v2​yP^{\prime}:=xv_{1}Pv_{2}y. Then HβˆͺPβ€²H\cup P^{\prime} is an induced subgraph of GG. By Lemma 3.1 (3) again, we have |Pβ€²|β‰₯3|P^{\prime}|\geq 3.

3.2.1.

x≠u2x\neq u_{2}.

Subproof..

Assume that x=u2x=u_{2}. Set C3β€²:=L2​P2​(u4,y)​Pβ€²C^{\prime}_{3}:=L_{2}P_{2}(u_{4},y)P^{\prime}. Since |L2|β‰₯β„“+1|L_{2}|\geq\ell+1, we have that C3β€²C^{\prime}_{3} is an even hole by Lemma 2.3. Since |Pβ€²|β‰₯3|P^{\prime}|\geq 3 and C2​Δ​C3β€²C_{2}\Delta C^{\prime}_{3} is an odd hole, (HβˆͺPβ€²)βˆ’V​(L2βˆ—)(H\cup P^{\prime})-V(L^{*}_{2}) is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is a contradiction to the choice of HH. ∎

3.2.2.

xβˆ‰P1x\notin P_{1}.

Subproof..

Assume not. By 3.2.1, we have x∈V​(P1)βˆ’{u2}x\in V(P_{1})-\{u_{2}\}. Set C1β€²:=P1​(x,u2)​Q1​P2​(u3,y)​Pβ€²C^{\prime}_{1}:=P_{1}(x,u_{2})Q_{1}P_{2}(u_{3},y)P^{\prime}. Since |P1|<β„“|P_{1}|<\ell by (4.1), it follows from Lemma 2.3 that C1β€²C^{\prime}_{1} is an odd hole. Then P1​(x,u1)​Q2​P2​(u4,y)​Pβ€²P_{1}(x,u_{1})Q_{2}P_{2}(u_{4},y)P^{\prime} is an even hole. Moreover, since |L2|β‰₯β„“+1|L_{2}|\geq\ell+1, we have x=u1x=u_{1} and |Q2|=1|Q_{2}|=1 by Lemma 2.3. Since C1C_{1} and C1β€²C^{\prime}_{1} are odd holes, we have |L1|>|Pβ€²||L_{1}|>|P^{\prime}|. Moreover, since |Pβ€²|β‰₯3|P^{\prime}|\geq 3, the subgraph C1β€²βˆͺC2βˆͺP2C^{\prime}_{1}\cup C_{2}\cup P_{2} is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is a contradiction. ∎

3.2.3.

When x=u3x=u_{3}, we have |P2​(u3,y)|=1|P_{2}(u_{3},y)|=1 or |P2​(u3,y)|β‰₯β„“+1|P_{2}(u_{3},y)|\geq\ell+1.

Subproof..

Assume that |P2​(u3,y)|β‰ 1|P_{2}(u_{3},y)|\neq 1. Since Q1​P2Q_{1}P_{2} and Q1​P′​P2​(y,u4)Q_{1}P^{\prime}P_{2}(y,u_{4}) are chordal paths of C2C_{2} that have the same ends as L2L_{2}, they have length |L2||L_{2}| by Lemma 2.3. So |P2​(u3,y)​Pβ€²|=2​|P2​(u3,y)||P_{2}(u_{3},y)P^{\prime}|=2|P_{2}(u_{3},y)|, implying that |P2​(u3,y)|β‰₯β„“+1|P_{2}(u_{3},y)|\geq\ell+1. ∎

3.2.4.

If x∈V​(L1βˆ—)x\in V(L_{1}^{*}), then x​u3xu_{3}, y​u3∈E​(G)yu_{3}\in E(G), and |Q2|=1|Q_{2}|=1.

Subproof..

Set C3β€²:=L1​(x,u3)​P2​(u3,y)​Pβ€²C^{\prime}_{3}:=L_{1}(x,u_{3})P_{2}(u_{3},y)P^{\prime}. When C3β€²C^{\prime}_{3} is an odd hole, since C3′​Δ​C4C^{\prime}_{3}\Delta C_{4} is an odd hole, C1βˆͺC3β€²βˆͺP2βˆͺQ2C_{1}\cup C^{\prime}_{3}\cup P_{2}\cup Q_{2} is an odd K4K_{4}-subdivision, which is not possible. So C3β€²C^{\prime}_{3} is an even hole. Assume that x​u3βˆ‰E​(G)xu_{3}\notin E(G). Then |C3β€²|=2​|L1​(x,u3)||C^{\prime}_{3}|=2|L_{1}(x,u_{3})| by Lemma 2.3. Moreover, since C1​Δ​C3β€²C_{1}\Delta C^{\prime}_{3} is an odd hole, (HβˆͺPβ€²)βˆ’V​(L1βˆ—β€‹(x,u3))(H\cup P^{\prime})-V(L_{1}^{*}(x,u_{3})) is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is a contradiction to the choice of HH. So x​u3∈E​(G)xu_{3}\in E(G).

Assume that y​u3βˆ‰E​(P2)yu_{3}\notin E(P_{2}). Since Q1​P2Q_{1}P_{2} and Q1​L1​(u3,x)​P′​P2​(y,u4)Q_{1}L_{1}(u_{3},x)P^{\prime}P_{2}(y,u_{4}) are chordal paths of C2C_{2} that have the same ends as L2L_{2}, they have length |L2||L_{2}| by Lemma 2.3. Moreover, since x​u3∈E​(G)xu_{3}\in E(G) and |L1|β‰₯β„“+1|L_{1}|\geq\ell+1 imply |L1​(x,u1)|β‰₯2|L_{1}(x,u_{1})|\geq 2, the subgraph (HβˆͺPβ€²)βˆ’V​(P2βˆ—β€‹(y,u3))(H\cup P^{\prime})-V(P_{2}^{*}(y,u_{3})) is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is a contradiction. So y​u3∈E​(P2)yu_{3}\in E(P_{2}), implying that |Pβ€²|β‰₯2​ℓ|P^{\prime}|\geq 2\ell. Since C3′​Δ​C3​Δ​C1C^{\prime}_{3}\Delta C_{3}\Delta C_{1} is an odd cycle of length at least 2​ℓ+32\ell+3, we have |Q2|=1|Q_{2}|=1. This proves 3.2.4. ∎

3.2.5.

xβˆ‰V​(Q2βˆ—)x\notin V(Q^{*}_{2}).

Subproof..

Assume not. Set C3β€²:=Q2​(x,u4)​P2​(u4,y)​Pβ€²C^{\prime}_{3}:=Q_{2}(x,u_{4})P_{2}(u_{4},y)P^{\prime}. Assume that C3β€²C^{\prime}_{3} is an odd hole. Since C1βˆͺC2βˆͺ(C3​Δ​C3β€²)C_{1}\cup C_{2}\cup(C_{3}\Delta C^{\prime}_{3}) is an odd K4K_{4}-subdivision when y​u4βˆ‰E​(P2)yu_{4}\notin E(P_{2}), we have y​u4∈E​(P2)yu_{4}\in E(P_{2}). Since |Q2|<β„“|Q_{2}|<\ell as |L2|β‰₯β„“+1|L_{2}|\geq\ell+1, the graph C4​Δ​C3β€²C_{4}\Delta C^{\prime}_{3} is an odd hole with length larger than 3​ℓ3\ell by (4.1), which is not possible. So C3β€²C^{\prime}_{3} is an even hole. Since |Q2|<β„“|Q_{2}|<\ell, it follows from Lemma 2.3 that x​u4∈E​(Q2)xu_{4}\in E(Q_{2}). Moreover, since Pβ€²P^{\prime} is a chordal path of the odd hole C2​Δ​C3C_{2}\Delta C_{3} and C3β€²C^{\prime}_{3} is an even hole, β„“+1≀|Pβ€²|=|P2​(y,u4)|+1≀|P2|<|L1|\ell+1\leq|P^{\prime}|=|P_{2}(y,u_{4})|+1\leq|P_{2}|<|L_{1}| by Lemma 2.3. Hence, C2βˆͺC3βˆͺPβ€²C_{2}\cup C_{3}\cup P^{\prime} is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is a contradiction. ∎

Let u4β€²u^{\prime}_{4} be the neighbour of u4u_{4} in L2L_{2}.

3.2.6.

If x∈V​(L2)x\in V(L_{2}), then x∈{u4,u4β€²}x\in\{u_{4},u^{\prime}_{4}\}. In particular, when x=u4β€²x=u^{\prime}_{4}, we have y​u4∈E​(P2)yu_{4}\in E(P_{2}); and when x=u4x=u_{4}, we have y​u4∈E​(P2)yu_{4}\in E(P_{2}) or |P2​(y,u4)|β‰₯β„“+1|P_{2}(y,u_{4})|\geq\ell+1.

Subproof..

Set C3β€²:=L2​(x,u4)​P2​(u4,y)​Pβ€²C^{\prime}_{3}:=L_{2}(x,u_{4})P_{2}(u_{4},y)P^{\prime}. Assume that x=u4x=u_{4} and y​u4βˆ‰E​(P2)yu_{4}\notin E(P_{2}). Since Q1​P2Q_{1}P_{2} and Q1​P2​(u3,y)​Pβ€²Q_{1}P_{2}(u_{3},y)P^{\prime} are chordal paths of C2C_{2} with the same ends, |C3β€²|=2​|P2​(y,u4)||C^{\prime}_{3}|=2|P_{2}(y,u_{4})| by Lemma 2.3, so |P2​(y,u4)|β‰₯β„“+1|P_{2}(y,u_{4})|\geq\ell+1. That is, when x=u4x=u_{4}, 3.2.6 holds. So we may assume that xβ‰ u4x\neq u_{4}.

By 3.2.2, we may assume that x∈V​(L2βˆ—)x\in V(L^{*}_{2}). When C3β€²C^{\prime}_{3} is an odd hole, since xβˆ‰{u2,u4}x\notin\{u_{2},u_{4}\}, the graph C2βˆͺC3βˆͺPβ€²C_{2}\cup C_{3}\cup P^{\prime} is an odd K4K_{4}-subdivision. So C3β€²C^{\prime}_{3} is an even hole. When xβ‰ u4β€²x\neq u^{\prime}_{4}, by Lemma 2.3, we have that x​u2∈E​(H)xu_{2}\in E(H), |C3β€²|=2​|L2​(x,u4)||C^{\prime}_{3}|=2|L_{2}(x,u_{4})| and C3​Δ​C3β€²C_{3}\Delta C^{\prime}_{3} is an odd hole, so (HβˆͺPβ€²)βˆ’V​(L2βˆ—β€‹(x,u4))(H\cup P^{\prime})-V(L_{2}^{*}(x,u_{4})) is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is not possible. Hence, x=u4β€²x=u^{\prime}_{4}. When y​u4βˆ‰E​(P2)yu_{4}\notin E(P_{2}), since Q1​P2​(u3,y)​Pβ€²Q_{1}P_{2}(u_{3},y)P^{\prime} is a chordal path of C2C_{2}, we have |C3β€²|=2​|P2​(y,u4)||C^{\prime}_{3}|=2|P_{2}(y,u_{4})| by Lemma 2.3. So (HβˆͺPβ€²)βˆ’V​(P2βˆ—β€‹(y,u4))(H\cup P^{\prime})-V(P_{2}^{*}(y,u_{4})) is a balanced K4K_{4}-subdivision of type (1,2)(1,2) whose edge number is less than |H||H|, which is not possible. So y​u4∈E​(G)yu_{4}\in E(G). ∎

Let vv be a vertex in V​(P2βˆ—)V(P^{*}_{2}). When |P2|β‰₯β„“+1|P_{2}|\geq\ell+1, let |P2​(u3,v)|=β„“βˆ’1|P_{2}(u_{3},v)|=\ell-1, otherwise let |P2​(u3,v)|=β„“βˆ’2β‰₯3|P_{2}(u_{3},v)|=\ell-2\geq 3. The vertex vv is well defined as |P2|β‰₯β„“|P_{2}|\geq\ell. Since |P2|≀2β€‹β„“βˆ’2|P_{2}|\leq 2\ell-2, we have 2≀|P2​(u4,v)|β‰€β„“βˆ’12\leq|P_{2}(u_{4},v)|\leq\ell-1. Let u,w∈N​(v)∩V​(P2βˆ—)u,w\in N(v)\cap V(P^{*}_{2}) with uu closer to u4u_{4} and ww closer to u3u_{3} along P2P_{2}. Since {u​v,v​w}\{uv,vw\} is not an edge cut of GG by Lemma 2.1, there is a shortest induced path QQ in G\{u​v,v​w}G\backslash\{uv,vw\} linking vv and Hβˆ’vH-v. By Lemma 3.1 (3), HβˆͺQH\cup Q is an induced subgraph of GG. Let vβ€²v^{\prime} be the other end of QQ that is not equal to vv. When vβ€²βˆˆV​(C1βˆͺC2)v^{\prime}\in V(C_{1}\cup C_{2}), since Qβˆ—Q^{*} is a direct connection in G\{e,f}G\backslash\{e,f\} linking P2βˆ—P_{2}^{*} and Hβˆ’V​(P2βˆ—)H-V(P^{*}_{2}), we get a contradiction to 3.2.2-3.2.6. So vβ€²βˆˆV​(P2βˆ—)βˆ’{v}v^{\prime}\in V(P^{*}_{2})-\{v\}. Assume that vβ€²βˆˆV​(P2βˆ—β€‹(u3,v))v^{\prime}\in V(P_{2}^{*}(u_{3},v)). When vβ€²β‰ wv^{\prime}\neq w, either Q2​P1​Q1​P2​(u3,vβ€²)​Q​P2​(v,u4)Q_{2}P_{1}Q_{1}P_{2}(u_{3},v^{\prime})QP_{2}(v,u_{4}) is an odd hole of length at least 2​ℓ+32\ell+3 or Q​P2​(v,vβ€²)QP_{2}(v,v^{\prime}) is a cycle of length 2​|P2​(v,vβ€²)|2|P_{2}(v,v^{\prime})| that is at most 2β€‹β„“βˆ’22\ell-2 by the choice of vv, which is not possible. So vβ€²=wv^{\prime}=w. By symmetry, we have vβ€²βˆˆ{u,w}v^{\prime}\in\{u,w\}.

Now we show that {v,vβ€²}\{v,v^{\prime}\} is a K2K_{2}-cut of GG, implying that Theorem 3.2 holds from Lemma 2.2. Assume not. Let Rβ€²R^{\prime} be a direct connection in Gβˆ’{v,vβ€²}G-\{v,v^{\prime}\} linking Qβˆ—Q^{*} and Hβˆ’{v,vβ€²}H-\{v,v^{\prime}\}. Let s1,s2s_{1},s_{2} be the ends of Rβ€²R^{\prime} with s1s_{1} having a neighbour in V​(H)βˆ’{v,vβ€²}V(H)-\{v,v^{\prime}\} and s2s_{2} having a neighbour in V​(Qβˆ—)V(Q^{*}). By Lemma 3.1 (3), s1s_{1} has a unique neighbour, say t1t_{1}, in V​(H)βˆ’{v,vβ€²}V(H)-\{v,v^{\prime}\}. Since QQ is chosen with |Q||Q| as small as possible, s2s_{2} has a unique neighbour, say t2t_{2}, in V​(Qβˆ—)V(Q^{*}). Set R:=t1​s1​R′​s2​t2R:=t_{1}s_{1}R^{\prime}s_{2}t_{2}. Then HβˆͺQβˆͺRH\cup Q\cup R is an induced subgraph of GG or some vertex in {v,vβ€²}\{v,v^{\prime}\} has a neighbour in V​(Rβ€²)V(R^{\prime}). When t1∈V​(P2)t_{1}\in V(P_{2}), let P2β€²P^{\prime}_{2} be an induced (u3,u4)(u_{3},u_{4})-path in P2βˆͺQβˆͺRP_{2}\cup Q\cup R that is not equal to P2P_{2}. Since Q1​P2β€²Q_{1}P^{\prime}_{2} is a chordal path of C2C_{2} with length |L2||L_{2}| by Lemma 2.3, there is a cycle in P2βˆͺP2β€²P_{2}\cup P^{\prime}_{2} with length at most 2​ℓ2\ell by the choice of vv, which is not possible. So t1∈V​(H)βˆ’V​(P2)t_{1}\in V(H)-V(P_{2}). Then RβˆͺQβˆ—R\cup Q^{*} contains a direct connection in G\{e,f}G\backslash\{e,f\} linking P2βˆ—P_{2}^{*} and Hβˆ’V​(P2βˆ—)H-V(P_{2}^{*}). Since |P2​(u3,v)|β‰₯β„“βˆ’2β‰₯3|P_{2}(u_{3},v)|\geq\ell-2\geq 3 and 2≀|P2​(u4,v)|β‰€β„“βˆ’12\leq|P_{2}(u_{4},v)|\leq\ell-1, by 3.2.2-3.2.6, we have that vβ€²=uv^{\prime}=u, t1=u4β€²t_{1}=u^{\prime}_{4}, and u​u4∈E​(P2)uu_{4}\in E(P_{2}). Let P2β€²P^{\prime}_{2} be an induced (u3,u4β€²)(u_{3},u^{\prime}_{4})-path in (P2βˆ’{u4})βˆͺQβˆͺR(P_{2}-\{u_{4}\})\cup Q\cup R. Since Q1​P2β€²Q_{1}P^{\prime}_{2} and Q1​P2Q_{1}P_{2} are chordal paths of C2C_{2}, by Lemma 2.3, we have |P2′​(u4β€²,v)|=|P2​(u4,v)|βˆ’1|P^{\prime}_{2}(u^{\prime}_{4},v)|=|P_{2}(u_{4},v)|-1, so u4′​v∈E​(G)u^{\prime}_{4}v\in E(G), which is not possible. ∎

4 Jumps over an odd hole

Let CC be an odd hole of a graph GG and s,t∈V​(C)s,t\in V(C) nonadjacent. Let PP be an induced (s,t)(s,t)-path. If V​(C)∩V​(Pβˆ—)=βˆ…V(C)\cap V(P^{*})=\emptyset, we call PP a jump or an (s,t)(s,t)-jump over CC. Let Q1,Q2Q_{1},Q_{2} be the internally disjoint (s,t)(s,t)-paths of CC. If some vertex in V​(Q1βˆ—)V(Q^{*}_{1}) has a neighbour in V​(Pβˆ—)V(P^{*}) and no vertex in V​(Q2βˆ—)V(Q^{*}_{2}) has a neighbour in V​(Pβˆ—)V(P^{*}), we say that PP is a local jump over CC across Q1βˆ—Q^{*}_{1}. When there is no need to strengthen Q1βˆ—Q^{*}_{1}, we will also say that PP is a local jump over CC. In particular, when |V​(Q1βˆ—)|=1|V(Q^{*}_{1})|=1, we say that PP is a local jump over CC across one vertex. When no vertex in V​(Q1βˆ—βˆͺQ2βˆ—)V(Q^{*}_{1}\cup Q^{*}_{2}) has a neighbour in V​(Pβˆ—)V(P^{*}), we say that PP is a short jump over CC. Hence, short jumps over CC are chordal paths of CC. But chordal paths over CC maybe not short jumps over CC as the ends of a chordal path maybe adjacent. When PP is a short jump over CC, if P​Q1PQ_{1} is an odd hole, we say that P​Q1PQ_{1} is a jump hole over CC and PP is a short jump over CC across Q1βˆ—Q^{*}_{1}. Note that our definition of local jumps over CC is a little different from the definition given in [2]. By our definitions, no short jump over CC is local.

Lemma 4.1.

Let CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. Let P,Q1,Q2P,Q_{1},Q_{2} be defined as the last paragraph. If PP is a local or short jump over CC across Q1βˆ—Q^{*}_{1}, then |P|,|Q2||P|,|Q_{2}| have the same parity, that is, P​Q2PQ_{2} is an even hole and P​Q1PQ_{1} is an odd cycle.

Proof.

When PP is short, the lemma holds from its definition. So we may assume that PP is local. Since some vertex in V​(Q1βˆ—)V(Q^{*}_{1}) has a neighbour in V​(Pβˆ—)V(P^{*}) and g​(G)=2​ℓ+1g(G)=2\ell+1, we have |P|β‰₯2​ℓ|P|\geq 2\ell. So P​Q2PQ_{2} is an even hole. This proves Lemma 4.1. ∎

Let CC be a cycle of a graph GG and e,fe,f be chords of CC. If no cycle in CβˆͺeC\cup e containing ee contains the two ends of ff, we say e,fe,f are crossing; otherwise they are uncrossing. Note that by our definition, e,fe,f are uncrossing when they share an end. When CC is an odd hole and PiP_{i} is an (ui,vi)(u_{i},v_{i})-jump over CC for each integer 1≀i≀21\leq i\leq 2, if u1​v1u_{1}v_{1} and u2​v2u_{2}v_{2} are uncrossing chords of CC after we replace P1P_{1} by the edge u1​v1u_{1}v_{1} and P1P_{1} by the edge u2​v2u_{2}v_{2}, we say that P1,P2P_{1},P_{2} are uncrossing; otherwise, they are crossing.

Lemma 4.2.

Let CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. If a jump PP over CC is not local, then G​[V​(CβˆͺP)]G[V(C\cup P)] contains a short jump over CC.

Proof.

Without loss of generality we may assume that PP is not a short jump over CC. Let s,ts,t be the ends of PP and Q1,Q2Q_{1},Q_{2} be the internally disjoint (s,t)(s,t)-paths of CC. Since PP is neither local nor short, there are u1,u2∈V​(Pβˆ—)u_{1},u_{2}\in V(P^{*}) such that u1u_{1} has a neighbour in V​(Q1βˆ—)V(Q_{1}^{*}) and u2u_{2} has a neighbour in V​(Q2βˆ—)V(Q_{2}^{*}), and such that no vertex in V​(Pβˆ—β€‹(u1,u2))V(P^{*}(u_{1},u_{2})) has a neighbour in V​(C)V(C). Since no vertex outside an odd hole has two neighbours in the odd hole, u1β‰ u2u_{1}\neq u_{2} and uiu_{i} has a unique neighbour, say wiw_{i}, in V​(C)V(C) for each integer 1≀i≀21\leq i\leq 2. Then w1​u1​P​(u1,u2)​u2​w2w_{1}u_{1}P(u_{1},u_{2})u_{2}w_{2} is a short jump over CC. This proves Lemma 4.2. ∎

Lemma 4.3.

Let CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. If PP is a local (v1,v2)(v_{1},v_{2})-jump over CC, then G​[V​(CβˆͺP)]G[V(C\cup P)] contains a local jump over CC across one vertex or a short jump over CC.

Proof.

Assume not. Among all local jumps over CC not satisfying Lemma 4.3, let PP be chosen with |P||P| as small as possible. Let u1,u2∈V​(Pβˆ—)u_{1},u_{2}\in V(P^{*}) have a neighbour in V​(C)βˆ’{v1,v2}V(C)-\{v_{1},v_{2}\} that are closest to v1,v2v_{1},v_{2}, respectively. Let w1,w2w_{1},w_{2} be the unique neighbour of u1,u2u_{1},u_{2} in V​(C)V(C), respectively. Since w1​u1​P​(u1,v1)w_{1}u_{1}P(u_{1},v_{1}) is a short jump over CC when w1​v1βˆ‰E​(G)w_{1}v_{1}\notin E(G), we have w1​v1∈E​(G)w_{1}v_{1}\in E(G). Similarly, we have w2​v2∈E​(G)w_{2}v_{2}\in E(G). Hence, when u1=u2u_{1}=u_{2}, w1=w2w_{1}=w_{2} and w1w_{1} is adjacent to v1,v2v_{1},v_{2}, which is a contradiction. So u1β‰ u2u_{1}\neq u_{2}. Since PP is not a local jump over CC across one vertex, we have w1β‰ w2w_{1}\neq w_{2}. Let u3u_{3} be the neighbour of w1w_{1} in V​(Pβˆ—)V(P^{*}) closest to v2v_{2}. Note that u3u_{3} maybe equal to u1u_{1}. By the choice of u2u_{2}, we have u2∈V​(P​(u3,v2))u_{2}\in V(P(u_{3},v_{2})). Set Pβ€²:=w1​u3​P​(u3,v2)P^{\prime}:=w_{1}u_{3}P(u_{3},v_{2}). Since Pβ€²P^{\prime} is a local jump over CC with |Pβ€²|<|P||P^{\prime}|<|P|, by the choice of PP, the subgraph G​[V​(CβˆͺPβ€²)]G[V(C\cup P^{\prime})] contains a local jump over CC across one vertex or a short jump over CC, so is G​[V​(CβˆͺP)]G[V(C\cup P)], which is a contradiction. This proves Lemma 4.3. ∎

Let CC be a cycle and suppose that x1,x2,…,xn∈V​(C)x_{1},x_{2},\ldots,x_{n}\in V(C) occur on CC in this cyclic order with nβ‰₯3n\geq 3. For any two distinct xix_{i} and xjx_{j}, the cycle CC contains two (xi,xj)(x_{i},x_{j})-paths. Let C​(xi,xi+1,…,xj)C(x_{i},x_{i+1},\ldots,x_{j}) denote the (xi,xj)(x_{i},x_{j})-path in CC containing xi,xi+1,…,xjx_{i},x_{i+1},\ldots,x_{j} (and not containing xj+1x_{j+1} if iβ‰ j+1i\neq j+1), where subscripts are modulo nn. Such path is uniquely determined as nβ‰₯3n\geq 3.

Lemma 4.4.

Let CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}, and PiP_{i} be a short (ui,vi)(u_{i},v_{i})-jump over CC for each integer 1≀i≀21\leq i\leq 2. If P1,P2P_{1},P_{2} are crossing, then GG contains an odd K4K_{4}-subdivision or a balanced K4K_{4}-subdivision of type (1,2)(1,2).

Proof.

Since P1,P2P_{1},P_{2} are short jumps over CC, either P1​C​(v1,u2)​P2​C​(v2,u1)P_{1}C(v_{1},u_{2})P_{2}C(v_{2},u_{1}) or P1​C​(u1,u2)​P2​C​(v2,v1)P_{1}C(u_{1},u_{2})P_{2}C(v_{2},v_{1}) has length at most 4​ℓ4\ell by Lemma 2.3. By symmetry we may assume that the first cycle is shorter than the last one. Set Cβ€²:=P1​C​(v1,u2)​P2​C​(v2,u1)C^{\prime}:=P_{1}C(v_{1},u_{2})P_{2}C(v_{2},u_{1}). Since g​(G)=2​ℓ+1g(G)=2\ell+1, either Cβ€²C^{\prime} is a hole or |Cβ€²|=4​ℓ|C^{\prime}|=4\ell and Cβ€²C^{\prime} has exactly one or two chords. When Cβ€²C^{\prime} is a hole, implying that |C​(u1,u2)|,|C​(v2,v1)|β‰₯2|C(u_{1},u_{2})|,|C(v_{2},v_{1})|\geq 2, the subgraph CβˆͺP1βˆͺP2C\cup P_{1}\cup P_{2} is induced and isomorphic to a balanced K4K_{4}-subdivision of type (1,2)(1,2). So we may assume that |Cβ€²|=4​ℓ|C^{\prime}|=4\ell and Cβ€²C^{\prime} has exactly one or two chords. Since |Cβ€²|=4​ℓ|C^{\prime}|=4\ell and g​(G)=2​ℓ+1g(G)=2\ell+1, all cycles in G​[V​(Cβ€²)]G[V(C^{\prime})] using exactly one chord of Cβ€²C^{\prime} are odd holes. Hence, when Cβ€²C^{\prime} has exactly two chords, the two chords of Cβ€²C^{\prime} are crossing and G​[V​(Cβ€²)]G[V(C^{\prime})] is isomorphic to an odd K4K_{4}-subdivision; and when Cβ€²C^{\prime} has exactly one chord, GG contains a balanced K4K_{4}-subdivision of type (1,2)(1,2). ∎

The proofs of Lemma 4.5 and Theorem 4.6 use some ideas in [2].

Lemma 4.5.

Let β„“β‰₯4\ell\geq 4 be an integer and CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. For any integer 1≀i≀21\leq i\leq 2, let PiP_{i} be a short or local (ui,vi)(u_{i},v_{i})-jump over CC such that {u1,v1}β‰ {u2,v2}\{u_{1},v_{1}\}\neq\{u_{2},v_{2}\} and u1,u2,v2,v1u_{1},u_{2},v_{2},v_{1} appear on CC in this order. Assume that PiP_{i} is across Cβˆ—β€‹(ui,vi)C^{*}(u_{i},v_{i}) and if PiP_{i} is local, we have |V​(Cβˆ—β€‹(ui,vi))|=1|V(C^{*}(u_{i},v_{i}))|=1 for any integer 1≀i≀21\leq i\leq 2. Then the following hold.

  • (1)

    When P1,P2P_{1},P_{2} are short, GG has an odd K4K_{4}-subdivision.

  • (2)

    At most two vertices in V​(C​(u1,v1)βˆͺC​(u2,v2))V(C(u_{1},v_{1})\cup C(u_{2},v_{2})) are not in a jump hole over CC.

Proof.

Without loss of generality we may assume that P1,P2P_{1},P_{2} are chosen with P1βˆ—βˆͺP2βˆ—P_{1}^{*}\cup P_{2}^{*} minimal. Set H:=P1βˆͺP2βˆͺC​(u1,u2)βˆͺC​(v1,v2)H:=P_{1}\cup P_{2}\cup C(u_{1},u_{2})\cup C(v_{1},v_{2}). By symmetry we may assume that |C​(u1,u2)|≀|C​(v1,v2)|β‰₯1|C(u_{1},u_{2})|\leq|C(v_{1},v_{2})|\geq 1. Note that u1u_{1} maybe equal to u2u_{2}.

4.5.1.

(1) is true.

Subproof..

Since P1,P2P_{1},P_{2} are short jumps over CC, by Lemmas 2.3 and 4.1, |P1βˆͺP2|≀4β€‹β„“βˆ’2|P_{1}\cup P_{2}|\leq 4\ell-2 and |H||H| is odd and at most 6β€‹β„“βˆ’56\ell-5. Then P1βˆͺP2P_{1}\cup P_{2} contains at most one cycle. By the choice of P1P_{1} and P2P_{2}, the subgraph P1βˆͺP2P_{1}\cup P_{2} contains no cycle. So HH has at most two cycles. When HH has exactly two cycles, since |H|≀6β€‹β„“βˆ’5|H|\leq 6\ell-5, one cycle in HH is a hole, so we can find a new short jump over CC to replace one of P1,P2P_{1},P_{2} and get a contradiction to the choice of P1,P2P_{1},P_{2}. Hence, HH contains a unique cycle Cβ€²C^{\prime}. Since g​(G)=2​ℓ+1g(G)=2\ell+1, the cycle Cβ€²C^{\prime} contains at most two chords, and the two chords are uncrossing when Cβ€²C^{\prime} has two chords. No matter which case happens, G​[V​(P1βˆͺP2)]G[V(P_{1}\cup P_{2})] contains two short jumps Q1,Q2Q_{1},Q_{2} over CC such that CβˆͺQ1βˆͺQ2C\cup Q_{1}\cup Q_{2} is isomorphic to an odd K4K_{4}-subdivision. So (1) holds. ∎

By 4.5.1, we may assume that some PiP_{i} is local. For any integer 1≀i≀21\leq i\leq 2, let ai,bia_{i},b_{i} be the vertices in V​(Pi)V(P_{i}) adjacent to ui,viu_{i},v_{i}, respectively, and set Di:=Piβˆ—βˆ’{ai,bi}D_{i}:=P_{i}^{*}-\{a_{i},b_{i}\}. Since β„“β‰₯3\ell\geq 3, both D1D_{1} and D2D_{2} are nonempty by Lemma 2.3. Since v1β‰ v2v_{1}\neq v_{2} and P1,P2P_{1},P_{2} are jumps over CC across Cβˆ—β€‹(u1,v1)C^{*}(u_{1},v_{1}) and Cβˆ—β€‹(u2,v2)C^{*}(u_{2},v_{2}) respectively, we have that b1β‰ b2b_{1}\neq b_{2} and they are nonadjacent.

We say two vertex disjoint subgraphs of a graph are anticomplete if there are no edges between them.

4.5.2.

Either (2) is true or D1βˆͺ{b1}D_{1}\cup\{b_{1}\} is disjoint and anticomplete to D2βˆͺ{b2}D_{2}\cup\{b_{2}\}.

Subproof..

Assume not. Since b1β‰ b2b_{1}\neq b_{2} and they are nonadjacent, by symmetry we may assume that G​[V​(D1βˆͺD2)βˆͺ{b1}]G[V(D_{1}\cup D_{2})\cup\{b_{1}\}] is connected. We claim that P2P_{2} is short. Assume not. Let tt be the vertex in V​(C)V(C) adjacent to u2,v2u_{2},v_{2}. Since D2β‰ βˆ…D_{2}\neq\emptyset, there is a minimal path QQ linking V​(C​(u1,v1))βˆ’{u1}V(C(u_{1},v_{1}))-\{u_{1}\} and tt with interior in V​(D1βˆͺD2)βˆͺ{b1}V(D_{1}\cup D_{2})\cup\{b_{1}\}. Let ss be the other end of QQ. Since (2) holds when sβ‰ v1s\neq v_{1}, we have s=v1s=v_{1}. When QQ is across V​(Cβˆ—β€‹(v1,u1,u2,t))V(C^{*}(v_{1},u_{1},u_{2},t)), (2) holds; when QQ is across V​(Cβˆ—β€‹(v1,v2,t))V(C^{*}(v_{1},v_{2},t)), replacing P2P_{2} by QQ, we get a contradiction to the choice of P1,P2P_{1},P_{2}. Hence, P2P_{2} is short, implying that P1P_{1} is local and u1β‰ u2u_{1}\neq u_{2}, for otherwise (2) holds.

Let QQ be a minimal (s,t)(s,t)-path linking V​(C​(u1,v1))βˆ’{u1}V(C(u_{1},v_{1}))-\{u_{1}\} and {u2,v2}\{u_{2},v_{2}\} with interior in V​(D1βˆͺP2βˆ—)βˆͺ{b1}V(D_{1}\cup P^{*}_{2})\cup\{b_{1}\}, with s∈V​(C​(u1,v1))βˆ’{u1}s\in V(C(u_{1},v_{1}))-\{u_{1}\} and t∈{u2,v2}t\in\{u_{2},v_{2}\}. Since no vertex in V​(C)βˆ’{s,t}V(C)-\{s,t\} has a neighbour in V​(Qβˆ—)V(Q^{*}), either QQ is a short (s,t)(s,t)-jump over CC or s​t∈E​(C)st\in E(C). Assume that s​t∈E​(C)st\in E(C). Since 1≀|C​(u1,u2)|≀|C​(v1,v2)|1\leq|C(u_{1},u_{2})|\leq|C(v_{1},v_{2})|, we have s=v1s=v_{1}, t=v2t=v_{2}, and |C​(u1,u2)|=1|C(u_{1},u_{2})|=1. Since P2P_{2} is short and P1P_{1} is across one vertex, by Lemmas 2.3 and 4.1, we have |P2|=|C​(u2,u1,v1,v2)|=4β‰₯β„“+1|P_{2}|=|C(u_{2},u_{1},v_{1},v_{2})|=4\geq\ell+1, so ℓ≀3\ell\leq 3, which contradicts to the fact that β„“β‰₯4\ell\geq 4. Hence, QQ is a short (s,t)(s,t)-jump over CC.

When t=u2t=u_{2}, since P1P_{1} is local and 1≀|C​(u1,u2)|≀|C​(v1,v2)|1\leq|C(u_{1},u_{2})|\leq|C(v_{1},v_{2})|, the short jump QQ is across V​(Cβˆ—β€‹(s,u1,u2))V(C^{*}(s,u_{1},u_{2})), so (2) holds as P1P_{1} is short. When t=v2t=v_{2}, either (2) holds or we can replace P1P_{1} by QQ to get a contradiction to the choice of P1,P2P_{1},P_{2}. This proves 4.5.2 as t∈{u2,v2}t\in\{u_{2},v_{2}\}. ∎

By 4.5.2, we may assume that D1βˆͺ{b1}D_{1}\cup\{b_{1}\} is disjoint and anticomplete to D2βˆͺ{b2}D_{2}\cup\{b_{2}\}. By Lemma 4.1, |H||H| is odd and at least 2​ℓ+32\ell+3. By symmetry and 4.5.2, we may assume that a1a_{1} has a neighbour in V​(D2)βˆͺ{b2}V(D_{2})\cup\{b_{2}\}. Let ww be the vertex in N​(a1)∩(V​(D2)βˆͺ{b2})N(a_{1})\cap(V(D_{2})\cup\{b_{2}\}) closest to v2v_{2} along P2P_{2}. Set Q:=u1​a1​w​P2​(w,v2)Q:=u_{1}a_{1}wP_{2}(w,v_{2}). Then QQ is a jump of CC. Since (2) holds when QQ is short, we may assume that QQ is not short, implying that P2P_{2} is local and the vertex adjacent to v2,u2v_{2},u_{2} has a neighbour in V​(P2​(w,v2))V(P_{2}(w,v_{2})). Then |Q|β‰₯3β€‹β„“βˆ’1|Q|\geq 3\ell-1, implying that P1​(a1,v1)​C​(v1,v2)​Q​(v2,a1)P_{1}(a_{1},v_{1})C(v_{1},v_{2})Q(v_{2},a_{1}) is an even hole by 4.5.2. Hence, by Lemma 4.1, C​(u1,v1,v2)​QC(u_{1},v_{1},v_{2})Q is an odd hole of length at least 3​ℓ+23\ell+2, which is not possible. ∎

Theorem 4.6.

Let β„“β‰₯5\ell\geq 5 be an integer and CC be an odd hole of a graph Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell}. Then one of the following holds.

  • (1)

    GG has an odd K4K_{4}-subdivision.

  • (2)

    GG contains a balanced K4K_{4}-subdivision of type (1,2)(1,2).

  • (3)

    GG has a P3P_{3}-cut.

  • (4)

    GG has a degree-22 vertex.

Proof.

Assume that neither (1) nor (2) is true. Set C:=v1​v2​…​v2​ℓ+1​v1C:=v_{1}v_{2}\ldots v_{2\ell+1}v_{1}. Let PP be a short jump over CC with |P||P| as small as possible. By symmetry we may assume that the ends of PP are v2,vkv_{2},v_{k} with k≀ℓ+2k\leq\ell+2. By Lemmas 4.5 (1), 4.4 and 2.3, we may assume that all short jumps over CC have ends in {v2,v3,…,vk}\{v_{2},v_{3},\ldots,v_{k}\}. That is, (i) no jump hole over CC contains a vertex in V​(C)βˆ’{v2,v3,…,vk}V(C)-\{v_{2},v_{3},\ldots,v_{k}\}.

For each integer 1≀i≀21\leq i\leq 2, let PiP_{i} be a local (si,ti)(s_{i},t_{i})-jump over CC across one vertex and QiQ_{i} be the (si,ti)(s_{i},t_{i})-path on CC of length three. When P1P_{1} and P2P_{2} are uncrossing, by (i) and Lemma 4.5 (2), |V​(Q1βˆͺQ2)βˆ’{v2,v3,…,vk}|≀2|V(Q_{1}\cup Q_{2})-\{v_{2},v_{3},\ldots,v_{k}\}|\leq 2. When P1P_{1} and P2P_{2} are crossing, |Q1βˆͺQ2|=4|Q_{1}\cup Q_{2}|=4. Since there is no short jump over CC or at least one vertex in {si,ti}\{s_{i},t_{i}\} is in {v2,v3,…,vk}\{v_{2},v_{3},\ldots,v_{k}\} by Lemma 4.5 (2), by possibly reordering we may assume that all local jumps over CC across one vertex have ends in {v1,v2,…,vk,vk+1}\{v_{1},v_{2},\ldots,v_{k},v_{k+1}\} with 4≀k≀ℓ+24\leq k\leq\ell+2. For any integer 1≀i≀k+11\leq i\leq k+1, let XiX_{i} be the set of vertices adjacent to viv_{i} that are in a local jump over CC across one vertex with one end viv_{i} or a short jump over CC with one end viv_{i}. Set X:=X1βˆͺX2βˆͺβ‹―βˆͺXk+1X:=X_{1}\cup X_{2}\cup\cdots\cup X_{k+1}. Then XX intersects all short jumps over CC and all local jumps over CC across one vertex in at least two vertices.

Since β„“β‰₯5\ell\geq 5 and k≀ℓ+2k\leq\ell+2, we have k+3≀2​ℓk+3\leq 2\ell. Since no vertex in V​(G)βˆ’V​(C)V(G)-V(C) has two neighbours in V​(C)V(C), the vertex vk+3v_{k+3} has no neighbour in XX. Assume that vk+3v_{k+3} has degree at least three, for otherwise (4) holds. There is a connected induced subgraph DD such that vk+3v_{k+3} has a neighbour in V​(D)V(D) and V​(D)∩(V​(C)βˆͺX)=βˆ…V(D)\cap(V(C)\cup X)=\emptyset, and DD is maximal with these properties. Let NN be the set of vertices in V​(C)βˆͺXV(C)\cup X that have a neighbour in V​(D)V(D). Evidently, vk+3∈Nv_{k+3}\in N.

4.6.1.

N∩(XβˆͺV​(C))βŠ†{vk+2,vk+3,vk+4}N\cap(X\cup V(C))\subseteq\{v_{k+2},v_{k+3},v_{k+4}\}.

Subproof..

Assume not. When 1≀i≀k+11\leq i\leq k+1, set Wi:=Xiβˆͺ{vi}W_{i}:=X_{i}\cup\{v_{i}\}; and when k+5≀i≀2​ℓ+1k+5\leq i\leq 2\ell+1, set Wi:={vi}W_{i}:=\{v_{i}\}. Assume that N∩Wiβ‰ βˆ…N\cap W_{i}\neq\emptyset for some integer iβˆ‰{k+2,k+3,k+4}i\notin\{{k+2},{k+3},{k+4}\}. Let QQ be a minimal (vi,vk+3)(v_{i},v_{k+3})-path with interior in V​(D)βˆͺ(Wiβˆ’{vi})V(D)\cup(W_{i}-\{v_{i}\}). Then QQ is a jump over CC and |Q∩X|≀1|Q\cap X|\leq 1. Since XX intersects each local jumps over CC across one vertex and each short jump over CC in at least two vertices, G​[V​(CβˆͺQ)]G[V(C\cup Q)] does not contain a local jump over CC across one vertex or a short jump over CC, which is not possible by Lemmas 4.2 and 4.3 ∎

By 4.6.1, the set {vk+2,vk+3,vk+4}\{v_{k+2},v_{k+3},v_{k+4}\} is a P3P_{3}-cut of GG. So (3) holds. ∎

Now, we can prove Theorem 1.3, which is restated here for convenience.

Theorem 4.7.

For any integer β„“β‰₯5\ell\geq 5, each graph in 𝒒ℓ\mathcal{G}_{\ell} is 33-colorable.

Proof.

Assume not. Let Gβˆˆπ’’β„“G\in\mathcal{G}_{\ell} be a minimal counterexample to Theorem 1.3. Then GG is 4-vertex-critical. So GG has no degree-2 vertex. By Theorems 1.2 and 3.2, GG contains neither odd K4K_{4}-subdivision nor balanced K4K_{4}-subdivision of type (1,2)(1,2). Hence, GG has a P3P_{3}-cut by Theorem 4.6, which is a contradiction to Lemma 2.2. ∎

5 Acknowledgments

This research was partially supported by grants from the National Natural Sciences Foundation of China (No. 11971111). The author thanks Yidong Zhou for carefully reading the paper and giving some suggestions.

References

  • [1] R. Chen, Y. Zhou, On coloring of graphs with girth 2​ℓ+12\ell+1 and without longer odd holes. odd K4K_{4}-subdivisions, 2022, in arXiv:2210.12376v1.
  • [2] M. Chudnovsky, P. Seymour, Proof of a conjecture of Plummer and Zha, to appear in J. Graph Theory, 2022. in arXiv:2201.11505v2.
  • [3] D. Nelson, M. Plummer, N. Robertson, X. Zha, On a conjecture concerning the Petersen graph. Electron. J. Combin., 2011, 18: #P20.
  • [4] M. Plummer, X. Zha, On a conjecture concerning the Petersen Graph: Part II. Electron. J. Combin., 2014, 21: #P1.34.
  • [5] D. Wu, B. Xu, Y. Xu, On coloring of graphs of girth 2​ℓ+12\ell+1 without longer odd holes (in Chinese), Sci Sin Math., 2022, 52: 1-18. in arXiv: 2204.06284v1.
  • [6] D. Wu, B. Xu, Y. Xu, The chromatic number of heptagraphs, 2022, in arXiv: 2206.01400v1.
  • [7] B. Xu, G. Yu, X. Zha, A note on chromatic number and induced odd cycles. Electron. J. Combin., 2017, 24(4): #P4.32.