*Correspondence: [email protected] School of Science, Sichuan University of Science and Engineering, Zigong, Sichuan 643000, China Abstract We prove quadruple fixed point theorems in partially ordered metric spaces with mixed g-monotone property. Also, we state some examples to show that our results are real generalization of known ones in quadruple fixed point theory. MSC: 46T99; 54H25; 47H10;...

The purpose of this paper is to prove some coupled fixed point theorems for mapping having the mixed monotone property in partially ordered metric sapces which are generalization of the main results of Bhaskar and Lakshmikantham [T.G. Bhaskar, V. Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, Nonlinear Anal.TMA 65(2006) 1379 1393]. We support our resul...

Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a monotone property and r is the largest integer for which every r-colorable graph satis es P, then almost every gra...

The vector field of a mixed-monotone system is decomposable via decomposition function into increasing (cooperative) and decreasing (competitive) components, this allows for, e.g., efficient computation reachable sets forward invariant sets. A main challenge in approach, however, identifying an appropriate function. In letter, we show that any continuous-time dynamical with Lipschitz continuous...

In recent time, fixed point theory has been developed rapidly in partially ordered metric space. Bhaskar and Lakshmikantham (2006) introduced the concept of mixed monotone property. Lakshmikanthem and Ciric (2009) generalized the concept of mixed monotone mapping and proved a common coupled fixed point theorem. In this paper, we find a new type of contractive condition on Gmetric spaces also th...

Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid...