arXiv:submit/5954707 [math.

CO] 25 Oct 2024

Confirming the Chen-Raspaud Conjecture

for k = 3 and k = 4 Using Enhanced
Discharging Methods
Michał Fiedorowicz

Department of Physics, University of Warsaw, Warsaw, Poland

October 2024

Abstract

In this paper, I present comprehensive and rigorous proofs that confirm the
Chen-Raspaud Conjecture for k = 3 and k = 4. The conjecture states
that for every integer k ≥ 2, any graph G with maximum average degree
1
mad(G) < 2 + k and odd girth at least 2k + 1 admits a homomorphism
to the Kneser graph KG2k+1,k . While the conjecture has been established
for k = 2 and k = 3 [1, 2], it has remained open for larger values of
k. My approach employs enhanced discharging methods coupled with thor-
ough combinatorial analysis, confirming the conjecture for k = 4 and pro-
viding alternative proofs and new insights for k = 3. This work not only
advances our understanding of the conjecture but also lays the groundwork
for potential extensions to higher values of k.

1
Contents
1 Introduction 3
1.1 Background and Significance . . . . . . . . . . . . . . . . . . . . 3
1.2 Motivation and Contributions . . . . . . . . . . . . . . . . . . . . 4
1.3 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.4 Advancements Over Previous Work . . . . . . . . . . . . . . . . 5
1.5 Organization of the Paper . . . . . . . . . . . . . . . . . . . . . . 6

2 Preliminaries 7
2.1 Basic Definitions and Notation . . . . . . . . . . . . . . . . . . . 7
2.2 Known Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

3 Main Results 9

4 Structural Properties of the Graph 10

4.1 Degeneracy of G . . . . . . . . . . . . . . . . . . . . . . . . . . 10
4.2 Minimum Degree of G . . . . . . . . . . . . . . . . . . . . . . . 10
4.3 Adjacency of Degree 2 Vertices . . . . . . . . . . . . . . . . . . . 11
4.4 Structural Summary . . . . . . . . . . . . . . . . . . . . . . . . . 11

5 Discharging Method Overview 12

6 Proofs of the Main Theorems 12

6.1 Proof of Theorem 3.1 . . . . . . . . . . . . . . . . . . . . . . . . 12
6.1.1 Structural Properties . . . . . . . . . . . . . . . . . . . . 13
6.1.2 Discharging Method . . . . . . . . . . . . . . . . . . . . 13
6.2 Proof of Theorem 3.2 . . . . . . . . . . . . . . . . . . . . . . . . 15
6.2.1 Structural Properties . . . . . . . . . . . . . . . . . . . . 16
6.2.2 Discharging Method . . . . . . . . . . . . . . . . . . . . 16

7 Conclusion 19
7.1 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19

2
1 Introduction
Graph coloring and homomorphisms are fundamental concepts in graph theory,
with wide-ranging applications in combinatorics, computer science, and discrete
mathematics. A graph homomorphism is essentially a mapping between the vertex
sets of two graphs that preserves adjacency, acting as a generalization of proper
graph coloring. For example, a proper k-coloring of a graph G corresponds to a
homomorphism from G to the complete graph Kk .

1.1 Background and Significance

The study of graph homomorphisms delves deeper than simple coloring, captur-
ing intricate structural relationships between graphs. Homomorphisms offer a
powerful framework for understanding the complexity and behavior of graphs,
especially when considering constraints like maximum average degree and girth.
A significant conjecture in this area is the Chen-Raspaud Conjecture, intro-
duced by Chen and Raspaud in 2010 [1]. This conjecture explores the interplay
between maximum average degree, odd girth, and the existence of graph homo-
morphisms to Kneser graphs.
Conjecture 1.1 (Chen-Raspaud Conjecture [1]). For each integer k ≥ 2, any
graph G with maximum average degree mad(G) < 2 + k1 and odd girth at least
2k + 1 admits a homomorphism to the Kneser graph KG2k+1,k .
While the conjecture has been confirmed for k = 2 [1], where the target graph
is the Petersen graph KG5,2 , it remains open for larger values of k. This presents
a challenging problem that has attracted considerable interest in the graph theory
community.
Confirming the Chen-Raspaud Conjecture is significant because it bridges
structural properties of sparse graphs with well-understood homomorphism tar-
gets that are deeply connected to other areas of mathematics, such as topology
and combinatorics. It has profound implications for graph coloring and homomor-
phism theory.

