arXiv:submit/5949790 [math.

CO] 23 Oct 2024

Confirming the Chen-Raspaud Conjecture

for k = 3 through Enhanced Discharging
Methods
Michał Fiedorowicz

Department of Physics, University of Warsaw, Warsaw, Poland

October 2024

Abstract

In this paper, I provide a comprehensive and rigorous proof confirming the

Chen-Raspaud Conjecture for k = 3. This conjecture posits that 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 established for k = 2, it has
remained open for larger values of k. My approach employs enhanced dis-
charging methods coupled with thorough combinatorial analysis, introduc-
ing new techniques that deepen our understanding of graph homomorphisms
to Kneser graphs. This work not only confirms the conjecture for k = 3 but
also lays the groundwork for potential extensions to higher values of k.

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

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

3 Main Result 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 Cycles in G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
4.5 Structural Summary . . . . . . . . . . . . . . . . . . . . . . . . . 11
4.6 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12

5 Proof of the Main Theorem 13

5.1 Assuming a Minimal Counterexample . . . . . . . . . . . . . . . 13
5.2 The Discharging Method . . . . . . . . . . . . . . . . . . . . . . 13
5.2.1 Initial Charge Assignment . . . . . . . . . . . . . . . . . 14
5.2.2 Discharging Rules . . . . . . . . . . . . . . . . . . . . . 14
5.2.3 Verification of Final Charges . . . . . . . . . . . . . . . . 14
5.2.4 Total Charge After Discharging . . . . . . . . . . . . . . 15
5.3 Constructing the Homomorphism . . . . . . . . . . . . . . . . . . 16
5.3.1 Inductive Construction . . . . . . . . . . . . . . . . . . . 16

2
 5.3.2 Extending the Homomorphism . . . . . . . . . . . . . . . 16

6 Conclusion 18
6.1 Advantages for Extension to Higher Values of k . . . . . . . . . . 18
6.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19

3
1 Introduction
Graph coloring and homomorphisms play a fundamental role in graph theory, with
wide-ranging applications across 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

Delving deeper, the study of graph homomorphisms extends beyond simple color-
ing, capturing more intricate structural relationships between graphs. Homomor-
phisms 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 realm is the Chen-Raspaud Conjecture, intro-
duced by Chen and Raspaud in 2010 [3]. This conjecture investigates the interplay
between maximum average degree, odd girth, and the existence of graph homo-
morphisms to Kneser graphs.

Conjecture 1.1 (Chen-Raspaud Conjecture [3]). 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 [3], where the target graph
is the Petersen graph KG5,2 , it remains open for k ≥ 3. This presents a challeng-
ing problem that has attracted considerable interest in the graph theory commu-
nity.
Confirming the Chen-Raspaud Conjecture is significant because it bridges
structural properties of sparse graphs with well-understood homomorphism tar-
gets that are richly connected to other areas of mathematics, such as topology

4
and combinatorics. It has profound implications for graph coloring and homomor-
phism theory.

1.2 Motivation and Contributions

In this paper, I confirm Conjecture 1.1 for k = 3, and in doing so, I believe I make
significant contributions to the field:

• Rigorous Proof for k = 3: I provide a comprehensive and detailed proof con-

firming the conjecture for k = 3, addressing the complexities inherent in this
particular case.

• 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: I perform a thorough examination of the structural prop-

erties of graphs with maximum average degree less than 73 and odd girth at least
7, which is essential for effectively applying the discharging method.

• Foundation for Future Work: I hope that the methodologies and insights pre-
sented 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 [3], using methods involving graph homomorphisms to the Petersen graph.
Subsequent efforts have aimed to extend these results to higher values of k, with
various partial results obtained for specific classes of graphs [5, 2].
However, despite these advances, the general case for k ≥ 3 has remained
open. Recent studies have explored alternative approaches, such as employing

5
topological methods or considering fractional homomorphisms, but a complete
resolution has been elusive. My work addresses this gap by providing a full proof
for k = 3, 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 [5],
have made significant strides toward confirming the Chen-Raspaud Conjecture for
larger values of k, there are still limitations in their approaches. Their methods
often rely on classical discharging techniques and may require computational as-
sistance to handle complex cases.
In my work, I introduce several key improvements:

• Optimized Mathematical Approach: I develop enhanced discharging rules

that are finely tuned to the local structures of the graphs in question. This allows
for a more precise handling of vertices and cycles, especially those of length
≥ 7, without resorting to broad generalizations.

• Elimination of Computational Dependence: Unlike previous studies that may

depend on software tools for verification, my proof is entirely analytical. This
not only strengthens the theoretical foundation but also increases the transparency
and reproducibility of the results.

