From the 1-2-3 Conjecture to the Riemann Hypothesis

2020/03/05 by Grytczuk, Jarosław · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2003.02887

Abstract

This survey presents some combinatorial problems with number-theoretic flavor. Our journey starts from a simple graph coloring question, but at some point gets close to a dangerous territory of the Riemann Hypothesis. We will mostly focus on open problems, but we will also provide some simple proofs, just for adorning.

Cited by

• Every graph is uniform-span (2,2)-choosable: Beyond the 1-2 conjecture

Related

• Proof of the Riemann's hypothesis
• How is a graph like a manifold?
• Some Open Problems in Combinatorial Physics
• Reverse Mathematics and Recursive Graph Theory
• Hodge theory in combinatorics