Graphs whose every transitive orientation contains almost every relation

Given a graphG onn vertices and a total ordering ≺ ofV(G), the transitive orientation ofG associated with ≺, denotedP(G; ≺), is the partial order onV(G) defined by settingx<y inP(G; ≺) if there is a pathx=x ₁ x ₂…x _r=y inG such thatx ₁ ≺x _j for 1≦i<j≦r. We investigate graphsG such that every transitive orientation ofG contains ₂ ⁿ −o(n ²) relations. We prove that almost everyG _n,p satisfies this requirement if , but almost noG _n,p satisfies the condition if (pn log log logn)/(logn log logn) is bounded. We also show that every graphG withn vertices and at mostcn logn edges has some transitive orientation with fewer than ₂ ⁿ −δ(c)n ² relations. Partially supported by MCS Grant 8104854.     

On extremal problems of graphs and generalized graphs

Anr-graph is a graph whose basic elements are its vertices and r-tuples. It is proved that to everyl andr there is anε(l, r) so that forn>n ₀ everyr-graph ofn vertices andn ^{r−ε(l, r)} r-tuples containsr. l verticesx ^(j), 1≦j≦r, 1≦i≦l, so that all ther-tuples occur in ther-graph.     

Propriétés Régularisantes de Certains Semi-Groupes Non Linéaires

Let φ be a convex l.s.c. function fromH (Hilbert) into ] - ∞, ∞ ] andD(φ)={u ∈H; φ(u)<+∞}. It is proved that for everyu ₀ ∈D(φ) the equation − (du/dt)(t ∈ ∂φ(u(t)),u(0)=u ₀ has a solution satisfying ÷(du(t)/dt)÷ ≦(c ₁/t)+c ₂. The behavior ofu(t) in the neighborhood oft=0 andt=+∞ as well as the inhomogeneous equation (du(t)/dt)+∂φ(u(t)) ∈f(t) are then studied. Solutions of some nonlinear boundary value problems are given as applications.      

On the Wiener Index of Graphs

The Wiener index of a graph G is defined as W(G)=∑ _u,v d _G (u,v), where d _G (u,v) is the distance between u and v in G and the sum goes over all the pairs of vertices. In this paper, we first present the 6 graphs with the first to the sixth smallest Wiener index among all graphs with n vertices and k cut edges and containing a complete subgraph of order n−k; and then we construct a graph with its Wiener index no less than some integer among all graphs with n vertices and k cut edges.     

Minkowski spaces with extremal distance from the Euclidean space

It is proved that if the Banach-Mazur distance between ann-dimensional Minkowski spaceB andl ₂ ⁿ satisfiesd (B ₁ l ₂ ⁿ ) ≧c √n (for some constantc>0 and for bign) thenB contains anA(c)-isomorphic copy ofl ₁ ^k (fork ∼ log log logn). In the special cased (B ₁ l ₂ ⁿ ) = √n,B contains an isometric copy ofl ₁ ^k fork ∼ logn.     

Correlated equilibria of games with many players

Let G _m,n be the class of strategic games with n players, where each player has m≥2 pure strategies. We are interested in the structure of the set of correlated equilibria of games in G _m,n when n→∞. As the number of equilibrium constraints grows slower than the number of pure strategy profiles, it might be conjectured that the set of correlated equilibria becomes large. In this paper, we show that (1) the average relative measure of the set of correlated equilibria is smaller than 2⁻ⁿ; and (2) for each 1<c<m, the solution set contains c ⁿ correlated equilibria having disjoint supports with a probability going to 1 as n grows large. The proof of the second result hinges on the following inequality: Let c ₁, …, c _l be independent and symmetric random vectors in R ^k, l≥k. Then the probability that the convex hull of c ₁, …, c _l intersects R ^k ₊ is greater than or equal to . Received: December 1998/Final version: March 2000     

A sufficient degree condition for a graph to contain all trees of size <Emphasis Type="Italic">k</Emphasis>

The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k formulated in terms of the minimum edge degree ζ(G) of a graph G defined as ζ(G) = min{d(u) + d(v) − 2: uv ∈ E(G)}. More precisely, we show that a connected graph G with maximum degree Δ(G) ≥ k and minimum edge degree ζ(G) ≥ 2k − 4 contains every tree of k edges if d _G (x) + d _G (y) ≥ 2k − 4 for all pairs x, y of nonadjacent neighbors of a vertex u of d _G (u) ≥ k.     

Edge-colored complete graphs with precisely colored subgraphs

Letf(s, t; k) be the largest value ofm such that it is possible tok-color the edges of the complete graphK _m so that everyK _s ⊆K _m has exactlyt colors occuring on its edges. The main object of this paper is to describe the behavior of the functionf(s,t;k), usually thinking ofs andt fixed, and lettingk become large. Dedicated to Paul Erdős on his seventieth birthday     

On vertex-coloring edge-weighting of graphs

A k-edge-weighting w of a graph G is an assignment of an integer weight, w(e) ∈ {1,…,k}, to each edge e. An edge-weighting naturally induces a vertex coloring c by defining c(u) = Σ _e∋u w(e) for every u ∈ V (G). A k-edge-weighting of a graph G is vertex-coloring if the induced coloring c is proper, i.e., c(u) ≠ c(v) for any edge uv ∈ E(G). When k ≡ 2 (mod 4) and k ⩾ 6, we prove that if G is k-colorable and 2-connected, δ(G) ⩾ k − 1, then G admits a vertex-coloring k-edge-weighting. We also obtain several sufficient conditions for graphs to be vertex-coloring k-edge-weighting.      

An extremal set theoretical characterization of some steiner systems

Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( _t ⁿ )( _k ^2k-t-1 )/( _t ^2k-t-1 ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.     

Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time

For a given undirected graphG = (V, E, c_G) with edges weighted by nonnegative realsc_G:E → R ⁺ , let Λ_G(k) stand for the minimum amount of weights which needs to be added to makeG k-edge-connected, and letG*(k) be the resulting graph obtained fromG. This paper first shows that function Λ_Gover the entire rangek [0, +∞] can be computed inO(nm + n² log n) time, and then shows that allG*(k) in the entire range can be obtained fromO(n log n) weighted cycles, and such cycles can be computed inO(nm + n² log n) time, wherenandmare the numbers of vertices and edges, respectively.     

On Independent Cycles in a Bipartite Graph

 Let G=(V ₁,V ₂;E) be a bipartite graph with 2k≤m=|V ₁|≤|V ₂|=n, where k is a positive integer. We show that if the number of edges of G is at least (2k−1)(n−1)+m, then G contains k vertex-disjoint cycles, unless e(G)=(2k−1)(n−1)+m and G belongs to a known class of graphs. Received: December 9, 1998 Final version received: June 2, 1999     

The Decomposition Dimension of Graphs

 For an ordered k-decomposition ? = {G ₁, G ₂,…,G _k } of a connected graph G and an edge e of G, the ?-representation of e is the k-tuple r(e|?) = (d(e, G ₁), d(e, G ₂),…,d(e, G _k )), where d(e, G _i ) is the distance from e to G _i . A decomposition ? is resolving if every two distinct edges of G have distinct representations. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dec(G). It is shown that for every two positive integers k and n≥ 2, there exists a tree T of order n with dec(T) = k. It is also shown that dec(G) ≤n for every graph G of order n≥ 3 and that dec(K _n ) ≤⌊(2n + 5)/3⌋ for n≥ 3. Received: June 17, 1998 Final version received: August 10, 1999     

Canonical edge-colourings of locally finite graphs

A variety of results on edge-colourings are proved, the main one being the following: ifG is a graph without loops or multiple edges and with maximum degree Δ=Δ(G), and if ν is a given integer 1≦ν≦Δ(G), thenG can be given a proper edge-colouring with the coloursc ₁, ...,c _Δ+1 with the additional property that any edge colouredc _μ with μ≧ν is on a vertex which has on it edges coloured with at least ν − 1 ofc ₁, ...,c _v .     

Complete subgraphs with large degree sums

Let t(n, k) denote the Turán number—the maximum number of edges in a graph on n vertices that does not contain a complete graph K_k+1. It is shown that if G is a graph on n vertices with n ≥ k²(k – 1)/4 and m < t(n, k) edges, then G contains a complete subgraph K_k such that the sum of the degrees of the vertices is at least 2km/n. This result is sharp in an asymptotic sense in that the sum of the degrees of the vertices of K_k is not in general larger, and if the number of edges in G is at most t(n, k) – ? (for an appropriate ?), then the conclusion is not in general true. © 1992 John Wiley & Sons, Inc.     

A bounded compactness theorem forL 1-embeddability of metric spaces in the plane

LetM=(W, d) be a metric space. LetL ¹ denote theL ¹ metric. AnL ¹-embedding ofM into Cartesiank-space ℝ ^k is a distance-preserving map from (W, d) into (ℝ ^k ,L ¹). Letc(k) be the smallest integer such that for every metric spaceM, M isL ¹-embeddable inR ^k iff everyc(k)-sized subspace ofM isL ¹-embeddable inR ^k. A special case of a theorem of Menger (see p. 94 of [5]) says thatc(1) exists and equals 4. We show thatc(2) exists and satisfies 6≦c(2)≦11. Whether or notc(k) exists for anyk≧3 is an open question. The research of S. M. Malitz was partially supported by NSF Grant CCR-8909953.     

Control of stochastic distributed-parameter systems

A scheme is proposed for the feedback control of distributed-parameter systems with unknown boundary and volume disturbances and observation errors. The scheme consists of employing a nonlinear filter in the control loop such that the controller uses the optimal estimates of the state of the system. A theoretical comparison of feedback proportional control of a styrene polymerization reactor with and without filtering is presented. It is indicated how an approximate filter can be constructed, greatly reducing the amount of computing required.Notation a(t) l-vector noisy dynamic input to system - A(t, a) l-vector function - A frequency factor for first-order rate law (5.68×10⁶ sec^–1) - b distance to the centerline between two coil banks in the reactor (4.7 cm) - B k-vector function defining the control action - c(, ) concentration of styrene monomer, molel ^–1 - C _p heat capacity (0.43 cal · g^–1 · K^–1) - C _ij constants in approximate filter, Eqs. (49)–(52) - E activation energy (20330 cal · mole^–1) - expectation operator - f(t,...) n-vector function - g ₀,g ₁(t,...) n-vector functions - h(t, u) m-vector function relating observations to states - H(t) function defined in Eq. (36) - k dimensionality of control vectorv(x, t) - k _i constants in approximate filter, Eqs. (49)–(52) - K dimensionless proportional gain - l dimensionality of dynamic inputa(t) - m dimensionality of observation vectory(t) - n dimensionality of state vectoru(x, t) - P ^(vv)(x, s, t) n×n matrix governed by Eq. (9) - P ^(va)(x, t) n×l matrix governed by Eq. (10) - P ^(aa)(t) l×l matrix governed by Eq. (11) - q _i (t) diagonal elements ofm×m matrixQ(x, s, t) - Q(x, s, t) m×m weighting matrix - R universal gas constant (1.987 cal · mole^–1 · K^–1) - R(x, s, t) n×n weighting matrix - R _i (t) n×n weighting matrix - s dimensionless spatial variable - S(x, s, t) matrix defined in Eq. (11) - t dimensionless time variable - T(, ) temperature, K - u(x, t) n-dimensional state vector - u _c (t) wall temperature - u _d desired value ofu ₁(1,t) - u _c * reference control value ofu _c - u _c ^max maximum value ofu _c - u _c ^min minimum value of _c - v(x, t) k-dimensional control vector - W(t) l×l weighting matrix - x dimensionless spatial variable - y(t) m-dimensional observation vector - _i constants in approximate filter, Eqs. (49)–(52) - dimensionless parameter defined in Eq. (29) - H heat of reaction (17500 cal · mole^–1) - dimensionless activation energy, defined in Eq. (29) - (x) Dirac delta function - (x, t) m-dimensional observation noise - thermal conductivity (0.43×10^–3 cal · cm^–1 · sec^–1 · K^–1) - density (1 g · cm^–3) - time, sec - dimensionless parameter defined in Eq. (29) - spatial variable, cm - * reference value - ^ estimated value     

Norms of powers of absolutely convergent fourier series

Letf(t) = ∑a _k e ^ikt be infinitely differentiable on R, |f(t)|<1. It is known that under these assumptions ‖ⁿ‖ converges to a finite limitl asn → ∞ (l ² = sec(arga),a = (f′(0))² -f″(0)). We obtain here more precise results: (i) an asymptotic series (in powers ofn ^-1/2) for the Fourier coefficientsa _nk off ⁿ , which holds uniformly ink asn → ∞; (ii) an asymptotic series (this time only powers ofn ^-1 are present!) for ‖f ⁿ ‖; (iii) the fact that ifi ^j f ^(j)(0) is real forj = 1,2,..., 2h + 2 then ‖f ⁿ ‖ = l + o(n ^-h ),n → ∞. More generally, we obtain analogous finite asymptotic expansions whenf is assumed to be differentiable only finitely many times.     

Graphs with unavoidable subgraphs with large degrees

Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a K_{k + 1} in terms of the number of edges in G. In this paper we prove that, for m = αn², α > (k - 1)/2k, G contains a K_{k + 1}, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n²/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn², α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n).     

Spectral Criteria of Abstract Sequences; Application to Difference Equations

We suppose that M is a closed subspace of l ^∞(J, X), the space of all bounded sequences {x(n)} _n?J ? X, where J ? {Z⁺,Z} and X is a complex Banach space. We define the M-spectrum σ_M (u) of a sequence u ? l ^∞(J,X). Certain conditions will be supposed on both M and σ_M (u) to insure the existence of u ? M. We prove that if u is ergodic, such that σ_M (u,) is at most countable and, for every λ ? σ_M (u), the sequence e^?iλnu(n) is ergodic, then u ? M. We apply this result to the operator difference equationu(n + 1) = Au(n) + ψ(n), n ? J,and to the infinite order difference equation Σ ^r _k=1 a_k (u(n + k) ? u(n)) + Σ _{s ? Z}?(n ? s)u(s) = h(n), n?J, where ψ?l ^∞(Z,X) such that ψ| _J ? M, A is the generator of a C ₀-semigroup of linear bounded operators {T(t)} _t>0 on X, h ? M, ? ? l ¹(Z) and a_k ?C. Certain conditions will be imposed to guarantee the existence of solutions in the class M.