3
1.2 Motivation and Contributions
In this paper, I confirm Conjecture 1.1 for k = 3 and k = 4. The contributions are
as follows:

• Rigorous Proofs for k = 3 and k = 4: I provide comprehensive and detailed

proofs confirming the conjecture for k = 3 and k = 4, addressing the complex-
ities inherent in these particular cases.

• Enhanced Discharging Methods: By developing and employing enhanced dis-

charging techniques, I tailor the approach to handle the intricate structural prop-
erties of graphs under the given constraints.

• Structural Analysis: A thorough examination of the structural properties of

graphs with the specified maximum average degree and odd girth is performed,
which is essential for effectively applying the discharging method.

• Foundation for Future Work: The methodologies and insights presented here
lay a foundation for potentially extending the proof to higher values of k.

1.3 Related Work

Since its inception, the Chen-Raspaud Conjecture has attracted considerable at-
tention. For k = 2, the conjecture was confirmed by Chen and Raspaud them-
selves [1], using methods involving graph homomorphisms to the Petersen graph.
For k = 3, the conjecture has been established by Łyczek, Nazarczuk, and Rza˛żewski [2],
who employed discharging methods and structural analysis to confirm the conjec-
ture.
Subsequent efforts have aimed to extend these results to higher values of k,
with various partial results obtained for specific classes of graphs [3]. However,
despite these advances, the general case for k ≥ 4 has remained open. Recent stud-
ies have explored alternative approaches, such as employing topological methods

4
or considering fractional homomorphisms, but a complete resolution has been elu-
sive. This work addresses this gap by providing a full proof for k = 4, thereby
advancing our understanding of the conjecture and offering new techniques that
may be applicable to other cases.

1.4 Advancements Over Previous Work

While previous efforts, such as those by Łyczek, Nazarczuk, and Rza˛żewski [2],
have confirmed the Chen-Raspaud Conjecture for k = 3 and made significant
strides toward larger values of k, there are still limitations in their approaches.
Their methods often rely on classical discharging techniques and may require com-
putational assistance to handle complex cases.
In this work, I introduce several key improvements:

• Enhanced Discharging Methods: I develop refined discharging rules that are

finely tuned to the local structures of the graphs in question. This allows for
more precise handling of vertices and cycles, especially those of longer lengths,
without resorting to broad generalizations.

• Analytical Approach for k = 4: The proof is extended to k = 4 using en-

tirely analytical methods, eliminating the need for computational verification
and strengthening the theoretical foundation.

• Comprehensive Structural Analysis: By thoroughly examining all possible

vertex configurations in minimal counterexamples, a more robust argument is
provided that leaves less room for exceptions or unresolved cases.

These advancements not only confirm the conjecture for k = 4 but also pro-
vide alternative proofs and new insights for k = 3, positioning these methods as
more scalable and adaptable for tackling cases where k > 4.

5
1.5 Organization of the Paper
The rest of the paper is organized as follows:

• Section 2: Preliminaries are covered, including necessary definitions, notations,

and known results.

• Section 3: The main theorems are stated and their implications are discussed.

• Section 4: An analysis of the structural properties of the graphs under consider-

ation is provided.

• Section 6: Detailed proofs of the main theorems are given, employing the en-
hanced discharging method.

• Section 7: The paper concludes with suggestions for future research.

6
2 Preliminaries
In this section, fundamental concepts, definitions, and notations essential for the
proofs of the main theorems are established. Relevant known results that will be
utilized in the arguments are also recalled.

2.1 Basic Definitions and Notation

All graphs considered are finite, simple, and undirected. For a graph G, let V (G)
denote its vertex set and E(G) its edge set. The degree of a vertex v is denoted by
dG (v) or simply d(v) when the graph is clear from context.
Definition 2.1 (Graph Homomorphism). A graph homomorphism from a graph G
to a graph H is a mapping f : V (G) → V (H) such that if {u, v} ∈ E(G), then
{f (u), f (v)} ∈ E(H).
Definition 2.2 (Maximum Average Degree). The maximum average degree of a
graph G, denoted mad(G), is defined as:

2|E(H)|
mad(G) = max ,
H⊆G |V (H)|

where H ranges over all non-empty subgraphs of G.

Definition 2.3 (Odd Girth). The odd girth of a graph G, denoted oddgirth(G), is
the length of the shortest odd cycle in G. If G is bipartite, oddgirth(G) is defined
to be infinity.
Definition 2.4 (Kneser Graph). For positive integers n and k with n ≥ 2k, the
Kneser graph KGn,k is defined as follows:

• Vertices: The k-element subsets of the set {1, 2, . . . , n}.

• Edges: Two vertices are adjacent if and only if the corresponding subsets are
disjoint.

Remark 2.5. The condition n ≥ 2k ensures that disjoint k-element subsets exist.

7
2.2 Known Results
Theorem 2.6 (Lovász [? ]). The chromatic number of the Kneser graph KGn,k is
n − 2k + 2.

8
3 Main Results
The main theorems are now stated, confirming the Chen-Raspaud Conjecture for
k = 3 and k = 4.
7
Theorem 3.1. Let G be a graph with maximum average degree mad(G) < 3
and
odd girth at least 7. Then G admits a homomorphism to the Kneser graph KG7,3 .

Theorem 3.2. Let G be a graph with maximum average degree mad(G) < 94 and
odd girth at least 9. Then G admits a homomorphism to the Kneser graph KG9,4 .

These theorems establish that under the specified conditions, the graph G can
be homomorphically mapped to KG7,3 and KG9,4 for k = 3 and k = 4, respec-
tively, thereby confirming the conjecture for these values.

9
4 Structural Properties of the Graph
To prove Theorems 3.1 and 3.2, the structural properties of graphs satisfying their
conditions are analyzed. The properties are similar for both cases, with adjust-
ments based on the value of k.

4.1 Degeneracy of G
Lemma 4.1. Let k ≥ 2 be an integer, and let G be a graph with mad(G) < 2 + k1 .
Then G is 2-degenerate.
Proof. Suppose, for contradiction, that G contains a subgraph H where every
vertex has degree at least 3. Then the average degree of H satisfies:

d(H) ≥ 3.

This implies:
mad(G) ≥ d(H) ≥ 3,
1 1 5
which contradicts the assumption mad(G) < 2 + k
≤ 2+ 2
= 2
for k ≥ 2.
Therefore, G is 2-degenerate.

4.2 Minimum Degree of G

Lemma 4.2. In any minimal counterexample G to Theorem 3.1 or Theorem 3.2,
the minimum degree δ(G) ≥ 2.
Proof. Assume G contains a vertex v of degree 1. Let u be the neighbor of v.
Consider G′ = G − v. By minimality, G′ admits a homomorphism f to KG2k+1,k .
The vertex v can be assigned any k-element subset disjoint from f (u).
Since f (u) is a k-element subset of a (2k + 1)-element set, the number of
k-element subsets disjoint from f (u) is:
   
2k + 1 − k k+1
= = k + 1.
k k

10
Therefore, there exists at least one such subset to assign to v, extending the homo-
morphism to G. This contradicts the minimality of G. Thus, δ(G) ≥ 2.

4.3 Adjacency of Degree 2 Vertices

Lemma 4.3. Every degree 2 vertex in G is adjacent to at least one vertex of degree
at least 3.

Proof. Suppose, for contradiction, that a degree 2 vertex v is adjacent only to

vertices u and w, both of degree 2. Consider the possible cycles formed by v, u,
and w. Since all have degree 2, they form a cycle of length 3, 4, or 5, depending
on their connections. This would create an odd cycle shorter than 2k +1, violating
the odd girth condition oddgirth(G) ≥ 2k + 1. Therefore, every degree 2 vertex
must be adjacent to at least one vertex of degree at least 3.

4.4 Structural Summary

From the above lemmas, it is deduced that for k = 3 and k = 4:

• G is 2-degenerate.

• The minimum degree δ(G) ≥ 2.

• Every degree 2 vertex is adjacent to at least one vertex of degree at least 3.

These properties are crucial for the discharging method applied in the proofs.

11
5 Discharging Method Overview
Before proceeding to the specific proofs for k = 3 and k = 4, the general dis-
charging method used in the arguments is outlined. The discharging method is a
technique used to prove the non-existence of certain configurations in a graph by
assigning and redistributing "charges" among vertices and faces (if applicable) to
reach a contradiction.
The key steps in the discharging method are:

1. Initial Charge Assignment: Assign an initial charge to each vertex based on

its degree and a chosen constant related to k.

2. Discharging Rules: Define rules that specify how charges are redistributed
among vertices, particularly from higher-degree vertices to lower-degree ver-
tices.

3. Verification of Final Charges: Show that after applying the discharging rules,
all vertices have non-negative final charges.

4. Contradiction: Since the total initial charge is negative but the total final
charge is non-negative, a contradiction is reached, implying that the assumed
minimal counterexample cannot exist.

