Association of Women in Mathematics Seminar

Speaker: Dr. Zhanar Berikkyzy, UC Riverside

Topic: Two Combinatorial Problems

Description: In this talk, we will discuss antimagic graphs and anti-van der Waerden numbers. A graph G is antimagic if there exists a bijective edge labeling with numbers from {1, ..., |E(G)|} such that the vertex sums are  pairwise distinct. It is known that the cycles, paths, complete graphs, and wheels are all antimagic. The antimagic graph conjecture states that every simple connected graph other than K_2 is antimagic. We will discuss some of the known results and variations of this problem. The anti-van der Waerden number is the smallest r such that every exact r-coloring of [n] contains a rainbow k-term arithmetic progression. We will give results for the case when k=3. 

Thursday, November 29 at 12:40pm to 2:00pm

Skye Hall (Surge Hall), 284

Recent Activity