Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles

We construct multigraphs of any large order with as few as only four 2-decompositions into Hamilton cycles or only two 2-decompositions into Hamilton paths. Nevertheless, some of those multigraphs are proved to have exponentially many Hamilton cycles (Hamilton paths). Two families of large simple graphs are constructed. Members in one class have exactly 16 hamiltonian pairs and in another class exactly four traceable pairs. These graphs also have exponentially many Hamilton cycles and Hamilton paths, respectively. The exact numbers of (Hamilton) cycles and paths are expressed in terms of Lucas- or Fibonacci-like numbers which count 2-independent vertex (or edge) subsets on the n-path or n-cycle. A closed formula which counts Hamilton cycles in the square of the n-cycle is found for n≥5. The presented results complement, improve on, or extend the corresponding well-known Thomason’s results.     

泛连通图的Faudree-Schelp定理和哈密尔顿连通图的Ore定理的注记

In this note more short proofs are given for Faudree-Schelp theorem and Ore theorem.     

全纯二次微分的一些注记

记Q(X)为双曲黎曼曲面X上所有具有有限L^1-模的全纯二次微分所组成的Banach空间．本文讨论由V(φ)=|φ|/φ所定义的映射V：Q(x)→Q*(X)及其逆映射V^-1的连续性，并得到一些关于Teichmiiller空间几何的Lakic-型结果.     

Claw‐free 3‐connected P11‐free graphs are hamiltonian

We show that every 3‐connected claw‐free graph which contains no induced copy of P₁₁ is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of P₁₂ this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 111–121, 2004     

Preliminary report on the energy balance for nonlinear oscillations

In this paper, a reliable technique for calculating angular frequencies of nonlinear oscillators is developed. The new algorithm offers a promising approach by constructing a Hamiltonian for the nonlinear oscillator. Some illustrative examples are given.     

Reisner板的哈密尔顿体系及其辛正交解析法

基于Ｒｅｉｓｎｅｒ板理论，通过对混合能变分原理的修正，建立了更一般的哈密尔顿型广义变分原理，并给出了Ｒｅｉｓｎｅｒ板问题的哈密尔顿正则方程及其共轭辛正交解析法     

On random k‐out subgraphs of large graphs

We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let G_k be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then G_k is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then G_k has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017     

The Hamilton–Waterloo Problem for ‐Factors and ‐Factors

The Hamilton–Waterloo problem asks for a 2‐factorization of (for v odd) or minus a 1‐factor (for v even) into ‐factors and ‐factors. We completely solve the Hamilton–Waterloo problem in the case of C₃‐factors and ‐factors for .