A lower bound for the convexity number of some graphs

2004 ◽  
Vol 14 (1-2) ◽  
pp. 185-191 ◽  
Author(s):  
Byung Kee Kim
Keyword(s):  
Lower Bound ◽  
Convexity Number

scholarly journals On local convexity of nonlinear mappings between Banach spaces

2012 ◽  
Vol 10 (6) ◽  
Author(s):  
Iryna Banakh ◽  
Taras Banakh ◽  
Anatolij Plichko ◽  
Anatoliy Prykarpatsky
Keyword(s):  
Banach Space ◽  
Lower Bound ◽  
Banach Spaces ◽  
Lipschitz Constant ◽  
Second Order ◽  
Local Convexity ◽  
Convexity Number ◽  
Locally Convex ◽  
Nonlinear Mappings

AbstractWe find conditions for a smooth nonlinear map f: U → V between open subsets of Hilbert or Banach spaces to be locally convex in the sense that for some c and each positive ɛ < c the image f(B ɛ(x)) of each ɛ-ball B ɛ(x) ⊂ U is convex. We give a lower bound on c via the second order Lipschitz constant Lip2(f), the Lipschitz-open constant Lipo(f) of f, and the 2-convexity number conv2(X) of the Banach space X.

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

Sign in / Sign up

Export Citation Format

Share Document