Beginning2019-12-30 16:00:00
Ending2019-12-30 17:00:00
Event titleColloquium-Prime Sum Graphs and Prime Difference Graphs
Speaker陳宏賓教授 (國立中興大學 / UniMath主編)
Place1F Room 101, General Building III
DescriptionClick here to read
Attached file File download Adobe PDF
Reference link 

A graph G defined on [n], the set of positive integers from 1 to n, is a prime sum graph provided that {a, b} is an edge of G whenever the sum a + b is a prime. The prime difference graph will be defined similarly whenever |a – b| is a prime. Filz in 1982 posed the conjecture that the prime sum graph is Hamiltonian provided n is an even integer larger than 3, i.e., integers 1, 2, …, 2n can be arranged in a circle such that the sum of every adjacent pairs is a prime number.

In this talk, I shall report recent progress towards Filz’s conjecture and some analogue results on prime difference graphs, which are defined similarly by replacing a+b with |a-b| as the prime edge condition.

Last Update Time2019-12-30 09:49:13
Decorative image
cron web_use_log