Stability Theory of General Contractions for Delay Equations

We study the persistence of the asymptotic stability of delay equations both under linear and nonlinear perturbations. Namely, we consider nonautonomous linear delay equations v′ = L(t)v _t with a nonuniform exponential contraction. Our main objective is to establish the persistence of the nonuniform exponential stability of the zero solution both under nonautonomous linear perturbations, i.e., for the equation v′ = (L(t) + M(t))v _t , thus discussing the so-called robustness problem, and under a large class of nonlinear perturbations, namely for the equation v′ = L(t)v _t + f(t, v _t ). In addition, we consider general contractions e ^−λρ(t) determined by an increasing function ρ that includes the usual exponential behavior with ρ(t) = t as a very special case. We also obtain corresponding results in the case of discrete time.     

On Local Invertible Operators in L2 (ℝ1, H)

We study operators of the form Lu = — G(t) u(t) in L²([t₀ — δ, t₀ + δ], H) with = L² ([t₀— δ, t₀ + δ], H ) in the neighbourhood [t₀— δ, t₀ + δ] of a point t₀ ∈ ℝ¹. Such problems arise in questions on local solvability of partial differential equations (see [6] and [7]). For these operators,one of the major questions is if they are invertible in a neighbourhood of a point t ∈ ℝ¹. To solve this problem we establish needed commutator estimates. Using the commutator estimates and factorization theorems for nonanalytic operator-functions we give additional conditions for the nonanalytic operator -function G(t) and show that the operator L (or ) with some boundary conditions is local invertible.     

Rooted induced trees in triangle‐free graphs

For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of Gthat is a tree. Further, for a vertex v∈V(G), let t(G, v) denote the maximum number of vertices in an induced subgraph of Gthat is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle‐free graphs G(and vertices v∈V(G)) on nvertices is denoted by t₃(n) (t(n)). Clearly, t(G, v)?t(G) for all v∈V(G). In this note, we solve the extremal problem of maximizing |G| for given t(G, v), given that Gis connected and triangle‐free. We show that and determine the unique extremal graphs. Thus, we get as corollary that $t_3(n)\ge t_3^{\ast}(n) = \lceil {\frac{1}{2}}(1+{\sqrt{8n-7}})\rceilFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of Gthat is a tree. Further, for a vertex v∈V(G), let t(G, v) denote the maximum number of vertices in an induced subgraph of Gthat is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle‐free graphs G(and vertices v∈V(G)) on nvertices is denoted by t₃(n) (t(n)). Clearly, t(G, v)?t(G) for all v∈V(G). In this note, we solve the extremal problem of maximizing |G| for given t(G, v), given that Gis connected and triangle‐free. We show that and determine the unique extremal graphs. Thus, we get as corollary that $t_3(n)\ge t_3^{\ast}(n) = \lceil {\frac{1}{2}}(1+{\sqrt{8n-7}})\rceil$, improving a recent result by Fox, Loh and Sudakov. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 206–209, 2010     

Global existence for one-dimensional motion of non-isentropic viscous fluids

We study the p-system with viscosity given by v_t ? u_x = 0, u_t + p(v)_x = (k(v)u_x)_x + f(∫ vdx, t), with the initial and the boundary conditions (v(x, 0), u(x,0)) = (v₀, u₀(x)), u(0,t) = u(X,t) = 0. To describe the motion of the fluid more realistically, many equations of state, namely the function p(v) have been proposed. In this paper, we adopt Planck's equation, which is defined only for v > b(> 0) and not a monotonic function of v, and prove the global existence of the smooth solution. The essential point of the proof is to obtain the bound of v of the form b < h(T) ? v(x, t) ? H(T) < ∞ for some constants h(T) and H(T).     

On complete recovery of geophysical data

One considers an elastic halfspace with depth (x₁) dependent density Q and Lamé moduli (λ,m?). Impulsive stresses τli = δ(x₂, x₃)δ(t) for x₁ = 0 are applied with displacement responses u_i = g_i(t, x₂, x₃) at x₁ = 0 (i = 1, 2, 3). Let v_i(t, x₁) = ∫∫u_idx₂dx₃ (i = 1, 2 is enough) and set w(t, x₁) = ∫∫x₂u₁dx₂dx₃. One obtains a system of 3 differential equations for v₁, v₂, and w to which the spectral techniques of inverse scattering theory are applied as in [25]. The inverse problems for the uncoupled v_i can then be solved to produce 2 functions A₁ and A₂ involving (Q, λ, μ) as functions of “bound” variables y₁ and y₂ containing (Q, λ, μ), between which a relation then is determined. Analysis of the coupled equation for w then leads to a Fredholm integral equation whose solution provides an additional relation between (Q, λ, μ) from which (Q, λ, μ) can be determined as functions of x₁. The integral equation is reduced to a Volterra type equation by results and techniques of transmutation and then solved by a modification of standard techniques. A number of features and results of independent mathematical interest arise from the transmutation theory.     

Approximate solution of u′=–A2u using a relation between exp(–tA2) and exp(itA)

Let A be a positive definite operator in a Hilbert space and consider the initial value problem for u _t =–A² u. Using a representation of the semi group exp(–A² t) in terms of the group exp(iAt) we express u in terms of the solution of the standard heat equation w _t = w _yy , with initial values v solving the initial value problem for v _y = iAv. This representation is used to construct a method for approximating u in terms of approximations of v. In the case that A is a 2^nd order elliptic operator the method is combined with finite elements in the spatial variable and then reduces the solution of the 4th order equation for u to that of the 2^nd order equation for v, followed by the solution of the heat equation in one space variable.     

Upper bounds on the general covering number Cλ(v,k, t,m)

A collection of k‐subsets (called blocks) of a v‐set X (v) = {1, 2,…, v} (with elements called points) is called a t‐(v, k, m, λ) covering if for every m‐subset M of X (v) there is a subcollection of with such that every block K ∈ has at least t points in common with M. It is required that v ≥ k ≥ t and v ≥ m ≥ t. The minimum number of blocks in a t‐(v, k, m, λ) covering is denoted by C_λ(v, k, t, m). We present some constructions producing the best known upper bounds on C_λ(v, k, t, m) for k = 6, a parameter of interest to lottery players. © 2004 Wiley Periodicals, Inc.     

Interval oscillation criteria for second order super‐half linear functional differential equations with delay and advanced arguments

