Graphs with girth and without longer odd holes are -colorable
Abstract
For a number , let denote the family of graphs which have girth and have no odd hole with length greater than . Plummer and Zha conjectured that every 3-connected and internally 4-connected graph in is 3-colorable. Wu, Xu, and Xu conjectured that every graph in is 3-colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in and is 3-colorable. In this paper, we prove that every graph in is 3-colorable.
Key Words: chromatic number; odd holes
1 Introduction
All graphs considered in this paper are finite, simple, and undirected. A proper coloring of a graph is an assignment of colors to the vertices of such that no two adjacent vertices receive the same color. A graph is -colorable if it has a proper coloring using at most colors. The chromatic number of , denoted by , is the minimum number such that is -colorable.
The girth of a graph , denoted by , is the minimum length of a cycle in . 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 , let be the family of graphs that have girth and have no odd holes of length at least . Robertson conjectured in [3] that the Petersen graph is the only graph in 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 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 is 4-colorable. Chudnovsky and Seymour [2] proved that every graph in 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 are 4-colorable and proposed the following conjecture.
Conjecture 1.1.
([5], Conjecture 6.1.) Every graph in is -colorable.
We say that a graph has an odd -subdivision if some subgraph of is isomorphic to a -subdivision and whose face cycles are all odd holes of . The subgraph 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 in , if has an odd -subdivision, then .
Theorem 1.3.
All graphs in are -colorable.
We conjecture
Conjecture 1.4.
For a graph without triangles, if all odd holes of have the same length, then is -colorable.
Conjecture 1.5.
For an integer and a graph with , if the set of lengths of odd holes of have members, then is -colorable.
2 Preliminary
A cycle is a connected -regular graph. Let be a graph. For any subset , let be the induced subgraph of defined on . For subgraphs and of , set and . Let denote the subgraph of with vertex set and edge set . Let denote the subgraph of with edge set and without isolated vertex. Let be the set of vertices in that have a neighbour in . Set .
Let be an -path and a -path. When and are internally disjoint paths, let denote the -path . Evidently, is a path when , and is a cycle when . Let denote the set of internal vertices of . When , let denote the subpath of with ends . For simplicity, we will let denote .
For a number , a graph is -vertex-critical if and for each vertex of .
Lemma 2.1.
([1], Lemma 2.2.) For any number , each -vertex-critical graph has no -edge-cut.
For an -vertex path of a connected graph , if is disconnected, then we say that is a -cut. Usually, a -cut is also called a -cut. Evidently, every -vertex-critical graph has no -cut. Chudnovsky and Seymour in [2] proved that every -vertex-critical graph in has no -cut. In fact, their methods can also be used to prove the following result.
Lemma 2.2.
([2]) For any number , every -vertex-critical graph in has neither -cut nor -cut.
A theta graph is a graph that consists of a pair of distinct vertices joined by three internally disjoint paths. Let be a hole of a graph . A path of is a chordal path of if is an induced theta-subgraph of . Since and each odd hole of has length , by simple computation we have the following result, which will be frequently used.
Lemma 2.3.
([1], Lemma 2.3.) Let be an odd hole of a graph . Let be a chordal path of , and be the internally disjoint paths of that have the same ends as . Assume that and have the same parity. Then
In particular, when , all chordal paths of with the same ends as have length .
Let be odd holes of a graph such that is a theta subgraph . When is not induced, since and , we have that and is an odd -subdivision. For the similar reason, if is an even hole of length of , then has at most two chords, and when has two chords, is an odd -subdivision.