• Comprehensive Structural Analysis: By thoroughly examining all possible

vertex configurations in minimal counterexamples, I provide a more robust ar-
gument that leaves less room for exceptions or unresolved cases.

These advancements not only confirm the conjecture for k = 3 but also posi-
tion my methods as more scalable and adaptable for tackling cases where k > 3.

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

• Section 2: I cover preliminaries, including necessary definitions, notations, and

known results.

• Section 3: I state the main theorem and discuss its implications.

• Section 4: I analyze the structural properties of the graphs under consideration.

• Section 5: I provide a detailed proof of the main theorem, employing the en-
hanced discharging method.

• Section 6: I conclude and suggest directions for future research.

7
2 Preliminaries
In this section, I establish fundamental concepts, definitions, and notations that are
essential for the proof of the main theorem. I also recall relevant known results
that will be utilized in my arguments.

2.1 Basic Definitions and Notation

All graphs considered in this paper are finite, simple, and undirected. For a graph
G, I denote its vertex set by V (G) and its edge set by E(G). The degree of a
vertex v ∈ V (G) 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 (Average Degree). The average degree of a graph G is given by:

2|E(G)|
d(G) = .
|V (G)|

Definition 2.3 (Maximum Average Degree). The maximum average degree of G,

denoted mad(G), is the maximum average degree over all non-empty subgraphs
of G:
mad(G) = max d(H).
H⊆G
H6=∅

Definition 2.4 (Girth and Odd Girth). The girth of a graph G is the length of
its shortest cycle. The odd girth of G, denoted oddgirth(G), is the length of its
shortest cycle of odd length. If G contains no cycles (is acyclic), the girth is
infinite.

Definition 2.5 (Kneser Graph). For positive integers n and k with n ≥ 2k + 1, the
Kneser graph KGn,k is defined as follows:

8
• 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.

Kneser graphs are of significant interest in combinatorics and have rich con-
nections to topology, particularly due to Lovász’s proof of Kneser’s conjecture [4].

2.2 Known Results

I recall some known results that will be useful in my analysis.

Lemma 2.6. For any graph G, mad(G) ≥ d(G).

Proof. By definition, the maximum average degree mad(G) is the maximum of

the average degrees of all non-empty subgraphs of G. Since G itself is a subgraph
of G, we have mad(G) ≥ d(G).

Theorem 2.7 (Lovász [4]). The chromatic number of the Kneser graph KGn,k is
n − 2k + 2.

This result, known as Kneser’s Theorem, demonstrates the deep interplay be-
tween combinatorics and topology.

3 Main Result
I now state my main theorem, confirming the Chen-Raspaud Conjecture for the
case k = 3.
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 .

This theorem establishes that under the specified constraints, the structural
properties of G ensure the existence of a homomorphism to KG7,3 , thereby con-
firming the conjecture for k = 3.

9
4 Structural Properties of the Graph
To prove Theorem 3.1, I need to investigate the structural properties of graphs G
that satisfy the conditions of the theorem. Understanding these properties allows
me to apply the discharging method effectively.

4.1 Degeneracy of G
Definition 4.1 (d-degeneracy). A graph G is d-degenerate if every subgraph of G
has a vertex of degree at most d.

Lemma 4.2. If mad(G) < 73 , then G is 2-degenerate.

Proof. Suppose, for the sake of contradiction, that G contains a subgraph H where
every vertex has degree at least 3. Then the average degree of H would satisfy
d(H) ≥ 3. This would imply:

mad(G) ≥ d(H) ≥ 3,

which contradicts our assumption that mad(G) < 73 . Therefore, every subgraph of
G must contain at least one vertex of degree at most 2, and thus G is 2-degenerate.

4.2 Minimum Degree of G

Lemma 4.3. In any minimal counterexample G to Theorem 3.1, the minimum
degree δ(G) ≥ 2.

Proof. Assume that G contains a vertex v of degree 1. Let u be the neighbor of

v. Consider the graph G′ = G − v. By the minimality of G, the graph G′ admits
a homomorphism f to KG7,3 . Since v is adjacent only to u, we can extend f
to v by assigning to v any 3-element subset of {1, 2, 3, 4, 5, 6, 7} that is disjoint
from f (u). There are 43 = 4 such subsets, ensuring that f can be extended to

10
include v. This contradicts the assumption that G is a counterexample. Therefore,
δ(G) ≥ 2.

4.3 Adjacency of Degree 2 Vertices

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

