Disjoint triangles and quadrilaterals in a graph

Let G be a simple graph of order n and s and k be two positive integers. Brandt et al. obtained the following result: If s?k, n?3s+4(k-s) and σ₂(G)?n+s, then G contains k disjoint cycles C₁,…,C_k satisfying |C_i|=3 for 1?i?s and |C_i|?4 for s<i?k. In the above result, the length of C_i is not specified for s<i?k. We get a result specifying the length of C_i for each s<i?k if n?3s+4(k-s)+3.     

Some new mean value theorems of Flett type

In this paper, we give some new mean value theorems, which are generalizations of Flett, Myers and Tong's theorems.     

A variant of Hardy's and Miyachi's theorems for the Bessel–Struve transform

In this paper, we establish new versions of Hardy's and Miyachi's theorems for the Bessel–Struve transform.     

B-transform and its application to a fish-hyacinth model

A new transform proposed by Oyelami and Ale for impulsive systems is applied to an impulsive fish-hyacinth model. A biological policy regarding the growth of the fish and the hyacinth populations is formulated.     

抛物线的一些性质

近年,在研究射影几何在二次曲线上的运用中,发现有些平面几何问题用射影几何研究更自然、条理更清楚,而用平面几何方法处理则有难度.将二次曲线中的抛物线放在拓广平面上,借助射影几何中的Pascal定理、Steiner定理,给出了抛物线一些有趣的性质.     

Vectorial Ekeland's Variational Principle with a W-Distance and its Equivalent Theorems

By using the properties of w-distances and Gerstewitz's functions, we first give a vectorial Takahashi's nonconvex minimization theorem with a w-distance. From this, we deduce a general vectorial Ekeland's variational principle, where the objective function is from a complete metric space into a pre-ordered topological vector space and the perturbation contains a w-distance and a non-decreasing function of the objective function value. From the general vectorial variational principle, we deduce a vectorial Caristi's fixed point theorem with a w-distance. Finally we show that the above three theorems are equivalent to each other. The related known results are generalized and improved. In particular, some conditions in the theorems of [Y. Araya, Ekeland's variational principle and its equivalent theorems in vector optimization, J. Math. Anal. Appl. 346(2008), 9–16[ are weakened or even completely relieved.     

Tracing Robert's use of representations to solve counting problems: A 16-year case study

This study describes how Robert used his external representations (formulae, notations, sketches, models, and figures) to solve progressively more challenging counting tasks over a 16-year period. In his explorations of counting tasks, Robert discovered intricate connections between solutions to problems that looked different on the surface. Using video data from Robert's problem solving, analyses of his solutions are presented that shed light on how he built new ideas from existing ideas and how he modified external representations to make new mathematical discoveries and provide justifications for his solutions.     

Hall's theorem for hypergraphs

We prove a hypergraph version of Hall's theorem. The proof is topological. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 83–88, 2000