For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the furthest graph on n vertices from P and what is the largest possible edit distance from P? Denote this maximal distance by ed(n,P). This question is motivated by algor...

Given an in…nite hereditary property of graphs P; the principal extremal parameter of P is the value (P) = lim n!1 n 2 1 maxfe (G) : G 2 P and v (G) = ng: The Erd1⁄2os-Stone theorem gives (P) if P is monotone, but this result does not apply to hereditary P. Thus, one of the results of this note is to establish (P) for any hereditary property P: Similar questions are studied for the parameter (p...

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...

In this paper, we prove some coupled coincidence point theorems for mappings with the mixed monotone property and obtain the uniqueness of this coincidence point. Then we providing useful examples in Nash equilibrium.

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,...

We continue the study of k-monotone Boolean functions in the property testing model, initiated by Canonne et al. (ITCS 2017). A function f : {0, 1} → {0, 1} is said to be kmonotone if it alternates between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in circuit complexity, PAC learni...

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...