Sufficient conditions are established for oscillation of second order super half linear equations containing both delay and advanced arguments of the form where ?_δ (u) = |u |^{δ –1}u; α > 0, β ≥ α, and γ ≥ α are real numbers; k, p, q, e, τ, σ are continuous real‐valued functions; τ (t) ≤ t and σ (t) ≥ t with lim_{t →∞} τ (t) = ∞. The functions p (t), q (t), and e (t) are allowed to change sign, provided that p (t) and q (t) are nonnegative on a sequence of intervals on which e (t) alternates sign. As an illustrative example we show that every solution of is oscillatory provided that either m₁ or m₂ or r₀ is sufficiently large (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Discontinuities of approximating measures on constant width sets

SiaK un insieme piano ad ampiezza costante δ, ?K la sua frontiera ev _t (K) la misura approssimante la misura unidimensionale di Hausdorff μ¹(K), ottenuta con ricoprimento chiusi di diametro non superiore att. E′ noto che l'unica discontinuità perv _t (K) e perv _t (?K) si può avere pert=δ. In questo scritto si approfondisce lo studio di queste discontinuità e si dimostra tra l'altro che i salti in δ div _t (K) ev _t (?K) sono uguali.     

Scattering techniques for a one dimensional inverse problem in geophysics

A one dimensional problem for SH waves in an elastic medium is treated which can be written as v_tt = A^?1 (Av_y)_y, A = (?μ)^1/2, ? = density, and μ = shear modulus. Assume A ? C¹ and A′/A ? L¹; from an input v_y(t, 0) = ?(t) let the response v(t, 0) = g(t) be measured (v(t, y) = 0 for t < 0). Inverse scattering techniques are generalized to recover A(y) for y > 0 in terms of the solution K of a Gelfand-Levitan type equation, .     

Mean-Field Conditions for Percolation on Finite Graphs

Let {G _n } be a sequence of finite transitive graphs with vertex degree d = d(n) and |G _n | = n. Denote by p ^t (v, v) the return probability after t steps of the non-backtracking random walk on G _n . We show that if p ^t (v, v) has quasi-random properties, then critical bond-percolation on G _n behaves as it would on a random graph. More precisely, if $\mathop {\rm {lim\, sup\,}} \limits_{n} n^{1/3} \sum\limits_{t = 1}^{n^{1/3}} {t{\bf p}^t(v,v) < \infty ,}$ then the size of the largest component in p-bond-percolation with ${p =\frac{1+O(n^{-1/3})}{d-1}}Let {G _n } be a sequence of finite transitive graphs with vertex degree d = d(n) and |G _n | = n. Denote by p ^t (v, v) the return probability after t steps of the non-backtracking random walk on G _n . We show that if p ^t (v, v) has quasi-random properties, then critical bond-percolation on G _n behaves as it would on a random graph. More precisely, if

lim sup  n n1/3 ?t = 1n1/3 tpt(v,v) < ￥,\mathop {\rm {lim\, sup\,}} \limits_{n} n^{1/3} \sum\limits_{t = 1}^{n^{1/3}} {t{\bf p}^t(v,v) < \infty ,}      12. Almost sure exponential stabilization by stochastic feedback control based on discrete-time observations      Ran Dong 《随机分析与应用》2018,36(4):561-583 Since Mao initiated the study of stabilization of ordinary differential equations (ODEs) by stochastic feedback controls based on discrete-time state observations in 2016, no more work on this intriguing topic has been reported. This article investigates how to stabilize a given unstable linear non-autonomous ODE by controller σ(t)x(δt)dB(t), and how to stabilize an unstable nonlinear hybrid SDE by controller G(r(δt))x(δt)dB(t), where δt represents time points of observation with sufficiently small observation interval, B(t) is a Brownian motion and r(t) is the Markov Chain, in the sense of pth moment (0 < p < 1) and almost sure exponential stability.      13. Birth control for giants      Joel Spencer  Nicholas Wormald 《Combinatorica》2007,27(5):587-628 The standard Erdős-Rényi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n/2 rounds as one time unit, a phase transition occurs at time t = 1 when a giant component (one of size constant times n) first appears. Under the influence of statistical mechanics, the investigation of related phase transitions has become an important topic in random graph theory. We define a broad class of graph evolutions in which at each round one chooses one of two random edges {v 1, v 2}, {v 3, v 4} to add to the graph. The selection is made by examining the sizes of the components of the four vertices. We consider the susceptibility S(t) at time t, being the expected component size of a uniformly chosen vertex. The expected change in S(t) is found which produces in the limit a differential equation for S(t). There is a critical time t c so that S(t) → ∞ as t approaches t c from below. We show that the discrete random process asymptotically follows the differential equation for all subcritical t < t c . Employing classic results of Cramér on branching processes we show that the component sizes of the graph in the subcritical regime have an exponential tail. In particular, the largest component is only logarithmic in size. In the supercritical regime t > t c we show the existence of a giant component, so that t = t c may be fairly considered a phase transition. Computer aided solutions to the possible differential equations for susceptibility allow us to establish lower and upper bounds on the extent to which we can either delay or accelerate the birth of the giant component. Research supported by the Australian Research Council, the Canada Research Chairs Program and NSERC. Research partly carried out while the author was at the Department of Mathematics and Statistics, University of Melbourne.      14. Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphs      Paul Dorbec  Sylvain Gravier  Gábor N. Sárközy 《Journal of Graph Theory》2008,59(1):34-44 In any r‐uniform hypergraph for 2 ≤ t ≤ r we define an r‐uniform t‐tight Berge‐cycle of length ?, denoted by C?(r, t), as a sequence of distinct vertices v1, v2, … , v?, such that for each set (vi, vi + 1, … , vi + t ? 1) of t consecutive vertices on the cycle, there is an edge Ei of that contains these t vertices and the edges Ei are all distinct for i, 1 ≤ i ≤ ?, where ? + j ≡ j. For t = 2 we get the classical Berge‐cycle and for t = r we get the so‐called tight cycle. In this note we formulate the following conjecture. For any fixed 2 ≤ c, t ≤ r satisfying c + t ≤ r + 1 and sufficiently large n, if we color the edges of Kn(r), the complete r‐uniform hypergraph on n vertices, with c colors, then there is a monochromatic Hamiltonian t‐tight Berge‐cycle. We prove some partial results about this conjecture and we show that if true the conjecture is best possible. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 34–44, 2008      15. A generalized jacobi theta function      S. H. Lehnigk  G. F. Roach 《Mathematical Methods in the Applied Sciences》1984,6(1):327-344 The delta function initial condition solution v*(x,t;y) at x = y ≥ 0 of the generalized Feller equation is used to define a generalized Jacobi Theta function \documentclass{article}\pagestyle{empty}\begin{document}$ \Theta (x,t) = \upsilon *(x,t;0) + 2\sum\limits_{n = 1}^\infty {v*(x,t;y_n)} $\end{document} for a sufficiently rapidly increasing and unbounded positive sequence {yy}. It is shown that Θ(x,t) is analytic in each variable in certain regions of the complex x and t planes and that it is a solution of the generalized Feller equation. For those parameters for which this equation reduces to the heat equation, Θ(x,t) reduces to the third Jacobi Theta function.      16. The upper traceable number of a graph      Futaba Okamoto  Ping Zhang  Varaporn Saenpholphat 《Czechoslovak Mathematical Journal》2008,58(1):271-287 For a nontrivial connected graph G of order n and a linear ordering s: v 1, v 2, …, v n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t +(G) of G is t +(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t +(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.      17. Stability of nonautonomous differential equations in Hilbert spaces      Luis Barreira  Claudia Valls 《Journal of Differential Equations》2005,217(1):204-248 We introduce a large class of nonautonomous linear differential equations v′=A(t)v in Hilbert spaces, for which the asymptotic stability of the zero solution, with all Lyapunov exponents of the linear equation negative, persists in v′=A(t)v+f(t,v) under sufficiently small perturbations f. This class of equations, which we call Lyapunov regular, is introduced here inspired in the classical regularity theory of Lyapunov developed for finite-dimensional spaces, that is nowadays apparently overlooked in the theory of differential equations. Our study is based on a detailed analysis of the Lyapunov exponents. Essentially, the equation v′=A(t)v is Lyapunov regular if for every k the limit of Γ(t)1/t as t→∞ exists, where Γ(t) is any k-volume defined by solutions v1(t),…,vk(t). We note that the class of Lyapunov regular linear equations is much larger than the class of uniformly asymptotically stable equations.      18. Dynamical systems method (DSM) for selfadjoint operators      A.G. Ramm 《Journal of Mathematical Analysis and Applications》2007,328(2):1290-1296 Let A be a selfadjoint linear operator in a Hilbert space H. The DSM (dynamical systems method) for solving equation Av=f consists of solving the Cauchy problem , u(0)=u0, where Φ is a suitable operator, and proving that (i) ∃u(t)∀t>0, (ii) ∃u(∞), and (iii) A(u(∞))=f. It is proved that if equation Av=f is solvable and u solves the problem , u(0)=u0, where a>0 is a parameter and u0 is arbitrary, then lima→0limt→∞u(t,a)=y, where y is the unique minimal-norm solution of the equation Av=f. Stable solution of the equation Av=f is constructed when the data are noisy, i.e., fδ is given in place of f, ‖fδ−f‖?δ. The case when a=a(t)>0, , a(t)↘0 as t→∞ is considered. It is proved that in this case limt→∞u(t)=y and if fδ is given in place of f, then limt→∞u(tδ)=y, where tδ is properly chosen.      19. Positive solutions for systems of nonlinear eigenvalue problems for functional differential equations      J. Henderson  S. K. Ntouyas 《Applicable analysis》2013,92(11):1365-1374 Values of?λ?are determined for which there exist positive solutions of the system of functional differential equations, u″?+?λa(t)f(v t )?=?0,v″?+?λb(t)g(u t )?=?0, for 0?t?u(s)?=?v(s)?=?φ(s), ?r?≤?s?≤?0, and the boundary conditions u(0)?=?v(0)?=?φ(0)?=?u(1)?=?v(1)?=?0. A Guo–Krasnosel'skii fixed point theorem is applied.      20. Local and global average degree in graphs and multigraphs      E. Bertram  P. Erds  P. Hork  J. &#x;ir&#x;  Z. S. Tuza 《Journal of Graph Theory》1994,18(7):647-661 A vertex v of a graph G is called groupie if the average degree tv of all neighbors of v in G is not smaller than the average degree tG of G. Every graph contains a groupie vertex; the problem of whether or not every simple graph on ≧2 vertices has at least two groupie vertices turned out to be surprisingly difficult. We present various sufficient conditions for a simple graph to contain at least two groupie vertices. Further, we investigate the function f(n) = max minv (tv/tG), where the maximum ranges over all simple graphs on n vertices, and prove that f(n) = 1/42n + o(1). The corresponding result for multigraphs is in sharp contrast with the above. We also characterize trees in which the local average degree tv is constant.

Almost sure exponential stabilization by stochastic feedback control based on discrete-time observations

Since Mao initiated the study of stabilization of ordinary differential equations (ODEs) by stochastic feedback controls based on discrete-time state observations in 2016, no more work on this intriguing topic has been reported. This article investigates how to stabilize a given unstable linear non-autonomous ODE by controller σ(t)x(δ_t)dB(t), and how to stabilize an unstable nonlinear hybrid SDE by controller G(r(δ_t))x(δ_t)dB(t), where δ_t represents time points of observation with sufficiently small observation interval, B(t) is a Brownian motion and r(t) is the Markov Chain, in the sense of pth moment (0 < p < 1) and almost sure exponential stability.     

Birth control for giants

The standard Erdős-Rényi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n/2 rounds as one time unit, a phase transition occurs at time t = 1 when a giant component (one of size constant times n) first appears. Under the influence of statistical mechanics, the investigation of related phase transitions has become an important topic in random graph theory. We define a broad class of graph evolutions in which at each round one chooses one of two random edges {v ₁, v ₂}, {v ₃, v ₄} to add to the graph. The selection is made by examining the sizes of the components of the four vertices. We consider the susceptibility S(t) at time t, being the expected component size of a uniformly chosen vertex. The expected change in S(t) is found which produces in the limit a differential equation for S(t). There is a critical time t _c so that S(t) → ∞ as t approaches t _c from below. We show that the discrete random process asymptotically follows the differential equation for all subcritical t < t _c . Employing classic results of Cramér on branching processes we show that the component sizes of the graph in the subcritical regime have an exponential tail. In particular, the largest component is only logarithmic in size. In the supercritical regime t > t _c we show the existence of a giant component, so that t = t _c may be fairly considered a phase transition. Computer aided solutions to the possible differential equations for susceptibility allow us to establish lower and upper bounds on the extent to which we can either delay or accelerate the birth of the giant component. Research supported by the Australian Research Council, the Canada Research Chairs Program and NSERC. Research partly carried out while the author was at the Department of Mathematics and Statistics, University of Melbourne.     

Monochromatic Hamiltonian t‐tight Berge‐cycles in hypergraphs

In any r‐uniform hypergraph for 2 ≤ t ≤ r we define an r‐uniform t‐tight Berge‐cycle of length ?, denoted by C_?^{(r, t)}, as a sequence of distinct vertices v₁, v₂, … , v_?, such that for each set (v_i, v_{i + 1}, … , v_{i + t ? 1}) of t consecutive vertices on the cycle, there is an edge E_i of that contains these t vertices and the edges E_i are all distinct for i, 1 ≤ i ≤ ?, where ? + j ≡ j. For t = 2 we get the classical Berge‐cycle and for t = r we get the so‐called tight cycle. In this note we formulate the following conjecture. For any fixed 2 ≤ c, t ≤ r satisfying c + t ≤ r + 1 and sufficiently large n, if we color the edges of K_n^(r), the complete r‐uniform hypergraph on n vertices, with c colors, then there is a monochromatic Hamiltonian t‐tight Berge‐cycle. We prove some partial results about this conjecture and we show that if true the conjecture is best possible. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 34–44, 2008     

A generalized jacobi theta function

The delta function initial condition solution v^*(x,t;y) at x = y ≥ 0 of the generalized Feller equation is used to define a generalized Jacobi Theta function \documentclass{article}\pagestyle{empty}\begin{document}$ \Theta (x,t) = \upsilon *(x,t;0) + 2\sum\limits_{n = 1}^\infty {v*(x,t;y_n)} $\end{document} for a sufficiently rapidly increasing and unbounded positive sequence {y_y}. It is shown that Θ(x,t) is analytic in each variable in certain regions of the complex x and t planes and that it is a solution of the generalized Feller equation. For those parameters for which this equation reduces to the heat equation, Θ(x,t) reduces to the third Jacobi Theta function.     

The upper traceable number of a graph

For a nontrivial connected graph G of order n and a linear ordering s: v ₁, v ₂, …, v _n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t ⁺(G) of G is t ⁺(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t ⁺(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.     

Stability of nonautonomous differential equations in Hilbert spaces

We introduce a large class of nonautonomous linear differential equations v^′=A(t)v in Hilbert spaces, for which the asymptotic stability of the zero solution, with all Lyapunov exponents of the linear equation negative, persists in v^′=A(t)v+f(t,v) under sufficiently small perturbations f. This class of equations, which we call Lyapunov regular, is introduced here inspired in the classical regularity theory of Lyapunov developed for finite-dimensional spaces, that is nowadays apparently overlooked in the theory of differential equations. Our study is based on a detailed analysis of the Lyapunov exponents. Essentially, the equation v^′=A(t)v is Lyapunov regular if for every k the limit of Γ(t)^1/t as t→∞ exists, where Γ(t) is any k-volume defined by solutions v₁(t),…,v_k(t). We note that the class of Lyapunov regular linear equations is much larger than the class of uniformly asymptotically stable equations.     

Dynamical systems method (DSM) for selfadjoint operators

Let A be a selfadjoint linear operator in a Hilbert space H. The DSM (dynamical systems method) for solving equation Av=f consists of solving the Cauchy problem , u(0)=u₀, where Φ is a suitable operator, and proving that (i) ∃u(t)∀t>0, (ii) ∃u(∞), and (iii) A(u(∞))=f. It is proved that if equation Av=f is solvable and u solves the problem , u(0)=u₀, where a>0 is a parameter and u₀ is arbitrary, then lima→0limt→∞u(t,a)=y, where y is the unique minimal-norm solution of the equation Av=f. Stable solution of the equation Av=f is constructed when the data are noisy, i.e., fδ is given in place of f, ‖fδ−f‖?δ. The case when a=a(t)>0, , a(t)↘0 as t→∞ is considered. It is proved that in this case limt→∞u(t)=y and if fδ is given in place of f, then limt→∞u(tδ)=y, where tδ is properly chosen.     

Positive solutions for systems of nonlinear eigenvalue problems for functional differential equations

Values of?λ?are determined for which there exist positive solutions of the system of functional differential equations, u″?+?λa(t)f(v _t )?=?0,v″?+?λb(t)g(u _t )?=?0, for 0?t?u(s)?=?v(s)?=?φ(s), ?r?≤?s?≤?0, and the boundary conditions u(0)?=?v(0)?=?φ(0)?=?u(1)?=?v(1)?=?0. A Guo–Krasnosel'skii fixed point theorem is applied.     

Local and global average degree in graphs and multigraphs

A vertex v of a graph G is called groupie if the average degree t_v of all neighbors of v in G is not smaller than the average degree t_G of G. Every graph contains a groupie vertex; the problem of whether or not every simple graph on ≧2 vertices has at least two groupie vertices turned out to be surprisingly difficult. We present various sufficient conditions for a simple graph to contain at least two groupie vertices. Further, we investigate the function f(n) = max min_v (t_v/t_G), where the maximum ranges over all simple graphs on n vertices, and prove that f(n) = 1/42n + o(1). The corresponding result for multigraphs is in sharp contrast with the above. We also characterize trees in which the local average degree t_v is constant.