Let P be a monotone increasing graph property, let G = (V,E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the edges of G, in which Maker’s goal is to build a graph that satisfies the property P . It is clear that in order for Maker to have a chance of winning, G itself must satisfy P . We prove that if G satisfies P in some stron...

In this article we present a variant of the basic result of "T. Gnana. Bhaskar and V. Lakshmikanthan, Fixed point theorem in partially ordered metric spaces and applications, Nonlinear Anal. TMA, 65 (2006), 1379–1393." to …nd the coupled …xed points of multivalued mappings without mixed monotone property in cone metric space involving non-normal cones. As applications we prove the existence of ...

In these notes we present the notion of Negative Association, discuss some of its useful properties, and end with some example applications. The slogan to bear in mind here is “independent, or better”. 1 Negative Association Definition In randomized algorithms, our randomness often takes on the form of independent random variables, allowing us to apply powerful theorems concerning such variable...

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions. Motivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory,...

Abstract. In the present article, we introduce a unified notion of multi-tupled fixed points and utilize the same to prove some existence and uniqueness unified multi-tupled fixed point theorems for BoydWong type nonlinear contractions satisfying generalized mixed monotone property in ordered metric spaces. Our results unify several classical and well-known n-tupled (including coupled, tripled ...

We study a flow network model for vehicular traffic that captures congestion effects at diverging junctions. Standard approaches which rely on monotonicity of the flow dynamics do not immediately apply to such first-in-first-out models. The network model nonetheless exhibits a mixed monotonicity property. Mixed monotonicity enables the original system to be embedded in a system of twice the dim...

We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on d × d × n-dimensional tripartite mixed states. We show that this assisted entanglement, when measured in terms of the generalized concurrence (named G-concurrence) is (tightly) bounded by an entanglement monotone, which we call the G-concurren...

For a graph property P consider the following computational problem. Given an input graph G, what is the minimum number of edge modifications (additions and/or deletions) that one has to apply to G in order to turn it into a graph that satisfies P? Namely, what is the edit distance ∆(G,P) of a graph G from satisfying P. Clearly, the computational complexity of such a problem strongly depends on...