Vector flows of graphs
小
中
大
发布日期:2026-11-20 10:39:34
Vector flows of graphs generalize classical nowhere-zero integer flows and are closely related to Tutte's 5-Flow Conjecture and Jain's $S^2$-Flow Conjecture. In this talk, we present some of our recent results on vector flows of graphs. We first consider high-dimensional $p$-normed flows and establish upper bounds on the flow indices in dimensions two and three for general bridgeless graphs. We also obtain sharp upper bounds for graphs admitting nowhere-zero 4-flows and investigate the relationship between high-dimensional vector flows and oriented cycle covers, obtaining several sufficient conditions for the corresponding flow indices to equal $2$. We then study the relationship between $S^1$-flows and nowhere-zero 3-flows. In particular, we prove that a graph with maximum degree at most four admits an $S^1$-flow if and only if it admits a nowhere-zero 3-flow. Furthermore, we develop several reduction techniques for $S^1$-flows and use them to characterize the existence of $S^1$-flows in triangularly connected graphs and graphs containing a spanning triangle-tree.
李辰星,南开大学数学科学学院博士研究生,师从李佳傲教授。研究方向为结构图论,主要关注图的染色、流及其相关问题,同时对符号图的结构与染色问题有一定的研究兴趣。研究工作主要涉及图的组合结构与染色、流的存在性之间的关系,以及相关问题的结构刻画。目前已有1 篇论文被《数学学报(英文版)》接收。
学术活动


