加入支持让我们有继续维护的动力！会员畅享查看所有预告
立即购买
On the degeneracy of planar graphs
- 来源：
- 学校官网
- 收录时间：
- 2026-04-05 14:14:33
- 时间：
- 2026-01-16 15:40:00
- 地点：
- 七教7215会议室
- 报告人：
- 王艺桥
- 学校：
- 北京交通大学
- 关键词：
- degenerate graph, planar graph, k-cycle, graph theory, graph coloring
- 简介：
- A graph G is k-degenerate if every subgraph of G contains a vertex of degree at most k. In this talk, we discuss the degeneracy of some graphs. In particular, we show that for each fixed integer k∈{3,4,...,12}, planar graphs without k-cycles are 4-degenerate. The result is best possible in the sense that for each integer k ≥ 13 there exists a planar graph H without k-cycles such that δ(H) = 5.
- -/- 9
报告介绍：
A graph G is k-degenerate if every subgraph of G contains a vertex of degree at most k. In this talk, we discuss the degeneracy of some graphs. In particular, we show that for each fixed integer k∈{3,4,...,12}, planar graphs without k-cycles are 4-degenerate. The result is best possible in the sense that for each integer k ≥ 13 there exists a planar graph H without k-cycles such that δ(H) = 5.
报告人介绍：
王艺桥，北京工业大学数学统计学与力学学院教授，博士生导师，主要研究领域是图的结构与图的染色。主持国家自然科学基金优青项目1项、面上项目2项、青年项目1项，参与中韩国际合作与交流项目1项。在J. Graph Theory, SIAM J. Discrere Math., European J. Combin.等期刊上发表SCI论文80余篇。获教育部自然科学二等奖1项。现任中国运筹学会图论组合分会常务理事，中国数学会组合数学与图论专委会委员，中国工业与应用数学会图论组合及应用专委会委员。
购买下会员支持下吧...用爱发电已经很久了 立即购买
