报 告 人：邓科财 副教授

报告题目：On antimagic labeling of bipartite graphs

报告时间：2025年4月16日（周三）上午10:00

报告地点：腾讯会议 147-707-080

主办单位：数学与统计学院、数学研究院、科学技术研究院

报告人简介： 

     邓科财，毕业于厦门大学数学科学学院，师从钱建国教授和张福基教授。目前就职于华侨大学数学科学学院，副教授，硕士生导师。主要研究图的染色、极值图论等，发表学术论文20余篇，主持国家自然科学基金青年项目1项，福建省自然科学基金一项，担任福建省运筹学会理事。

报告摘要：

      An antimagic labeling of a graph $G$ of size $m$ is a one-to-one mapping $f: E_G\rightarrow\{1,2,\ldots,m\}$, ensuring that the vertex sums in $V_G$ are pairwise distinct, where a vertex sum of a vertex $v$ in $V_G$  is   defined as the sum of the labels of the edges incident to $v$. A graphis called antimagic if it admits an antimagic labeling. The Antimagic Conjecture, proposed by Hartsfield and Ringel in 1990, posits that  every connected graph other than $K_2$ is antimagic. We shows that every bipartite graph with minimum degree at least 15 is antimagic. Our approach primarily utilizes a consequence of K\{o}nig's Theorem, the existence of a subgraph of certain size without Eulerian component, and a labeling lemma that allows certain vertex sums to be divisible by 3, while others are not.