The study of k- sets is a very relevant topic in the research area of computational geometry. The study of the maximum and minimum number of k-sets in sets of points of the plane in general position, specifically, has...The study of k- sets is a very relevant topic in the research area of computational geometry. The study of the maximum and minimum number of k-sets in sets of points of the plane in general position, specifically, has been developed at great length in the literature. With respect to the maximum number of k-sets, lower bounds for this maximum have been provided by Erdaos et al., Edelsbrunner and Welzl, and later by Toth. Dey also stated an upper bound for this maximum number of k-sets. With respect to the minimum number of k-set, this has been stated by Erdos el al. and, independently, by Lovasz et al. In this paper the authors give an example of a set ofn points in the plane in general position （no three collinear）, in which the minimum number of points that can take part in, at least, a k-set is attained for every k with 1 ≤ k 〈 n/2. The authors also extend Erdos＇s result about the minimum number of points in general position which can take part in a k-set to a set ofn points not necessarily in general position. That is why this work complements the classic works we have mentioned before.展开更多
Existence criteria is established for the periodic solution of the nonlinear neutral delay differential equation x′(t)=f(t,x(t),x(t-τ 1(t)),x′(t-τ 2(t)))+p(t) by means of an abstract continuous theorem of k-set ...Existence criteria is established for the periodic solution of the nonlinear neutral delay differential equation x′(t)=f(t,x(t),x(t-τ 1(t)),x′(t-τ 2(t)))+p(t) by means of an abstract continuous theorem of k-set contractive operator and some analysis technique.展开更多
In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It ...In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It is proved that a graph G has a fractional 1-factor if bind(G)≥1and has a fractional k-factor if bind(G)≥k−1k. Furthermore, it is showed that both results are best possible in some sense.展开更多
文摘The study of k- sets is a very relevant topic in the research area of computational geometry. The study of the maximum and minimum number of k-sets in sets of points of the plane in general position, specifically, has been developed at great length in the literature. With respect to the maximum number of k-sets, lower bounds for this maximum have been provided by Erdaos et al., Edelsbrunner and Welzl, and later by Toth. Dey also stated an upper bound for this maximum number of k-sets. With respect to the minimum number of k-set, this has been stated by Erdos el al. and, independently, by Lovasz et al. In this paper the authors give an example of a set ofn points in the plane in general position （no three collinear）, in which the minimum number of points that can take part in, at least, a k-set is attained for every k with 1 ≤ k 〈 n/2. The authors also extend Erdos＇s result about the minimum number of points in general position which can take part in a k-set to a set ofn points not necessarily in general position. That is why this work complements the classic works we have mentioned before.
文摘Existence criteria is established for the periodic solution of the nonlinear neutral delay differential equation x′(t)=f(t,x(t),x(t-τ 1(t)),x′(t-τ 2(t)))+p(t) by means of an abstract continuous theorem of k-set contractive operator and some analysis technique.
文摘In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It is proved that a graph G has a fractional 1-factor if bind(G)≥1and has a fractional k-factor if bind(G)≥k−1k. Furthermore, it is showed that both results are best possible in some sense.