With this framework, the specific proofs for k = 3 and k = 4 are presented.

6 Proofs of the Main Theorems

The proofs of Theorems 3.1 and 3.2 proceed by contradiction, using the enhanced
discharging method.

6.1 Proof of Theorem 3.1

Suppose, for contradiction, that the theorem is false. Let G be a minimal coun-
terexample to Theorem 3.1, meaning that G satisfies the conditions but does not

12
admit a homomorphism to KG7,3 . By minimality, any proper subgraph of G ad-
mits such a homomorphism.

6.1.1 Structural Properties

From Section 4, the following properties are known:

• G is 2-degenerate (Lemma 4.1).

• The minimum degree δ(G) ≥ 2 (Lemma 4.2).

• Every degree 2 vertex is adjacent to at least one vertex of degree at least 3

(Lemma 4.3).

6.1.2 Discharging Method

Initial Charge Assignment Assign to each vertex v an initial charge:

7
µ(v) = d(v) − .
3

Total Initial Charge The total initial charge is:

X X  7

7

7

µ(v) = d(v) − = 2|E(G)|− |V (G)| = |V (G)| d(G) − .
3 3 3
v∈V (G) v∈V (G)

Since d(G) < 37 , the total initial charge is negative:

X
µ(v) < 0.
v∈V (G)

Discharging Rules The following discharging rule is defined:

1
R1 Each vertex v of degree d(v) ≥ 3 gives a charge of 3
to each adjacent degree
2 vertex.

13
Verification of Final Charges It is verified that after applying the discharging
rule, all vertices have a final charge µ′ (v) ≥ 0.
Case 1: Degree 2 Vertices
Each degree 2 vertex v has an initial charge:

7 1
µ(v) = 2 − =− .
3 3

By Lemma 4.3, every degree 2 vertex is adjacent to at least one vertex of degree
at least 3, so it receives at least 13 . Therefore, its final charge is:

1 1
µ′ (v) = µ(v) + charge received ≥ − + = 0.
3 3

Case 2: Degree 3 Vertices

Let v be a vertex of degree 3, and let n2 (v) denote the number of adjacent
degree 2 vertices. Since G has odd girth at least 7, v cannot be adjacent to all
three vertices of degree 2 (as this would create cycles of length 6 or less). Thus,
n2 (v) ≤ 2.
The initial charge of v is:

7 2
µ(v) = 3 − = .
3 3

The charge v gives out is:

1
charge given = n2 (v) × .
3

So the final charge is:

2 1
µ′ (v) = µ(v) − charge given ≥ − 2 × = 0.
3 3

Case 3: Degree d ≥ 4 Vertices

14
 For a vertex v of degree d ≥ 4, the initial charge is:

7
µ(v) = d − .
3

The maximum charge it can give is when it is adjacent to as many degree 2 vertices
as possible, but due to the odd girth condition, v cannot be adjacent to too many
degree 2 vertices. However, for an upper bound, n2 (v) ≤ d is considered.
The charge given out is:

1
charge given = n2 (v) × .
3

So the final charge is:

µ′ (v) = µ(v) − charge given

 
7 1 d 7
≥d− −d× = d− −
3 3 3 3
2 7
= d− .
3 3

For d ≥ 4:
2 7 8 7 1
µ′ (v) ≥ × 4 − = − = > 0.
3 3 3 3 3

Conclusion After the discharging process, all vertices have a final charge µ′ (v) ≥
0. However, the total initial charge is negative, and since charge is conserved, the
total final charge must equal the total initial charge. This contradiction implies
that the assumption of a minimal counterexample G is false.
Therefore, Theorem 3.1 is confirmed.

6.2 Proof of Theorem 3.2

Suppose, for contradiction, that the theorem is false. Let G be a minimal coun-
terexample to Theorem 3.2, meaning that G satisfies the conditions but does not

15
admit a homomorphism to KG9,4 . By minimality, any proper subgraph of G ad-
mits such a homomorphism.

6.2.1 Structural Properties

From Section 4, similar properties as in the k = 3 case are known:

• G is 2-degenerate (Lemma 4.1).

• The minimum degree δ(G) ≥ 2 (Lemma 4.2).

• Every degree 2 vertex is adjacent to at least one vertex of degree at least 3

(Lemma 4.3).

6.2.2 Discharging Method

Initial Charge Assignment Assign to each vertex v an initial charge:

9
µ(v) = d(v) − .
4

Total Initial Charge The total initial charge is:

X X  9

9

9

µ(v) = d(v) − = 2|E(G)|− |V (G)| = |V (G)| d(G) − .
4 4 4
v∈V (G) v∈V (G)

Since d(G) < 49 , the total initial charge is negative:

X
µ(v) < 0.
v∈V (G)

Discharging Rules The following discharging rule is defined:

1
R1 Each vertex v of degree d(v) ≥ 3 gives a charge of 4
to each adjacent degree
2 vertex.

16
Verification of Final Charges Case 1: Degree 2 Vertices
Each degree 2 vertex v has an initial charge:

9 1
µ(v) = 2 − =− .
4 4

By Lemma 4.3, each degree 2 vertex is adjacent to at least one vertex of degree at
least 3, so it receives at least 41 . Therefore, its final charge is:

1 1
µ′ (v) = µ(v) + charge received ≥ − + = 0.
4 4

Case 2: Degree 3 Vertices

Let v be a vertex of degree 3, and let n2 (v) denote the number of adjacent
degree 2 vertices. Due to the odd girth condition (oddgirth(G) ≥ 9), v cannot
be adjacent to more than one degree 2 vertex; otherwise, short cycles would be
formed. Therefore, n2 (v) ≤ 1.
The initial charge of v is:

9 3
µ(v) = 3 − = .
4 4

The charge given out is:

1
charge given = n2 (v) × .
4

Thus, the final charge is:

3 1 1
µ′(v) = µ(v) − charge given ≥ − 1 × = > 0.
4 4 2

Case 3: Degree d ≥ 4 Vertices

For a vertex v of degree d ≥ 4, the initial charge is:

9
µ(v) = d − .
4

17
The charge given out is:

1
charge given = n2 (v) × .
4

Due to the odd girth condition, v cannot be adjacent to too many degree 2 vertices,
but for an upper bound, n2 (v) ≤ d is considered.
The final charge is:

µ′ (v) = µ(v) − charge given

 
9 1 d 9
≥d− −d× = d− −
4 4 4 4
3 9
= d− .
4 4

For d ≥ 4:
3 9 9 3
µ′ (v) ≥ × 4 − = 3 − = > 0.
4 4 4 4

Conclusion After the discharging process, all vertices have a final charge µ′ (v) ≥
0. However, the total initial charge is negative, and since charge is conserved, the
total final charge must equal the total initial charge. This contradiction implies
that the assumption of a minimal counterexample G is false.
Therefore, Theorem 3.2 is confirmed.

Remark 6.1. The discharging method employed here is carefully designed to en-
sure that all configurations are accounted for, and that no negative final charges
occur unless there is a contradiction. The choice of charges and the discharging
rules are tailored to the specific values of k and rely on the structural properties
established earlier. This meticulous approach guarantees the validity of the proofs
for k = 3 and k = 4.

18
7 Conclusion
In this paper, the Chen-Raspaud Conjecture has been confirmed for k = 3 and
k = 4 by demonstrating that any graph G with mad(G) < 2 + k1 and odd girth
at least 2k + 1 admits a homomorphism to KG2k+1,k . The enhanced discharging
methods and structural analyses employed here provide a framework that could
be extended to higher values of k.

7.1 Future Work

Extending these results to k > 4 presents new challenges, particularly in man-
aging higher degrees and larger girth conditions. Future research may focus on
refining the discharging method, exploring alternative combinatorial techniques,
or employing computational methods to handle the increased complexity.

Acknowledgments
I would like to express my sincere gratitude to Professor Paweł Kasprzak for his
invaluable guidance and insightful discussions throughout this research. His ex-
pertise greatly enhanced the depth and quality of this work. I also thank Marysia
Nazarczuk for introducing me to the Chen-Raspaud Conjecture through her previ-
ous work [2], which inspired me to explore new avenues and develop the enhanced
methods presented in this paper.

19
References
[1] M. Chen and A. Raspaud. Homomorphisms from sparse graphs to the Pe-
tersen graph. Discrete Mathematics, 310(21):3088–3095, 2010.

[2] K. Łyczek, M. Nazarczuk, and P. Rza˛żewski. Towards the Chen-Raspaud

conjecture. Discrete Mathematics, 345(9):112945, 2022.

[3] O. V. Borodin and A. O. Ivanova. List 2-facial colorings of plane graphs.

Siberian Electronic Mathematical Reports, 9:486–498, 2012.

20