3 Graphs has a subgraph isomorphic to a -subdivision
Let be a graph that is isomorphic to a -subdivision. For a path of whose ends are degree-3 vertices of , if contains exactly two degree-3 vertices of , then we say it is an arris of . Evidently, has exactly six arrises. We say that a graph contins a balanced -subdivision if has an induced subgraph isomorphic to a -subdivision and exactly two face cycles of are odd holes of .
Lemma 3.1.
If a graph in contains a balanced -subdivision that is pictured as the graph in Figure 1, then the following hold.
-
(1)
and .
-
(2)
.
-
(3)
Assume that has no odd -subdivision. If and , then no vertex has two neighbours in .
Proof.
Since are odd holes and , we have . Assume that . Since is a chordal path of and is an even hole, we have by Lemma 2.3. Similarly, we have , which is a contradiction. So (1) holds.
Now we consider (2). By (1) and symmetry we may assume that . Since by (1), we have , so is a chordal path of . Then by Lemma 2.3. So . This proves (2).
Next, we prove that (3) is true. Assume not. Let have at least two neighbours in . Since and is an even hole, is an odd hole and 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 has at most one vertex adjacent to .
3.1.1.
The vertex has exactly one neighbour in and exactly one neighbour in .
Subproof..
Since has at most one neighbour in , it suffices to show that has at most one neighbour in . Assume not. Then has exactly two neighbours in with one in and the other in . Then is a balanced -subdivision as has no odd -subdivision, which is not possible by (2). β
Note that is an odd hole. Since can not have two neighbours in an odd hole of , the vertex has no neighbour in . For the same reason, if has a neighbour in , the neighbours of in must be in , which is not possible by 3.1.1. Hence, . Assume that has a neighbour in . Since and , by 3.1.1, the two cycles in containing are odd holes. Moreover, since , the subgraph is an odd -subdivision, which is not possible. Similarly we can show that can not have a neighbour in . This proves (3). β
Let be an induced subgraph of pictured as the graph in Figure 1. When , we say that is a balanced -subdivision of type if . Since implies that , this definition is well defined.
Let be vertex disjoint induced subgraphs of a graph . An induced -path is a direct connection linking and if is the only vertex in having a neighbour in and is the only vertex in having a neighbour in . Evidently, the set of internal vertices of each shortest induced path joining and induces a direct connection linking and .
Theorem 3.2.
Let be an integer and be a graph in . If is -vertex critical, then does not contain a balanced -subdivision of type .
Proof.
By Theorem 1.2, does not have an odd -subdivision. Assume to the contrary that has a balanced -subdivision of type that is pictured as the graph in Figure 1. Without loss of generality we may assume that is chosen with as small as possible.By Lemma 3.1 (1) and symmetry we may assume that . By Lemmas 3.1 (2) and 2.3, we have
Let be the edges in incident with , respectively. Let be a direct connection in linking and . Lemma 2.1 implies that such exists. Let be the ends of with having a neighbour in and having a neighbour in . By Lemma 3.1 (3), both and have a unique neighbour in . Let be the neighbour of in and the neighbour of in . Set . Then is an induced subgraph of . By Lemma 3.1 (3) again, we have .
3.2.1.
.
Subproof..
Assume that . Set . Since , we have that is an even hole by Lemma 2.3. Since and is an odd hole, is a balanced -subdivision of type whose edge number is less than , which is a contradiction to the choice of . β
3.2.2.
.
Subproof..
Assume not. By 3.2.1, we have . Set . Since by (4.1), it follows from Lemma 2.3 that is an odd hole. Then is an even hole. Moreover, since , we have and by Lemma 2.3. Since and are odd holes, we have . Moreover, since , the subgraph is a balanced -subdivision of type whose edge number is less than , which is a contradiction. β
3.2.3.
When , we have or .
Subproof..
Assume that . Since and are chordal paths of that have the same ends as , they have length by Lemma 2.3. So , implying that . β
3.2.4.
If , then , , and .
Subproof..
Set . When is an odd hole, since is an odd hole, is an odd -subdivision, which is not possible. So is an even hole. Assume that . Then by Lemma 2.3. Moreover, since is an odd hole, is a balanced -subdivision of type whose edge number is less than , which is a contradiction to the choice of . So .
Assume that . Since and are chordal paths of that have the same ends as , they have length by Lemma 2.3. Moreover, since and imply , the subgraph is a balanced -subdivision of type whose edge number is less than , which is a contradiction. So , implying that . Since is an odd cycle of length at least , we have . This proves 3.2.4. β
3.2.5.
.
Subproof..
Assume not. Set . Assume that is an odd hole. Since is an odd -subdivision when , we have . Since as , the graph is an odd hole with length larger than by (4.1), which is not possible. So is an even hole. Since , it follows from Lemma 2.3 that . Moreover, since is a chordal path of the odd hole and is an even hole, by Lemma 2.3. Hence, is a balanced -subdivision of type whose edge number is less than , which is a contradiction. β
Let be the neighbour of in .
3.2.6.
If , then . In particular, when , we have ; and when , we have or .
Subproof..
Set . Assume that and . Since and are chordal paths of with the same ends, by Lemma 2.3, so . That is, when , 3.2.6 holds. So we may assume that .
By 3.2.2, we may assume that . When is an odd hole, since , the graph is an odd -subdivision. So is an even hole. When , by Lemma 2.3, we have that , and is an odd hole, so is a balanced -subdivision of type whose edge number is less than , which is not possible. Hence, . When , since is a chordal path of , we have by Lemma 2.3. So is a balanced -subdivision of type whose edge number is less than , which is not possible. So . β
Let be a vertex in . When , let , otherwise let . The vertex is well defined as . Since , we have . Let with closer to and closer to along . Since is not an edge cut of by Lemma 2.1, there is a shortest induced path in linking and . By Lemma 3.1 (3), is an induced subgraph of . Let be the other end of that is not equal to . When , since is a direct connection in linking and , we get a contradiction to 3.2.2-3.2.6. So . Assume that . When , either is an odd hole of length at least or is a cycle of length that is at most by the choice of , which is not possible. So . By symmetry, we have .
Now we show that is a -cut of , implying that Theorem 3.2 holds from Lemma 2.2. Assume not. Let be a direct connection in linking and . Let be the ends of with having a neighbour in and having a neighbour in . By Lemma 3.1 (3), has a unique neighbour, say , in . Since is chosen with as small as possible, has a unique neighbour, say , in . Set . Then is an induced subgraph of or some vertex in has a neighbour in . When , let be an induced -path in that is not equal to . Since is a chordal path of with length by Lemma 2.3, there is a cycle in with length at most by the choice of , which is not possible. So . Then contains a direct connection in linking and . Since and , by 3.2.2-3.2.6, we have that , , and . Let be an induced -path in . Since and are chordal paths of , by Lemma 2.3, we have , so , which is not possible. β
4 Jumps over an odd hole
Let be an odd hole of a graph and nonadjacent. Let be an induced -path. If , we call a jump or an -jump over . Let be the internally disjoint -paths of . If some vertex in has a neighbour in and no vertex in has a neighbour in , we say that is a local jump over across . When there is no need to strengthen , we will also say that is a local jump over . In particular, when , we say that is a local jump over across one vertex. When no vertex in has a neighbour in , we say that is a short jump over . Hence, short jumps over are chordal paths of . But chordal paths over maybe not short jumps over as the ends of a chordal path maybe adjacent. When is a short jump over , if is an odd hole, we say that is a jump hole over and is a short jump over across . Note that our definition of local jumps over is a little different from the definition given in [2]. By our definitions, no short jump over is local.
Lemma 4.1.
Let be an odd hole of a graph . Let be defined as the last paragraph. If is a local or short jump over across , then have the same parity, that is, is an even hole and is an odd cycle.
Proof.
When is short, the lemma holds from its definition. So we may assume that is local. Since some vertex in has a neighbour in and , we have . So is an even hole. This proves Lemma 4.1. β
Let be a cycle of a graph and be chords of . If no cycle in containing contains the two ends of , we say are crossing; otherwise they are uncrossing. Note that by our definition, are uncrossing when they share an end. When is an odd hole and is an -jump over for each integer , if and are uncrossing chords of after we replace by the edge and by the edge , we say that are uncrossing; otherwise, they are crossing.
Lemma 4.2.
Let be an odd hole of a graph . If a jump over is not local, then contains a short jump over .
Proof.
Without loss of generality we may assume that is not a short jump over . Let be the ends of and be the internally disjoint -paths of . Since is neither local nor short, there are such that has a neighbour in and has a neighbour in , and such that no vertex in has a neighbour in . Since no vertex outside an odd hole has two neighbours in the odd hole, and has a unique neighbour, say , in for each integer . Then is a short jump over . This proves Lemma 4.2. β
Lemma 4.3.
Let be an odd hole of a graph . If is a local -jump over , then contains a local jump over across one vertex or a short jump over .
Proof.
Assume not. Among all local jumps over not satisfying Lemma 4.3, let be chosen with as small as possible. Let have a neighbour in that are closest to , respectively. Let be the unique neighbour of in , respectively. Since is a short jump over when , we have . Similarly, we have . Hence, when , and is adjacent to , which is a contradiction. So . Since is not a local jump over across one vertex, we have . Let be the neighbour of in closest to . Note that maybe equal to . By the choice of , we have . Set . Since is a local jump over with , by the choice of , the subgraph contains a local jump over across one vertex or a short jump over , so is , which is a contradiction. This proves Lemma 4.3. β
Let be a cycle and suppose that occur on in this cyclic order with . For any two distinct and , the cycle contains two -paths. Let denote the -path in containing (and not containing if ), where subscripts are modulo . Such path is uniquely determined as .
Lemma 4.4.
Let be an odd hole of a graph , and be a short -jump over for each integer . If are crossing, then contains an odd -subdivision or a balanced -subdivision of type .
Proof.
Since are short jumps over , either or has length at most by Lemma 2.3. By symmetry we may assume that the first cycle is shorter than the last one. Set . Since , either is a hole or and has exactly one or two chords. When is a hole, implying that , the subgraph is induced and isomorphic to a balanced -subdivision of type . So we may assume that and has exactly one or two chords. Since and , all cycles in using exactly one chord of are odd holes. Hence, when has exactly two chords, the two chords of are crossing and is isomorphic to an odd -subdivision; and when has exactly one chord, contains a balanced -subdivision of type . β
Lemma 4.5.
Let be an integer and be an odd hole of a graph . For any integer , let be a short or local -jump over such that and appear on in this order. Assume that is across and if is local, we have for any integer . Then the following hold.
-
(1)
When are short, has an odd -subdivision.
-
(2)
At most two vertices in are not in a jump hole over .
Proof.
Without loss of generality we may assume that are chosen with minimal. Set . By symmetry we may assume that . Note that maybe equal to .
4.5.1.
(1) is true.
Subproof..
Since are short jumps over , by Lemmas 2.3 and 4.1, and is odd and at most . Then contains at most one cycle. By the choice of and , the subgraph contains no cycle. So has at most two cycles. When has exactly two cycles, since , one cycle in is a hole, so we can find a new short jump over to replace one of and get a contradiction to the choice of . Hence, contains a unique cycle . Since , the cycle contains at most two chords, and the two chords are uncrossing when has two chords. No matter which case happens, contains two short jumps over such that is isomorphic to an odd -subdivision. So (1) holds. β
By 4.5.1, we may assume that some is local. For any integer , let be the vertices in adjacent to , respectively, and set . Since , both and are nonempty by Lemma 2.3. Since and are jumps over across and respectively, we have that 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 is disjoint and anticomplete to .
Subproof..
Assume not. Since and they are nonadjacent, by symmetry we may assume that is connected. We claim that is short. Assume not. Let be the vertex in adjacent to . Since , there is a minimal path linking and with interior in . Let be the other end of . Since (2) holds when , we have . When is across , (2) holds; when is across , replacing by , we get a contradiction to the choice of . Hence, is short, implying that is local and , for otherwise (2) holds.
Let be a minimal -path linking and with interior in , with and . Since no vertex in has a neighbour in , either is a short -jump over or . Assume that . Since , we have , , and . Since is short and is across one vertex, by Lemmas 2.3 and 4.1, we have , so , which contradicts to the fact that . Hence, is a short -jump over .
When , since is local and , the short jump is across , so (2) holds as is short. When , either (2) holds or we can replace by to get a contradiction to the choice of . This proves 4.5.2 as . β
By 4.5.2, we may assume that is disjoint and anticomplete to . By Lemma 4.1, is odd and at least . By symmetry and 4.5.2, we may assume that has a neighbour in . Let be the vertex in closest to along . Set . Then is a jump of . Since (2) holds when is short, we may assume that is not short, implying that is local and the vertex adjacent to has a neighbour in . Then , implying that is an even hole by 4.5.2. Hence, by Lemma 4.1, is an odd hole of length at least , which is not possible. β
Theorem 4.6.
Let be an integer and be an odd hole of a graph . Then one of the following holds.
-
(1)
has an odd -subdivision.
-
(2)
contains a balanced -subdivision of type .
-
(3)
has a -cut.
-
(4)
has a degree- vertex.
Proof.
Assume that neither (1) nor (2) is true. Set . Let be a short jump over with as small as possible. By symmetry we may assume that the ends of are with . By Lemmas 4.5 (1), 4.4 and 2.3, we may assume that all short jumps over have ends in . That is, (i) no jump hole over contains a vertex in .
For each integer , let be a local -jump over across one vertex and be the -path on of length three. When and are uncrossing, by (i) and Lemma 4.5 (2), . When and are crossing, . Since there is no short jump over or at least one vertex in is in by Lemma 4.5 (2), by possibly reordering we may assume that all local jumps over across one vertex have ends in with . For any integer , let be the set of vertices adjacent to that are in a local jump over across one vertex with one end or a short jump over with one end . Set . Then intersects all short jumps over and all local jumps over across one vertex in at least two vertices.
Since and , we have . Since no vertex in has two neighbours in , the vertex has no neighbour in . Assume that has degree at least three, for otherwise (4) holds. There is a connected induced subgraph such that has a neighbour in and , and is maximal with these properties. Let be the set of vertices in that have a neighbour in . Evidently, .
4.6.1.
.
Subproof..
Assume not. When , set ; and when , set . Assume that for some integer . Let be a minimal -path with interior in . Then is a jump over and . Since intersects each local jumps over across one vertex and each short jump over in at least two vertices, does not contain a local jump over across one vertex or a short jump over , which is not possible by Lemmas 4.2 and 4.3 β
By 4.6.1, the set is a -cut of . So (3) holds. β
Now, we can prove Theorem 1.3, which is restated here for convenience.
Theorem 4.7.
For any integer , each graph in is -colorable.
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 and without longer odd holes. odd -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 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.