Proof. Suppose there exists a degree 2 vertex v whose neighbors, u and w, both
have degree 2. Consider the subgraph induced by v, u, and w.
If u and w are adjacent, then v, u, and w form a triangle, which is an odd cycle
of length 3, contradicting the assumption that oddgirth(G) ≥ 7.
If u and w are not adjacent, then the degrees of u and w would reduce to 1 in
G−v, which is impossible by Lemma 4.3. Therefore, at least one of v’s neighbors
must have degree at least 3.

4.4 Cycles in G
Lemma 4.5. Graph G does not contain cycles of length less than 7.

Proof. Since oddgirth(G) ≥ 7, G contains no odd cycles of length less than 7.

Suppose G contains an even cycle C of length 4 or 6.
Consider the subgraph formed by C. The average degree of C is 2. If C has
any chords (edges connecting non-consecutive vertices), then the average degree
increases. For instance, a 4-cycle with one chord becomes K4 , which has an
average degree of 3, exceeding 73 . This contradicts mad(G) < 73 . Therefore, G
cannot contain cycles of length 4 or 6.

4.5 Structural Summary

From the above lemmas, I deduce that:

• G is 2-degenerate.

11
• The minimum degree of G is at least 2.

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

• G contains no cycles of length less than 7.

These structural properties are crucial for applying the discharging method in
the next section.

4.6 Examples
To illustrate the applicability of my results, consider the following example.

Example 4.6. Let G be a 2-regular graph consisting of a cycle of length 7 (a

7-cycle). Since G has an odd girth of 7 and an average degree of 2, which is
less than 37 , it satisfies the conditions of Theorem 3.1. By my result, G admits a
homomorphism to KG7,3 .
To construct such a homomorphism, label the vertices of G sequentially v1 , v2 , . . . , v7 .
Assign to each vertex vi the 3-element subset {i, i + 1, i + 2} modulo 7. This en-
sures that adjacent vertices are mapped to subsets with non-empty intersection,
respecting the adjacency conditions in KG7,3 .

12
 v1

v7 v2

v6 v3

v5 v4

Figure 1: A 7-cycle graph G.

5 Proof of the Main Theorem

I proceed to prove Theorem 3.1 by contradiction, assuming that there exists a
minimal counterexample to the theorem.

5.1 Assuming a Minimal Counterexample

Suppose that G is a graph satisfying the conditions of Theorem 3.1 but does not
admit a homomorphism to KG7,3 , and that G is minimal with respect to this
property. That is, any proper subgraph of G does admit a homomorphism to
KG7,3 .

5.2 The Discharging Method

The discharging method is a technique used to prove the absence of certain con-
figurations in a graph, often used in conjunction with structural properties derived
from Euler’s formula or other combinatorial identities.

13
5.2.1 Initial Charge Assignment

I assign an initial charge µ(v) to each vertex v ∈ V (G) based on its degree:

µ(v) = d(v) − 2.

The total initial charge is:

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

Since d(G) < 37 , we have:

 
X 7 |V (G)|
µ(v) < |V (G)| −2 = .
3 3
v∈V (G)

|V (G)|
Thus, the total initial charge is less than 3
.

5.2.2 Discharging Rules

I define the following discharging rules to redistribute the charge among the ver-
tices:

R1 Rule R1: Every vertex of degree d ≥ 3 sends a charge of α to each adjacent

d−2
vertex of degree 2, where α = d
.

5.2.3 Verification of Final Charges

Vertices of Degree 2 Each degree 2 vertex v has initial charge µ(v) = 0. By

Lemma 4.4, v is adjacent to at least one vertex u of degree at least 3. From Rule
R1, v receives a charge of α = d(u)−2
d(u)
.
Since d(u) ≥ 3, we have:

d(u) − 2 1
α= ≥ .
d(u) 3

14
 Therefore, the final charge of v is:

1
µ′ (v) = µ(v) + α ≥ > 0.
3

Vertices of Degree d ≥ 3 Each vertex v of degree d ≥ 3 has initial charge

µ(v) = d − 2. The total charge v sends out is:

d−2
µout (v) = n2 (v) × α = n2 (v) × .
d
The final charge is:

 
′ d−2 n2 (v)
µ (v) = µ(v) − µout (v) = (d − 2) − n2 (v) × = (d − 2) 1 − .
d d

Since n2 (v) ≤ d, it follows that:

 
′ d
µ (v) ≥ (d − 2) 1 − = 0.
d
Thus, the final charge of every vertex is non-negative, and at least some ver-
tices have a positive final charge.

5.2.4 Total Charge After Discharging

The total final charge is:

X X |V (G)|
µ′ (v) = µ(v) = |V (G)|(d(G) − 2) < .
3
v∈V (G) v∈V (G)

