Minor stars in plane graphs with minimum degree five
Yangfan Li Mengjiao Rao Tao Wang111Corresponding
author: [email protected]; [email protected]
Institute of Applied Mathematics
Henan University, Kaifeng, 475004, P. R. China
Abstract
The weight of a subgraph H in G is the sum of the degrees in G of vertices of H. The height of a subgraph H in G is the maximum degree of vertices of H in G. A star in a given graph is minor if its center has degree at most five in the given graph. Lebesgue (1940) gave an approximate description of minor 5-stars in the class of normal plane maps with minimum degree five. In this paper, we give two descriptions of minor 5-stars in plane graphs with minimum degree five. By these descriptions, we can extend several results and give some new results on the weight and height for some special plane graphs with minimum degree five.
1 Introduction
A normal plane map (NPM for short) is a connected plane pseudograph in which loops and multiple edges are allowed, but the degree of each vertex and face is at least three. A 3-polytope is a 3-connected plane graph. Clearly, each 3-polytope is a normal plane map. The class of normal plane maps with minimum degree five is denoted by M5, and the class of 3-polytopes with minimum degree at least five is denoted by P5. A (k1,k2,k3,k4,k5)-star is a star with deg(vi)≤ki, where vis are neighbors of the center in any order. A k-star is a star with k rays. A star in a given graph is minor if its center has degree at most five in the given graph.
The weight of a subgraph H in G is the sum of degG(v) by taking over all v∈V(H). The height of a subgraph H in G is the maximum degree of vertices of H in G. Let ΩΔ be the minimum integer such that there is a minor 5-star with weight at most ΩΔ in every plane graph with minimum degree five and maximum degree Δ.
In 1904, Wernicke [22] proved that every M5 has a 5-vertex adjacent to a 6−-vertex, that is a (5,6)-edge. This was strengthened by Franklin [17] in 1922 to the existence of a minor (6,6)-star, that is a (6,5,6)-path. In 1996, Jendrol’ and Madaras [19] gave a precise description of minor 3-stars in M5: there is a minor (6,6,6)- or (5,6,7)-star. In 1998, Borodin and Woodall [16] showed that the minimum weight of minor 4-star in M5 is at most 30, which is best possible. Furthermore, Borodin and Ivanova [3] gave a tight description of minor 4-stars in M5.
In 1940, Lebesgue [21] gave an approximate description of minor 5-stars in M5, which implies that ΩΔ≤Δ+31, and ΩΔ≤Δ+27 for Δ≥41. In 1998, Borodin and Woodall [16] strengthened the first of these results to ΩΔ≤Δ+30. This result is sharp for Δ=7 due to Borodin [1] and Jendrol’–Madaras [19], Δ=9 due to Borodin–Ivanova [3], Δ=10 due to Jendrol’–Madaras [19], Δ=12 due to Borodin–Woodall [16]. Recently, Borodin and Ivanova [9] showed that Ω8=38, Ω11=41 and Ω13=42. Hence, Borodin–Woodall’s bound Δ+30 is sharp for every integer Δ in {7,8,…,12}, and we have known the exact value of ΩΔ for every integer Δ with 7≤Δ≤13. On the other hand, it is known that Ω20=48.
As for Lebesgue’s bound ΩΔ≤Δ+27 for Δ≥41, it was strengthened by Borodin, Ivanova and Jensen [10] to ΩΔ≤Δ+27 for Δ≥28, and further by Borodin and Ivanova [5] to ΩΔ≤Δ+27 for Δ≥24.
In general, the description of minor stars is unordered for the neighbors of the center. In this paper, we give two descriptions of neighbors of 5-vertices in a cyclic order. A ⟨κ1,κ2,κ3,κ4,κ5⟩-star is a star with center having degree five and the other vertices having degrees ≤κ1,≤κ2,≤κ3,≤κ4,≤κ5 in a cyclic order.
The first purpose of this paper is to give the following description of minor 5-stars in plane graphs with minimum degree five. Furthermore, this description of minor 5-stars can imply the tight description of minor 4-stars. For a problem of complete (tight) description of minor 5-stars in plane graphs with minimum degree five, we refer the reader to [3].
Theorem 1**.**
If G is a plane graph with minimum degree five, then G contains at least one of the following minor 5-stars:
{tabenum}[ ]
⟨5,7,7,5,17⟩,
⟨5,7,8,5,11⟩,
⟨5,7,5,8,8⟩,
⟨8,5,5,11,6⟩,
⟨8,5,5,8,7⟩,
⟨8,5,5,7,8⟩,
⟨8,5,5,6,9⟩,
⟨5,6,5,8,11⟩,
⟨5,6,6,5,∞⟩,
⟨5,6,6,6,17⟩,
⟨6,6,6,6,11⟩,
⟨6,6,6,7,8⟩,
⟨6,6,7,6,8⟩,
⟨5,6,6,11,7⟩,
⟨5,6,11,6,7⟩,
⟨5,6,6,8,8⟩,
⟨5,6,8,6,8⟩,
⟨5,7,6,8,7⟩,
⟨5,6,7,7,7⟩,
⟨5,6,6,7,11⟩,
⟨5,6,7,6,11⟩,
⟨5,7,6,7,8⟩,
⟨5,7,7,6,8⟩,
⟨5,7,6,6,14⟩,
⟨5,8,6,6,11⟩,
⟨5,5,7,6,14⟩,
⟨5,6,7,5,35⟩,
⟨5,6,8,5,15⟩,
⟨5,6,9,5,10⟩,
⟨5,6,11,5,9⟩,
⟨5,5,10,5,12⟩,
⟨5,7,11,5,8⟩,
⟨5,6,5,7,14⟩,
⟨5,5,9,5,17⟩.
∎
The following theorems are immediate consequences of Theorem 1. Recall that the bounds in Theorem 2, 3, 5–7 are sharp.
Theorem 2** (Borodin and Ivanova [9]).**
Let Δ be an integer with Δ≥13. Every 3-polytope with minimum degree five and maximum degree Δ has a minor 5-star with weight at most Δ+29.
Theorem 3** (Borodin and Woodall [16]).**
Every plane graph with minimum degree five has a minor 4-star with weight at most 30.
Theorem 4** (Jendrol’ and Madaras [19]).**
Every plane graph with minimum degree five has a minor (10,10,10,10)-star.
Theorem 5** (Jendrol’ and Madaras [19]).**
Every plane graph with minimum degree five has a minor (5,6,7)-star or a minor (6,6,6)-star.
Theorem 6** (Franklin [17]).**
Every plane graph with minimum degree five has a (6,5,6)-path.
Theorem 7** (Wernicke [22]).**
Every plane graph with minimum degree five has a (5,6)-edge.
Theorem 8**.**
Every plane graph with minimum degree five having no 7-vertices and no 8-vertices contains at least one of the following minor 5-stars: a ⟨5,6,6,5,∞⟩-star, a ⟨5,6,6,6,17⟩-star, a ⟨6,6,6,6,11⟩-star, a ⟨5,6,9,5,10⟩-star, a ⟨5,6,11,5,9⟩-star, a ⟨5,5,10,5,12⟩-star, a ⟨5,5,9,5,17⟩-star.
Theorem 9**.**
Every plane graph with minimum degree five having no vertices of degrees from 7 to 9 contains at least one of the following minor 5-stars: a ⟨5,6,6,5,∞⟩-star, a ⟨5,6,6,6,17⟩-star, a ⟨6,6,6,6,11⟩-star, a ⟨5,5,10,5,12⟩-star.
Theorem 10**.**
Every plane graph with minimum degree five having no vertices of degrees from 7 to 11 contains at least one of the following minor 5-stars: a ⟨5,6,6,5,∞⟩-star, a ⟨5,6,6,6,17⟩-star, a ⟨6,6,6,6,6⟩-star.
Theorem 11** (Borodin and Ivanova [6]).**
Every 3-polytope with minimum degree five having neither vertices of degrees from 6 to 9 nor ⟨5,5,5,5,∞⟩-star has a minor 5-star of weight at most 42 and a minor 5-star of height at most 12.
Remark 1**.**
A tight description "a (5,6,6,5,∞)-star, a (5,6,6,6,15)-star, a (6,6,6,6,6)-star" for 3-polytope with minimum degree 5 and without vertices of degrees from 7 to 11 was obtained in [11]. By Theorem 1, the desired minor 5-star to achieve the upper bounds in Theorem 11 is a ⟨5,5,10,5,12⟩-star. Borodin and Ivanova [6] have provided a minor 5-star to show the sharpness of the bounds in Theorem 11.
The second purpose of this paper is to give another description of minor 5-stars plane graph with minimum degree five.
Theorem 12**.**
If G is a plane graph with minimum degree five, then G contains at least one of the following minor 5-stars:
{tabenum}[ ]
⟨5,5,5,7,17⟩,
⟨7,5,5,7,11⟩,
⟨7,5,5,8,9⟩,
⟨7,5,5,9,8⟩,
⟨7,5,5,11,7⟩,
⟨5,5,5,8,11⟩,
⟨8,5,5,9,7⟩,
⟨8,5,5,11,6⟩,
⟨6,6,6,6,11⟩,
⟨6,6,6,7,9⟩,
⟨6,6,7,6,9⟩,
⟨6,6,7,7,7⟩,
⟨6,7,6,7,7⟩,
⟨5,6,6,8,9⟩,
⟨5,6,8,6,9⟩,
⟨5,6,7,7,9⟩,
⟨5,6,6,7,11⟩,
⟨5,6,7,6,11⟩,
⟨5,7,6,7,9⟩,
⟨5,7,7,6,9⟩,
⟨5,6,6,6,17⟩,
⟨5,7,6,6,11⟩,
⟨5,8,6,6,10⟩,
⟨5,9,6,6,9⟩,
⟨5,5,9,6,9⟩,
⟨5,6,6,5,∞⟩,
⟨5,6,7,5,23⟩,
⟨5,6,8,5,15⟩,
⟨5,6,9,5,14⟩,
⟨5,9,5,6,10⟩,
⟨5,8,5,6,11⟩,
⟨5,7,5,6,17⟩,
⟨5,7,7,5,11⟩,
⟨5,7,8,5,9⟩,
⟨5,8,5,7,9⟩,
⟨5,7,5,7,11⟩,
⟨5,7,5,8,10⟩,
⟨5,7,5,9,9⟩,
⟨5,5,10,5,14⟩,
⟨5,5,11,5,13⟩.
∎
The following theorems are immediate consequences of Theorem 12.
Theorem 13**.**
If G is a plane graph with minimum degree 5 and maximum degree Δ≥16, then G has a minor 5-star with weight at most Δ+28.
Theorem 14**.**
Every plane graph with minimum degree five and no ⟨5,6,6,5,∞⟩-stars and no ⟨5,6,7,5,23⟩-stars has a minor 5-star of weight at most 45 and height at most 17.
Theorem 15**.**
Every plane graph with minimum degree five and no ⟨5,5,5,5,∞⟩-stars and no 6-vertices and no 7-vertices has a minor 5-star of weight at most 44 and height at most 15.
Theorem 16** (Borodin and Ivanova [5]).**
Every plane graph with minimum degree five and no ⟨5,6,6,5,∞⟩-star has a minor 5-star of weight at most 51 and height at most 23.
Remark 2**.**
By Theorem 12, the desired minor 5-star to achieve the upper bounds in Theorem 16 is a ⟨5,6,7,5,23⟩-star.
Note that our results do not require the "3-connected" condition for the plane graphs with minimum degree five, so the class of graphs we considered is a little bit bigger than P5. For other results related to minor stars, we refer the reader to [4, 7, 8, 13, 18, 12, 11, 14, 15, 2], and more general results on the theory of light subgraphs in plane graphs has been presented recently in a nice survey [20]. We use the classic discharging method and the ideas in [5, 9, 6] to give a proof of Theorem 1 in Section 2 and a proof of Theorem 12 in Section 3.
Notions: In a plane graph with minimum degree five, let v1,v2,…,vκ be the neighbors of a κ-vertex v in a cyclic order. If vi is a 5-vertex and two of vi−1,vi+1 are 6+-vertices, then vi is called a strong 5-neighbor of v; if vi is a 5-vertex but it is not a strong 5-neighbor of v, then vi is called a non-strong 5-neighbor; if vi−1,vi,vi+1 are all 5-vertices, then vi is called a weak 5-neighbor of v; if vi−2,vi−1,vi,vi+1,vi+2 are all 5-vertices, then vi is called a twice-weak 5-neighbor of v.
Let G be a connected counterexample to Theorem 1 with maximum number of edges.
- (∗1)
The graph G is a triangulation.
- Proof of (∗1).
Suppose that w1,w2,w3,w4 are four consecutive vertices on the boundary of a 4+-face. Since G is a simple graph, we have that w1=w3 and w2=w4. Note that G is also a plane graph, thus we have that w1w3∈/E(G) or w2w4∈/E(G), otherwise the two lines representing w1w3 and w2w4 would cross each other outside the 4+-face. But an insertion of a diagonal w1w3 or w2w4 into the 4+-face would create a simple counterexample with more edges, which contradicts the assumption of G.
∎
Euler’s formula ∣V∣−∣E∣+∣F∣=2 for G can be rewritten as the following:
[TABLE]
Initially, we give every vertex v an initial charge μ(v)=deg(v)−6, and give every face f an initial charge μ(f)=2deg(f)−6. Note that every face has an initial charge zero and every vertex has a nonnegative initial charge except the 5-vertices. Next, we redistribute the charges among the vertices, preserving their sum, such that the final charge μ′(v) of every vertex v is nonnegative, which contradicts the fact that the sum of the initial charges is negative.
Let
[TABLE]
2.1 Discharging rules
- R1a
Each 7-vertex sends 31 to each strong 5-neighbor.
2. R1b
Each 7-vertex sends 61 to each non-strong 5-neighbor.
- R2
Let ww1w2 be a 3-face with deg(w)=κ, where κ≥8 and κ∈/{10,11}.
- R2a
If both w1 and w2 are 5-vertices, then w sends 2α(κ) to each of w1 and w2 through this face.
2. R2b
If w1 is a 5-vertex and w2 is a 6+-vertex, then w sends α(κ) to w1 through this face.
- R3
Let w be a κ-vertex with κ=10,11. Each such vertex w sends 52 to each adjacent vertex. Let w0,w1,w2 be three consecutive neighbors of w in a cyclic order. Suppose that w0 is a 6+-vertex and w1 is a 5-vertex.
- R3a
If w2 is a 6+-vertex, then w0 transfers a charge of 51 to w1.
2. R3b
If w2 is a 5-vertex, then w0 transfers a charge of 101 to each of w1 and w2.
- R4
Each 11-vertex additionally sends 101 to each twice-weak 5-neighbor.
- R5
Each 13-vertex or 14-vertex additionally sends 201 to each weak 5-neighbor.
- R6
Suppose that w is a 5-vertex with neighbors w0,w1,w2,w3,w4 in a cyclic order, and w0,w1,w2,w3,w4 have degrees κ0,5,κ2,κ3,5, respectively.
- R6a
If κ2,κ3≥8 and κ0=13, then w returns 41 to w0.
2. R6b
If κ2,κ3≥9, κ0=11 and w is a twice-weak 5-neighbor of w0, then w returns 21 to w0.
3. R6c
If κ2,κ3=8, κ0=11 and w is a twice-weak 5-neighbor of w0, then w returns 41 to w0.
4. R6d
If κ2,κ3≥9 and κ0=7, then w returns 61 to w0.
- R7
Suppose that w is a 5-vertex with neighbors w1,w2,w3,w4,w5 in a cyclic order, and w1,w2,w3,w4 have degrees κ1,5,5,κ4, respectively.
- R7a
If κ1≥12 and κ4≥16, then w donates 81 to w3.
2. R7b
If κ1≥12 and κ4=13,14,15, then w donates 201 to w3.
3. R7c
If κ1=8 and κ4≤11, then w donates 81 to w2.
Remark 3**.**
By R3, each 10-vertex sends 54 to each strong 5-neighbor, sends 52 to each adjacent twice-weak 5-neighbor, and sends at least 21 to any other 5-neighbor.
Remark 4**.**
By R3 and R4, each 11-vertex sends 54 to each strong 5-neighbor, and sends at least 21 to any other 5-neighbor.
2.2 The final charge of every vertex is nonnegative
Case 1**.**
If v is a κ-vertex with κ≥8 and κ∈/{11,13,14}, then μ′(v)≥κ−6−κ⋅α(κ)=0.
Case 2**.**
If v is a 14-vertex, then μ′(v)≥14−6−14⋅α(14)−14⋅201≥0.
Case 3**.**
The vertex v is a 13-vertex.
If v has one 6+-neighbor, then it has at most ten weak 5-neighbors, which implies that μ′(v)≥13−6−13⋅α(13)−10⋅201=0. So we may assume that v is adjacent to thirteen 5-vertices. By the oddness of the integer 13 and the absence of ⟨5,7,7,5,17⟩-stars, the vertex v is involved as the receiver in R6R6a, so μ′(v)≥13−6−13⋅(21+201)+41≥0.
Case 4**.**
The vertex v is an 11-vertex.
If v has a 6+-neighbor, then it has at most six twice-weak neighbors, which implies that μ′(v)≥11−6−11⋅52−6⋅101=0. It remains to assume that v has eleven 5-neighbors. If v is involved as the receiver in R6R6b, then μ′(v)≥11−6−11⋅(52+101)+21=0. In the final case, the vertex v is in a ⟨5,8,8,5,11⟩-star due to the oddness of the integer 11, so we have that μ′(v)≥11−6−11⋅(52+101)+3⋅41≥0 by R6R6c; otherwise, there is a ⟨5,7,8,5,11⟩-star.
Case 5**.**
The vertex v is a 7-vertex.
If v has at most three 5-neighbors, then μ′(v)≥7−6−3⋅31=0. If v has exactly four 5-neighbors, then v has exactly three 6+-neighbors and has at most two strong 5-neighbors, which implies that μ′(v)≥7−6−2⋅31−2⋅61=0. If v has exactly five 5-neighbors, then v has at most one strong 5-neighbor, which implies that μ′(v)≥7−6−31−4⋅61=0. If v has exactly six 5-neighbors, then v has no strong 5-neighbor, which implies that μ′(v)≥7−6−6⋅61=0. If v has seven 5-neighbors, then R6R6d is involved and μ′(v)≥7−6−7⋅61+61=0, for otherwise there is a ⟨5,7,5,8,8⟩-star.
Case 6**.**
The vertex v is a 5-vertex with neighbors v1,v2,v3,v4,v5 in a cyclic order. Suppose that v1,v2,v3,v4,v5 have degrees κ1,κ2,κ3,κ4,κ5 respectively. Note that the initial charge of v is −1.
If v is the sender in R6R6a, then μ′(v)≥−1+2⋅83+21−41=0. If v is the sender in R6R6b, then μ′(v)≥−1+2⋅21+(52+101)−21=0. If v is the sender in R6R6c, then μ′(v)≥−1+2⋅83+(52+101)−41=0. If v is the sender in R6R6d, then μ′(v)≥−1+2⋅21+61−61=0.
Suppose that κ1,κ4≥12 and κ2=κ3=5. If κ4=12, then v receives at least 21 from v4 and sends nothing to v3. If κ4=13,14,15, then v receives at least 2011 from v4 and sends 201 to v3 by R2, R5 and R7R7b, which implies that v keeps at least 21 from v4. If κ4≥16, then v receives at least 85 from v4 and sends 81 to v3 by R2 and R7R7a, which implies that v keeps at least 21 from v4. In conclusion, v keeps at least 21 from v4 whenever κ4≥12, and symmetrically v keeps at least 21 from v1, which implies that μ′(v)≥−1+2⋅21=0.
Suppose that κ1=8, κ2=κ3=5 and κ4≤11. Then v is involved as a sender in R7R7c. By the absence of ⟨8,5,5,11,6⟩-star, we have that κ5≥7. If κ5=7, then κ4≥9 and μ′(v)≥−1+(83−81)+31+21≥0, for otherwise there is a ⟨8,5,5,8,7⟩-star. If κ5=8, then κ4≥8 and μ′(v)≥−1+(83−81)+21+41≥0, for otherwise there is a ⟨8,5,5,7,8⟩-star. If κ5=9, then κ4≥7 and μ′(v)≥−1+(83−81)+32+61≥0, for otherwise there is a ⟨8,5,5,6,9⟩-star. If κ5=10,11, then κ4≥6 and μ′(v)≥−1+(83−81)+54≥0, for otherwise there is a ⟨8,5,5,5,11⟩-star. If κ5≥12, then μ′(v)≥−1+(83−81)+43≥0.
So we may assume that the 5-vertex v is just a receiver in what follows. Suppose that κ1,κ2,κ3,κ4≤6, in other words, the vertex v is the center of a ⟨6,6,6,6,∞⟩-star. By the absence of ⟨5,6,6,5,∞⟩-stars, we have that max{κ1,κ4}=6. If min{κ1,κ4}=5, then μ′(v)≥−1+1812+3612=−1+23⋅32=0, for otherwise there is a ⟨5,6,6,6,17⟩-star. If min{κ1,κ4}=6, then μ′(v)≥−1+2⋅21=0, for otherwise there is a ⟨6,6,6,6,11⟩-star. So we may further assume that v has at least two 7+-neighbors in what follows.
Subcase 6.1**.**
The 5-vertex v has no 5-neighbor.
If v has at least three 7+-neighbors, then μ′(v)≥−1+3⋅31=0. If v has at least two 8+-neighbors, then μ′(v)≥−1+2⋅21=0. Hence, the vertex v has exactly three 6-neighbors and at most one 8+-neighbor, which implies that μ′(v)≥−1+31+32=0, for otherwise there is a ⟨6,6,6,7,8⟩-, or ⟨6,6,7,6,8⟩-star.
Subcase 6.2**.**
The 5-vertex v has precisely one 5-neighbor v1.
By symmetry, we may assume that κ3≤κ4. If κ4≥12, then μ′(v)≥−1+1=0 and we are done.
Suppose that κ4∈{9,10,11}. If κ3≥7, then μ′(v)≥−1+32+31=0. If min{κ2,κ5}≥7, then μ′(v)≥−1+32+2⋅61=0. If min{κ2,κ5}=κ3=6, then μ′(v)≥−1+32+83≥0, for otherwise there is a ⟨5,6,6,11,7⟩- or ⟨5,6,11,6,7⟩-star.
Suppose that v4 is an 8-vertex. If κ3=8, then μ′(v)≥−1+2⋅21=0. If κ3=7, then μ′(v)≥−1+21+31+61=0, for otherwise there is a ⟨5,6,7,8,6⟩-star. If min{κ2,κ5}=κ3=6, then μ′(v)≥−1+2⋅21=0, for otherwise there is a ⟨5,6,6,8,8⟩-, or ⟨5,6,8,6,8⟩-star. If κ3=6 and min{κ2,κ5}≥7, then μ′(v)≥−1+21+61+83≥0, for otherwise there is a ⟨5,7,6,8,7⟩-star.
Suppose that κ3=κ4=7. If min{κ2,κ5}≥7, then μ′(v)≥−1+2⋅31+2⋅61=0. If min{κ2,κ5}=6, then μ′(v)≥−1+2⋅31+83≥0, for otherwise there is a ⟨5,6,7,7,7⟩-star.
Suppose that κ3=6 and κ4=7. If min{κ2,κ5}=6, then μ′(v)≥−1+31+43≥0, for otherwise there is a ⟨5,6,6,7,11⟩-, or ⟨5,6,7,6,11⟩-star. If min{κ2,κ5}=7, then μ′(v)≥−1+31+61+21=0, for otherwise there is a ⟨5,7,6,7,8⟩-, or ⟨5,7,7,6,8⟩-star. If min{κ2,κ5}≥8, then μ′(v)≥−1+31+2⋅83≥0.
Suppose that κ3=κ4=6. If min{κ2,κ5}=7, then μ′(v)≥−1+61+23⋅1515−6≥0, for otherwise there is a ⟨5,7,6,6,14⟩-star. If min{κ2,κ5}=8, then μ′(v)≥−1+83+43≥0, for otherwise there is a ⟨5,8,6,6,11⟩-star. If min{κ2,κ5}≥9, then μ′(v)≥−1+2⋅21=0.
Subcase 6.3**.**
The 5-vertex v has precisely two 5-neighbors v2 and v3.
If min{κ1,κ4}≥9, then μ′(v)≥−1+2⋅21≥0. If min{κ1,κ4}=8 and max{κ1,κ4}≥12, then μ′(v)≥−1+83+43≥0. Recall that the vertex v is just a receiver, so we may assume that min{κ1,κ4}≤7 and max{κ1,κ4}=8 in the following of Subcase 6.3.
Suppose that min{κ1,κ4}=6. If max{κ1,κ4}=7, then κ5≥12 and μ′(v)≥−1+1+61≥0, for otherwise there is a ⟨6,5,5,7,11⟩-star. If max{κ1,κ4}=9,10,11, then κ5≥8 and μ′(v)≥−1+2⋅21≥0, for otherwise there is a ⟨6,5,5,11,7⟩-star. If max{κ1,κ4}≥12, then μ′(v)≥−1+31+43≥0.
Suppose that min{κ1,κ4}=7. If max{κ1,κ4}=7, then κ5≥9 and μ′(v)≥−1+2⋅61+32≥0, for otherwise there is a ⟨7,5,5,7,8⟩-star. If 9≤max{κ1,κ4}≤14, then κ5≥7 and μ′(v)≥−1+61+21+31≥0, for otherwise there is a ⟨7,5,5,14,6⟩-star. If max{κ1,κ4}≥15, then μ′(v)≥−1+61+23⋅53≥0.
Subcase 6.4**.**
The 5-vertex v has precisely two 5-neighbors v1 and v3.
As before, we may assume that κ4≤κ5. If κ4≥9, then μ′(v)≥−1+2⋅21=0.
Suppose that v4 is a 6-vertex. If κ5=7, then μ′(v)≥−1+61+3636−6≥0, for otherwise there is a ⟨5,6,7,5,35⟩-star. If κ5=8, then μ′(v)≥−1+83+1616−6≥0, for otherwise there is a ⟨5,6,8,5,15⟩-star. If κ5=9, then μ′(v)≥−1+2⋅21=0, for otherwise there is a ⟨5,6,9,5,10⟩-star. If κ5≥15, then μ′(v)≥−1+61+23⋅1515−6≥0. If 12≤κ5≤14, then μ′(v)≥−1+43+41=0, for otherwise there is a ⟨5,7,6,6,14⟩-star. The remaining case is κ5=10,11. By the absence of ⟨5,6,11,5,9⟩-stars, we have that κ2≥10. If v receives at least 21 from v2, then μ′(v)≥−1+2⋅21=0. So we may assume that κ2=10 and v is a twice-weak neighbor of v2. Let x,y,v2,v,v5 be the neighbors of v1 in a cyclic order. Since v is a twice-weak neighbor of v2, the vertex y must be a 5-vertex. Note that v1 is not the center of a ⟨5,5,10,5,12⟩-star, thus x cannot be a 5-vertex. By R3, we have that μ′(v)≥−1+52+(52+2⋅101)=0.
Suppose that v4 is a 7-vertex. If κ5=7, then μ′(v)≥−1+2⋅61+1818−6≥0, for otherwise there is a ⟨5,7,7,5,17⟩-star. If κ5=8, then μ′(v)≥−1+61+83+21≥0, for otherwise there is a ⟨5,7,8,5,11⟩-star. If 9≤κ5≤11, then μ′(v)≥−1+61+21+31=0, for otherwise there is a ⟨5,7,11,5,8⟩-star. If 12≤κ5≤14, then μ′(v)≥−1+2⋅61+43≥0, for otherwise there is a ⟨5,6,5,7,14⟩-star. If κ5≥15, then μ′(v)≥−1+61+23⋅1515−6≥0.
Suppose that v4 is an 8-vertex. If κ2≥8, then μ′(v)≥−1+2⋅83+41=0. If κ2=7, then μ′(v)≥−1+61+83+21≥0, for otherwise there is a ⟨5,7,5,8,8⟩-star. If κ2=6, then μ′(v)≥−1+83+43≥0, for otherwise there is a ⟨5,6,5,8,11⟩-star.
Subcase 6.5**.**
The 5-vertex v has precisely three 5-neighbors v1,v2 and v3.
Note that v is just a receiver and it has at least two 7+-neighbors, so we have that min{κ4,κ5}=6,8. If min{κ4,κ5}=7, then μ′(v)≥−1+61+23⋅1515−6≥0, for otherwise there is a ⟨5,6,5,7,14⟩-star. If min{κ4,κ5}≥9, then μ′(v)≥−1+2⋅21=0.
Subcase 6.6**.**
The 5-vertex v has precisely three 5-neighbors v2,v3 and v5.
If min{κ1,κ4}≥11, then μ′(v)≥−1+2⋅21=0. If min{κ1,κ4}=7, then μ′(v)≥−1+61+3636−6≥0, for otherwise there is a ⟨5,6,7,5,35⟩-star. If min{κ1,κ4}=9, then μ′(v)≥−1+31+1818−6≥0, for otherwise there is a ⟨5,5,9,5,17⟩-star.
Suppose that min{κ1,κ4}=κ1=8. Since there is no ⟨5,5,8,5,15⟩-stars, we must have that κ4≥16, see Fig. 2. The 5-vertex v receives 81 from v2 whenever w is a 11−-vertex by R7R7a, otherwise it receives 81 from v3 whenever w is a 12+-vertex by R7R7c. Thus, μ′(v)≥−1+41+1616−6+81=0.
It suffices to consider min{κ1,κ4}=κ1=10. By the absence of ⟨5,5,10,5,12⟩-stars, we have that κ4≥13, see Fig. 2. If v is not a twice-weak 5-neighbor of v1, then μ′(v)≥−1+(52+101)+21=0 by R2 and R3. So we may assume that v is a twice-weak 5-neighbor of v1, thus deg(w)≥13 again by the absence of ⟨5,5,10,5,12⟩-stars. If κ4∈{13,14}, then v receives 21 from v4 by R2, and additionally 201 from each of v3 and v4 by R5 and R7R7b, then μ′(v)≥−1+52+(21+201)+201=0. If κ4≥15, then v receives 52 from v1 and at least α(15)=53 from v4, then μ′(v)≥−1+52+53=0. This completes the proof of Theorem 1.
Let G be a connected counterexample to Theorem 12 with maximum number of edges.
- (∗2)
The graph G is a triangulation.
The proof of (∗2) is the same as that of (∗1), so we omit it. Euler’s formula ∣V∣−∣E∣+∣F∣=2 for G can be rewritten as the following:
[TABLE]
Initially, we give every vertex v an initial charge μ(v)=deg(v)−6, and give every face f an initial charge μ(f)=2deg(f)−6. Note that every face has an initial charge zero and every vertex has a nonnegative initial charge except the 5-vertices. Next, we redistribute the charges among the vertices, preserving their sum, such that the final charge μ′(v) of every vertex v is nonnegative, which contradicts the fact that the sum of the initial charges is negative.
Let
[TABLE]
3.1 Discharging rules
- R1
Each 7-vertex sends 41 to each non-weak 5-neighbor.
- R2
Let ww1w2 be a 3-face with deg(w)=κ, where κ≥8 and κ=9.
- R2a
If both w1 and w2 are 5-vertices, then w sends 2β(κ) to each of w1 and w2 through this face.
2. R2b
If w1 is a 5-vertex and w2 is a 6+-vertex, then w sends β(κ) to w1 through this face.
- R3
Each 9-vertex sends 31 to each adjacent vertex. Let w0,w1,w2 be three consecutive neighbors of a 9-vertex in a cyclic order. Suppose that w0 is a 6+-vertex and w1 is a 5-vertex.
- R3a
If w2 is a 6+-vertex, then w0 transfers a charge of 61 to w1.
2. R3b
If w2 is a 5-vertex, then w0 transfers a charge of 121 to each of w1 and w2.
- R4
Suppose that w is a 5-vertex with neighbors w1,w2,w3,w4,w5 in a cyclic order, and w1,w2,w3,w4 have degrees κ1,5,5,κ4, respectively.
- R4a
If κ1≥12 and κ4≥12, then w donates β(κ1)−21 to w2, and donates β(κ4)−21 to w3.
2. R4b
If κ1=7 and κ4≤11, then w donates 41 to w2.
3. R4c
If κ1=8 and κ4≤11, then w donates 81 to w2.
Remark 5**.**
By R3, each 9-vertex sends 32 to each strong 5-neighbor, sends 31 to each twice-weak neighbor, and sends at least 125 to any other 5-neighbor.
3.2 The final charge of every vertex is nonnegative
Case 1**.**
If v is a κ-vertex with κ≥8 , then μ′(v)≥κ−6−κ⋅β(κ)=0.
Case 2**.**
The vertex v is a 7-vertex.
If v has at most four 5-neighbors, then μ′(v)≥7−6−4⋅41=0. If v has at least five 5-neighbors, then it has at most two 6+-vertices and at most four non-weak 5-neighbors, which also implies that μ′(v)≥7−6−4⋅41=0.
Case 3**.**
The vertex v is a 5-vertex with neighbors v1,v2,v3,v4,v5 in a cyclic order. Suppose that v1,v2,v3,v4 and v5 have degrees κ1,κ2,κ3,κ4 and κ5 respectively. Note that the initial charge of v is −1.
If v is the sender in R4R4a with κ2=κ3=5, then \mu^{\prime}(v)\geq-1+\beta(\kappa_{1})+\beta(\kappa_{4})-\big{(}\beta(\kappa_{1})-\frac{1}{2}\big{)}-\big{(}\beta(\kappa_{4})-\frac{1}{2}\big{)}=0. Suppose that v is the sender in R4R4b with κ2=κ3=5 and κ1=7. If κ4=5, then μ′(v)≥−1+41+23⋅32−41=0, for otherwise there is a ⟨5,5,5,7,17⟩-star. If κ4=6,7, then μ′(v)≥−1+41+1−41=−1+2⋅41+1−2⋅41=0, for otherwise there is a ⟨7,5,5,7,11⟩-star. If κ4=8, then μ′(v)≥−1+41+83+54−41−81≥0, for otherwise there is a ⟨7,5,5,8,9⟩-star. If κ4=9, then μ′(v)≥−1+41+125+32−41≥0, for otherwise there is a ⟨7,5,5,9,8⟩-star. If κ4=10,11, then μ′(v)≥−1+41+53+21−41≥0, for otherwise there is a ⟨7,5,5,11,7⟩-star.
Suppose that v is the sender in R4R4c with κ2=κ3=5 and κ1=8. If κ4=5, then μ′(v)≥−1+83+23⋅21−81=0, for otherwise there is a ⟨5,5,5,8,11⟩-star. If κ4=6, then μ′(v)≥−1+83+54−81≥0, for otherwise there is a ⟨6,5,5,8,9⟩-star. If κ4=7, then μ′(v)≥−1+83+54+41−81−41≥0, for otherwise there is a ⟨7,5,5,8,9⟩-star. If κ4=8, then μ′(v)≥−1+2⋅83+21−2⋅81=0, for otherwise there is an ⟨8,5,5,8,7⟩-star. If κ4=9, then μ′(v)≥−1+83+125+21−81≥0, for otherwise there is an ⟨8,5,5,9,7⟩-star. If κ4=10,11, then μ′(v)≥−1+83+41+53−81≥0, for otherwise there is an ⟨8,5,5,11,6⟩-star.
So we may assume that the 5-vertex v is just a receiver in what follows.
Subcase 3.1**.**
The 5-vertex v has no 5-neighbor.
If v has four 6-neighbors, then μ′(v)≥−1+1=0, for otherwise there is a ⟨6,6,6,6,11⟩-star. If v has at least two 8+-neighbors, then μ′(v)≥−1+2⋅21=0. If v has exactly three 6-neighbors and one 7-neighbor, then μ′(v)≥−1+41+54≥0, for otherwise there is a ⟨6,6,6,7,9⟩-star or a ⟨6,6,7,6,9⟩-star. If v has exactly two 6-neighbors, then μ′(v)≥−1+2⋅41+21=0, for otherwise there is a ⟨6,6,7,7,7⟩-star or a ⟨6,7,6,7,7⟩-star. If v has at most one 6-neighbor, then μ′(v)≥−1+4⋅41=0.
Subcase 3.2**.**
The 5-vertex v has precisely one 5-neighbor v1.
By symmetry, we may assume that κ3≤κ4. If κ3≥8, then v receives at least 21 from each of v3 and v4, which implies that μ′(v)≥−1+2⋅21=0. If κ4∈{10,11}, then μ′(v)≥−1+54+41≥0, for otherwise there is a ⟨6,6,6,6,11⟩-star. If κ4≥12, then μ′(v)≥−1+1=0 and we are done. So we may assume that κ3≤7 and κ4≤9.
Suppose that v4 is a 9-vertex. If κ3=7, then μ′(v)≥−1+32+2⋅41≥0, for otherwise there is a ⟨6,5,6,7,9⟩-star. If min{κ2,κ5}=κ3=6, then μ′(v)≥−1+32+83≥0, for otherwise there is a ⟨6,6,6,7,9⟩-, or ⟨6,6,7,6,9⟩-star. If min{κ2,κ5}≥7, then μ′(v)≥−1+32+2⋅41≥0.
Suppose that v4 is an 8-vertex. If κ3=7, then μ′(v)≥−1+21+2⋅41=0, for otherwise there is a ⟨6,6,6,7,9⟩-star. If κ3=6 and min{κ2,κ5}≥7, then μ′(v)≥−1+21+2⋅41=0. If min{κ2,κ5}=κ3=6, then μ′(v)≥−1+21+53≥0, for otherwise there is a ⟨5,6,6,8,9⟩- or ⟨5,6,8,6,9⟩-star.
Suppose that κ3=κ4=7. If min{κ2,κ5}≥7, then μ′(v)≥−1+4⋅41=0. If min{κ2,κ5}=6, then μ′(v)≥−1+2⋅41+53≥0, for otherwise there is a ⟨5,6,7,7,9⟩-star.
Suppose that κ4=7 and κ3=6. If min{κ2,κ5}=6, then μ′(v)≥−1+41+43=0, for otherwise there is a ⟨5,6,6,7,11⟩- or ⟨5,6,7,6,11⟩-star. If min{κ2,κ5}=7, then μ′(v)≥−1+2⋅41+53≥0, for otherwise there is a ⟨5,7,6,7,9⟩- or ⟨5,7,7,6,9⟩-star. If min{κ2,κ5}≥8, then μ′(v)≥−1+2⋅83+41=0.
Suppose that κ3=κ4=6. If min{κ2,κ5}=6, then μ′(v)≥−1+23⋅1818−6≥0, for otherwise there is a ⟨5,6,6,6,17⟩-star. If min{κ2,κ5}=7, then μ′(v)≥−1+41+43=0, for otherwise there is a ⟨5,7,6,6,11⟩-star. If min{κ2,κ5}=8, then μ′(v)≥−1+83+2215≥0, for otherwise there is a ⟨5,8,6,6,10⟩-star. If min{κ2,κ5}≥9, then μ′(v)≥−1+125+53≥0, for otherwise there is a ⟨5,9,6,6,9⟩-star.
Subcase 3.3**.**
The 5-vertex v has precisely two 5-neighbors v2 and v3.
If min{κ1,κ4}∈{7,8} and max{κ1,κ4}≥12, then μ′(v)≥−1+41+43=0. Recall that the vertex v is just a receiver, so we may assume that κ1=7,8 and κ4=7,8 in the following of Subcase 3.3.
Suppose that min{κ1,κ4}=6. If κ5≥12, then μ′(v)≥−1+1=0. If κ5=10,11, then μ′(v)≥−1+54+41≥0, for otherwise there is a ⟨6,5,5,6,11⟩-star. If κ5=9, then μ′(v)≥−1+32+83≥0, for otherwise there is a ⟨6,5,5,7,9⟩-star. If κ5=8, then μ′(v)≥−1+21+53≥0, for otherwise there is a ⟨5,5,6,8,9⟩-star. If κ5=7, then μ′(v)≥−1+41+43=0, for otherwise there is a ⟨5,5,6,7,11⟩-star. If κ5=6, then μ′(v)≥−1+23⋅32=0, for otherwise there is a ⟨5,5,6,6,17⟩-star.
Suppose that min{κ1,κ4}≥9. If max{κ1,κ4}≥10, then μ′(v)≥−1+125+53≥0. If max{κ1,κ4}=9, then κ1=κ4=9, which implies that μ′(v)≥−1+2⋅125+41≥0, for otherwise there is a ⟨5,5,9,6,9⟩-star.
Subcase 3.4**.**
The 5-vertex v has precisely two 5-neighbors v1 and v3.
As before, we may assume that κ4≤κ5. If κ4≥10, then μ′(v)≥−1+2⋅53≥0.
Suppose that v4 is a 6-vertex. By the absence of ⟨5,6,6,5,∞⟩-stars, we have that κ5≥7. If κ5=7, then μ′(v)≥−1+41+2424−6≥0, for otherwise there is a ⟨5,6,7,5,23⟩-star. If κ5=8, then μ′(v)≥−1+83+85=0, for otherwise, there is a ⟨5,6,8,5,15⟩-star. If κ5=9, then μ′(v)≥−1+125+53≥0, for otherwise there is a ⟨5,6,9,5,14⟩-star. If κ5=10, then μ′(v)≥−1+53+52=0, for otherwise there is a ⟨5,9,5,6,10⟩-star. If κ5=11, then μ′(v)≥−1+2215+31≥0, for otherwise there is a ⟨5,8,5,6,11⟩-star. If 12≤κ5≤17, then μ′(v)≥−1+43+41=0, for otherwise there is a ⟨5,7,5,6,17⟩-star. If κ5≥18, then μ′(v)≥−1+23⋅1818−6≥0.
Suppose that v4 is a 7-vertex. If κ5=7, then μ′(v)≥−1+2⋅41+21=0, for otherwise there is a ⟨5,7,7,5,11⟩-star. If κ5=8, then μ′(v)≥−1+41+83+52≥0, for otherwise there is a ⟨5,7,8,5,9⟩-star. If κ5=9, then μ′(v)≥−1+41+125+31=0, for otherwise there is a ⟨5,8,5,7,9⟩-star. If κ5∈{10,11}, then μ′(v)≥−1+53+2⋅41≥0, for otherwise there is a ⟨5,7,5,7,11⟩-star. If κ5≥12, then μ′(v)≥−1+41+43=0.
Suppose that v4 is an 8-vertex. If κ2≥8, then μ′(v)≥−1+2⋅83+41=0. If κ2≤7, then μ′(v)≥−1+83+2215≥0, for otherwise there is a ⟨5,7,5,8,10⟩-star.
Suppose that v4 is a 9-vertex. If κ5=9, then μ′(v)≥−1+2⋅125+41≥0, for otherwise there is a ⟨5,7,5,9,9⟩-star. If κ5≥10, then μ′(v)≥−1+125+53≥0.
Subcase 3.5**.**
The 5-vertex v has precisely three 5-neighbors v2,v3 and v4.
Note that the vertex v is just a receiver, so we have that min{κ1,κ5}=7,8. If min{κ1,κ5}=6, then μ′(v)≥−1+23⋅β(18)≥0, for otherwise there is a ⟨5,6,6,6,17⟩-star. If min{κ1,κ5}≥9, then μ′(v)≥5−6+125+53≥0, for otherwise there is a ⟨5,7,5,9,9⟩-star.
Subcase 3.6**.**
The 5-vertex v has precisely three 5-neighbors v2,v3 and v5.
Suppose that κ4=7 and v2v3 lies in another 3-face uv2v3. If u is a 12+-vertex, then v receives at least 41 from v2 by R4R4a, and then μ′(v)≥−1+41+43=0, for otherwise v is the center of a ⟨5,5,7,5,23⟩-star. If u is an 11−-vertex, then v receives 41 from v3 by R4R4b, and then μ′(v)≥−1+41+43=0, for otherwise v is the center of a ⟨5,5,7,5,23⟩-star.
If min{κ1,κ4}=8, then v receives at least 81 from v2 or v3 due to R4R4a and R4R4c, which implies that μ′(v)≥−1+41+81+85≥0, for otherwise there is a ⟨5,5,8,5,15⟩-star.
If min{κ1,κ4}=κ1=9. By the absence of ⟨5,5,9,5,14⟩-stars, we have that κ4≥15. If v is a twice-weak 5-neighbor of v1, then \mu^{\prime}(v)\geq-1+\frac{1}{3}+\frac{3}{5}+\big{(}\frac{3}{5}-\frac{1}{2}\big{)}\geq 0 by R4R4a; otherwise we have that \mu^{\prime}(v)\geq-1+\big{(}\frac{1}{3}+\frac{1}{12}\big{)}+\frac{3}{5}\geq 0.
If min{κ1,κ4}=10, then μ′(v)≥−1+52+53=0, for otherwise there is a ⟨5,5,10,5,14⟩-star. If min{κ1,κ4}=11, then μ′(v)≥−1+115+74≥0, for otherwise there is a ⟨5,5,11,5,13⟩-star. If min{κ1,κ4}≥12, then μ′(v)≥−1+2⋅21=0 by R4R4a. This completes the proof of Theorem 12.
Acknowledgments. This work was supported by the National Natural Science Foundation of China (xxxxxxxx) and partially supported by the Fundamental Research Funds for Universities in Henan (YQPY20140051). The authors would like to thank the anonymous referees for their valuable comments and careful reading of this paper.