搜索结果: 1-5 共查到“数学 Hamilton Cycles”相关记录5条 . 查询时间(0.076 秒)
山东大学数学学院研究生舒希超《Non-linear Hamilton cycles in linear quasi-random hypergraphs》论文被国际顶级会议SODA录用（图）
山东大学数学学院 舒希超 理论计算机
2020/10/12
近日，数学学院2019级硕士研究生舒希超收到了来自理论计算机领域顶级会议SODA（ACM-SIAM Symposium of Discrete Algorithms）的论文录用信。舒希超与美国罗德岛大学的韩杰研究员和山大数学学院的王光辉教授合作的论文《Non-linear Hamilton cycles in linear quasi-random hypergraphs》将发表在2021年1月的...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
Abstract: Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$. The result is sharp.
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-co...
The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors
2-factorization Hamilton-Waterloo problem Hamilton cycle cycle decompositions
2010/11/30
In this paper we give a complete solution to the Hamilton-Waterloo problem for the case of Hamilton cycles and C4k-factors for all positive integers k.