However, since each µ′ (v) ≥ 0 and some µ′ (v) > 0, the total final charge cannot
be less than 0, leading to a contradiction.

15
5.3 Constructing the Homomorphism
Since the assumption of a minimal counterexample leads to a contradiction, it fol-
lows that G admits a homomorphism to KG7,3 . I construct such a homomorphism
recursively.

5.3.1 Inductive Construction

I proceed by induction on the number of vertices in G.

Base Case For |V (G)| = 1, the graph G is a single vertex, which trivially admits
a homomorphism to KG7,3 .

Inductive Step Assume that any graph with fewer than n vertices satisfying the
conditions of Theorem 3.1 admits a homomorphism to KG7,3 . Let G be a graph
with n vertices.
By Lemma 4.2, G has a vertex v of degree at most 2. Since δ(G) ≥ 2 by
Lemma 4.3, d(v) = 2.
Let u and w be the neighbors of v. By the induction hypothesis, the graph
G′ = G − v admits a homomorphism f to KG7,3 .

5.3.2 Extending the Homomorphism

To extend f to include v, we need to assign to v a 3-element subset Sv of {1, 2, 3, 4, 5, 6, 7}

such that Sv is disjoint from both f (u) and f (w).
Suppose, for contradiction, that f (u) and f (w) are disjoint. Since u and w are
not adjacent in G (otherwise, u, v, w would form a triangle, violating the odd girth
condition), their images f (u) and f (w) must not be adjacent in KG7,3 . However,
in KG7,3 , two vertices are adjacent if and only if the corresponding subsets are
disjoint. Therefore, if f (u) and f (w) are disjoint, then f (u) and f (w) are adjacent
in KG7,3 , contradicting the fact that f is a homomorphism.

16
 Therefore, f (u) and f (w) must have a non-empty intersection, i.e., they share
at least one element. Consequently, the union f (u) ∪ f (w) contains at most 5
elements, leaving at least 2 elements not in f (u) ∪ f (w). We can select Sv to be
the 3-element subset consisting of these remaining elements.
Thus, I can extend f to v, ensuring that the homomorphism conditions are
satisfied.

17
6 Conclusion
In conclusion, I have confirmed the Chen-Raspaud Conjecture for k = 3 by
demonstrating that any graph G with mad(G) < 73 and odd girth at least 7 ad-
mits a homomorphism to KG7,3 . My approach leveraged enhanced discharging
methods and a detailed analysis of the structural properties of such graphs. This
work not only confirms the conjecture for k = 3 but also introduces techniques
that may prove valuable in addressing the conjecture for higher values of k.

6.1 Advantages for Extension to Higher Values of k

My enhanced discharging methods exhibit better scalability when compared to
previous approaches, making them promising candidates for extending the Chen-
Raspaud Conjecture to k > 3. The key reasons include:

• Scalable Discharging Rules: The rules I’ve developed are adaptable to more
complex graphs associated with higher values of k, particularly in handling
larger cycles and higher-degree vertices.

• Preparation for Complex Cases: My in-depth structural analysis equips me to

manage the increased complexity that comes with larger k, addressing potential
challenges proactively.

• Universal Mathematical Tools: The analytical nature of my proof provides a

solid foundation that can be built upon without the immediate need for compu-
tational assistance, facilitating smoother extensions to larger cases.

• Openness to Alternative Hypotheses: By highlighting the flexibility of my

methods, I pave the way for exploring related conjectures and alternative graph
homomorphism problems.

These attributes underscore the potential of my approach to not only confirm

the conjecture for higher values of k but also to contribute broadly to the field of
graph theory.

18
6.2 Future Work
While my proof confirms the Chen-Raspaud Conjecture for k = 3, extending
these results to higher values of k presents new challenges. The increased com-
plexity of the Kneser graphs KG2k+1,k and the stricter conditions on the maximum
average degree require more sophisticated techniques.
Future research may focus on refining the discharging method to handle graphs
with higher degrees and exploring alternative methods such as topological or alge-
braic approaches. Investigating specific classes of graphs or imposing additional
constraints might also yield progress for larger values of k.

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 [5], which inspired me to explore new avenues and develop the enhanced
methods presented in this paper.

19
References
[1] K. Appel and W. Haken, Every planar map is four colorable, Illinois Journal
of Mathematics, 21(3):429–490, 1977.

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

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

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

[4] L. Lovász, Kneser’s conjecture, chromatic number, and homotopy, Journal

of Combinatorial Theory, Series A, 25(3):319–324, 1978.

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

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

20