Dirac(视频压缩格式)
类型(生物学)
数学
匹配(统计)
图论
图形
组合数学
离散数学
计算机科学
量子力学
物理
中微子
生态学
统计
生物
出处
期刊:The IMA volumes in mathematics and its applications
日期:2016-01-01
卷期号:: 145-165
被引量:51
标识
DOI:10.1007/978-3-319-24298-9_6
摘要
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles. Generalizations of Dirac's theorem, and related matching and packing problems for hypergraphs, have received much attention in recent years. New tools such as the absorbing method and regularity method have helped produce many new results, and yet some fundamental problems in the area remain unsolved. We survey recent developments on Dirac-type problems along with the methods involved, and highlight some open problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI