Ramsey linear families and generalized subdivided graphs

The following results are obtained. (i) Let p, d, and k be fixed positive integers, and let G be a graph whose vertex set can be partitioned into parts V₁, V₂,…, V_a such that for each i at most d vertices in V₁ … V_i have neighbors in V_i+1 and r(K_k, V_i) p | V(G) |, where V_i denotes the subgraph of G induced by V_i. Then there exists a number c depending only on p, d, and k such that r(K_k, G)c | V(G) |. (ii) Let d be a positive integer and let G be a graph in which there is an independent set I V(G) such that each component of G−I has at most d vertices and at most two neighbors in I. Then r(G,G)c | V(G) |, where c is a number depending only on d. As a special case, r(G, G) 6 | V(G) | for a graph G in which all vertices of degree at least three are independent. The constant 6 cannot be replaced by one less than 4.     

Mollifiers for games in normal form and the Harsanyi-Selten valuation function

The concepts of disruption and mollifiers ofCharnes/Rousseau/Seiford [1978] for games in characteristic function form are here extended to games in normal form. We show for a large class of games that theHarsanyi-Selten [1959] modification ofvon Neumann /Morgenstern's [1953] construction of a characteristic function for games in normal form, to take better account of “disruption” or “threat” possibilities, yields a constant mollifier. In general, it can be non-superadditive when the von Neumann-Morgenstern function is superadditive, and it also fails to take account of coalitional sizes. Our extended “homomollifier” concept does, and always yields a superadditive constant sum characteristic function.     

On Gauss's proof of Seeber's Theorem

Summary Gauss proved Seeber's Theorem, that the determinant of a reduced positive definite ternary quadratic form is at least half the product of its diagonal coefficients, by means of two determinantal identities whose origin has remained unclear. We examine Gauss's method from a general standpoint, as a method whereby, in certain circumstances, a polynomial in several variables may be shown to be non-negative on a convex polytope by representing it as a positive multilinear combination of the linear forms which determine the polytope. We show that Gauss's identities may be obtained in this manner and that the two identities can in fact be replaced by a simpler single identity which also gives Oppenheim's precise minimum for the determinant.     

Voie d'acces originale a des acetamido-3 amino-4 (IH) pyridones-2 par hydrogenation-rearrangement des nitro-3 amino-4 pyridines

3-Nitro 4-alkyl (or aryl) amino pyridines were converted to 3-acetamido 4-a1ky1 (or aryl) amino (1H) pyridine-Z-ones by a catalytic hydrogenation-rearrangement in acetic acid medium.     

An extremal problem for paths in bipartite graphs

A formula is found for the maximum number of edges in a graph G ? K(a, b) which contains no path P_2l for l > c. A similar formula is found for the maximum number of edges in G ? K(a, b) containing no P_{2l + 1} for l > c. In addition, all extremal graphs are determined.     

A Practical Optimisation Technique for a Queueing System

A scheduling problem in an outpatient clinic is considered. First the system is represented by means of a simple queueing model. The problem of minimising the patients' total queueing time is then formulated as a non-linear program and solved by applying the Kuhn-Tucker conditions. The results obtained enable the person who manages the appointment system to allocate appointment dates to patients who have different priorities.