Realization of a sum of sequences by a sum graph

It is shown that the realizability of the sequences ϕ=(a ₁,…, _a ), ψ=(b ₁,…,b _n ) and ϕ+ψ is a sufficient condition for the realizability of ϕ+ψ by a graph with a ϕ-factor ifb _i ≦1 fori=1,…,n. The condition is not sufficient in general. A necessary and sufficient condition for the realizability of ϕ+ψ by a graph with a ϕ-factor is given for the case that ϕ is realizable by a star and isolated vertices.     

On a problem of spencer

LetX ₁, ...,X _n be events in a probability space. Let ϱ_i be the probabilityX _i occurs. Let ϱ be the probability that none of theX _i occur. LetG be a graph on [n] so that for 1 ≦i≦n X _i is independent of ≈X _j ‖(i, j)∉G≈. Letf(d) be the sup of thosex such that if ϱ₁, ..., ϱ _n ≦x andG has maximum degree ≦d then ϱ>0. We showf(1)=1/2,f(d)=(d−1) ^d−1 d ^−d ford≧2. Hence df(d)=1/e. This answers a question posed by Spencer in [2]. We also find a sharp bound for ϱ in terms of the ϱ _i andG.     

Matrices with the edmonds—Johnson property

A matrixA=(a _ij ) has theEdmonds—Johnson property if, for each choice of integral vectorsd ₁,d ₂,b ₁,b ₂, the convex hull of the integral solutions ofd ₁≦x≦d ₂,b ₁≦Ax≦b ₂ is obtained by adding the inequalitiescx≦|δ|, wherec is an integral vector andcx≦δ holds for each solution ofd ₁≦x≦d ₂,b ₁≦Ax≦b ₂. We characterize the Edmonds—Johnson property for integral matricesA which satisfy for each (row index)i. A corollary is that ifG is an undirected graph which does not contain any homeomorph ofK ₄ in which all triangles ofK ₄ have become odd circuits, thenG ist-perfect. This extends results of Boulala, Fonlupt, Sbihi and Uhry. First author’s research supported by the Netherlands Organization for the Advancement of Pure Research (Z.W.O.).     

Every large set of equidistant (0, +1, −1)-vectors forms a sunflower

A theorem of Deza asserts that ifH ₁, ...,H _m ares-sets any pair of which intersects in exactlyd elements and ifm ≧s ² −s+2, then theH _i form aΔ-system, i.e. . In other words, every large equidistant (0, 1)-code of constant weight is trivial. We give a (0, +1, −1) analogue of this theorem.     

Packing nearly-disjoint sets

De Bruijn and Erdős proved that ifA ₁, ...,A _k are distinct subsets of a set of cardinalityn, and |A _i ∩A _j |≦1 for 1≦i<j ≦k, andk>n, then some two ofA ₁, ...,A _k have empty intersection. We prove a strengthening, that at leastk /n ofA ₁, ...,A _k are pairwise disjoint. This is motivated by a well-known conjecture of Erdőds, Faber and Lovász of which it is a corollary. Partially supported by N. S. F. grant No. MCS—8103440     

Extremal hypergraph problems and convex hulls

Theprofile of a hypergraph onn vertices is (f ₀, f₁, ...,f _n) wheref _i denotes the number ofi-element edges. The extreme points of the set of profiles is determined for certain hypergraph classes. The results contain many old theorems of extremal set theory as particular cases (Sperner. Erdős—Ko—Rado, Daykin—Frankl—Green—Hilton).     

Intersection theorems with geometric consequences

In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ₀, μ₁, ..., μ_s are distinct residues modp (p is a prime) such thatk ≡ μ₀ (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μ_i (modp) for somei, 1 ≦i≦s, then |ℱ|≦( _s ⁿ ). As a consequence we show that ifR ⁿ is covered bym sets withm<(1+o(1)) (1.2) ⁿ then there is one set within which all the distances are realised. It is left open whether the same conclusion holds for compositep.     

Arc-disjoint in-trees in directed graphs

Given a directed graph D = (V,A) with a set of d specified vertices S = {s ₁,…, s _d } ⊆ V and a function f: S → ℕ where ℕ denotes the set of natural numbers, we present a necessary and sufficient condition such that there exist Σ _i=1 ^d f(s _i ) arc-disjoint in-trees denoted by T _i,1,T _i,2,…, for every i = 1,…,d such that T _i,1,…, are rooted at s _i and each T _i,j spans the vertices from which s _i is reachable. This generalizes the result of Edmonds [2], i.e., the necessary and sufficient condition that for a directed graph D=(V,A) with a specified vertex s∈V, there are k arc-disjoint in-trees rooted at s each of which spans V. Furthermore, we extend another characterization of packing in-trees of Edmonds [1] to the one in our case. Supported by JSPS Research Fellowships for Young Scientists. Supported by the project New Horizons in Computing, Grand-in-Aid for Scientific Research on Priority Areas, MEXT Japan.     

Almost poised basic hypergeometric series

Given a basic hypergeometric series with numerator parametersa ₁,a ₂, ...,a _r and denominator parametersb ₂, ...,b _r, we say it isalmost poised ifb _i, =a ₁ q ^δ,i a _i,δ_i = 0, 1 or 2, for 2 ≤i ≤r. Identities are given for almost poised series withr = 3 andr = 5 when a₁, =q ⁻²ⁿ. Partially supported by N.S.F. Grant No. DMS-8521580.     

On disjointly representable sets

A system of setsE ₁,E ₂, ...,E _k ⊂X is said to be disjointly representable if there existx ₁,x ₂, ...,x _k teX such thatx _i teE _j ⇔i=j. Letf(r, k) denote the maximal size of anr-uniform set-system containing nok disjointly representable members. In the first section the exact value off(r, 3) is determined and (asymptotically sharp) bounds onf(r, k),k>3 are established. The last two sections contain some generalizations, in particular we prove an analogue of Sauer’ theorem [16] for uniform set-systems. Dedicated to Paul Erdős on his seventieth birthday     

Extreme value limit laws in the nonidentically distributed case

LetX ₁, ...,X _n be independent random variables, letF _i be the distribution function ofX _i (1≦i≦n) and letX _1n ≦... ≦X _nn be the corresponding order statistics. We consider the statisticsX _kn, wherek=k(n),k/n → 1 andn−k → ∞. Under some additional restrictions concerning the behaviour of the sequences {a _n>0,b _n,k(n),F _n} we characterize the class of all distribution functionsH such that Prob{(X _kn −b _n )/a _n <x)}→H. Dedicated to the Memory of N. V. Smirnov (1900–1966)     

Diperfect graphs

Gallai and Milgram have shown that the vertices of a directed graph, with stability number α(G), can be covered by exactly α(G) disjoint paths. However, the various proofs of this result do not imply the existence of a maximum stable setS and of a partition of the vertex-set into paths μ₁, μ₂, ..., μ_k such tht |μ_i ∩S|=1 for alli. Later, Gallai proved that in a directed graph, the maximum number of vertices in a path is at least equal to the chromatic number; here again, we do not know if there exists an optimal coloring (S ₁,S ₂, ...,S _k) and a path μ such that |μ ∩S _i|=1 for alli. In this paper we show that many directed graphs, like the perfect graphs, have stronger properties: for every maximal stable setS there exists a partition of the vertex set into paths which meet the stable set in only one point. Also: for every optimal coloring there exists a path which meets each color class in only one point. This suggests several conjecties similar to the perfect graph conjecture. Dedicated to Tibor Gallai on his seventieth birthday     

Gersgorin variations II: On themes of Fan and Gudkov

Assume F={f₁,. . .,f_n} is a family of nonnegative functions of n−1 nonnegative variables such that, for every matrix A of order n, |a_ii|>f_i (moduli of off-diagonal entries in row i of A) for all i implies A nonsingular. We show that there is a positive vector x, depending only on F, such that for all A=(a_ij), and all i, f_i≥∑_j|a_ij|{x_j}/x_i. This improves a theorem of Ky Fan, and yields a generalization of a nonsingularity criterion of Gudkov. Dedicated to Charles A. Micchelli, in celebration of his 60th birthday and our 30 years of friendship     

Identification of parameters by the distribution of the maximum random variable: The general multivariate normal case

Summary LetX ₁,X ₂, ...,X _r ber independentn-dimensional random vectors each with a non-singular normal distribution with zero means and positive partial correlations. Suppose thatX _i =(X _i1 , ...,X _in ) and the random vectorY=(Y ₁, ...,Y _n ), their maximum, is defined byY _j =max{X _ij :1ir}. LetW be another randomn-vector which is the maximum of another such family of independentn-vectorsZ ₁,Z ₂, ...,Z _s . It is then shown in this paper that the distributions of theZ _i 's are simply a rearrangement of those of theZ _j 's (and of course,r=s), whenever their maximaY andW have the same distribution. This problem was initially studied by Anderson and Ghurye [2] in the univariate and bivariate cases and motivated by a supply-demand problem in econometrics.     

Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

Ubiquity of relative regular sequences and proper sequences

A relative regular sequencea ₁, ...,a _r , with respect to the idealI=(a ₁, ...,a _r ) has the property thatI annihilates the Koszul homology associated to each initial subsequence. This note analyzes the concepts of relative regular and proper sequences, two notions situated in a strategic position for studying the arithmetical properties of Blow-up Algebras in the largest context of generalized Cohen-Macaulay rings.     

Partition conditions and vertex-connectivity of graphs

It was proved ([5], [6]) that ifG is ann-vertex-connected graph then for any vertex sequencev ₁, ...,v _n ≠V(G) and for any sequence of positive integersk ₁, ...,k _n such thatk ₁+...+k _n =|V(G)|, there exists ann-partition ofV(G) such that this partition separates the verticesv ₁, ...,v(n), and the class of the partition containingv _i induces a connected subgraph consisting ofk _i vertices, fori=1, 2, ...,n. Now fix the integersk ₁, ...,k _n . In this paper we study what can we say about the vertex-connectivity ofG if there exists such a partition ofV(G) for any sequence of verticesv ₁, ...,v _n ≠V(G). We find some interesting cases when the existence of such partitions implies then-vertex-connectivity ofG, in the other cases we give sharp lower bounds for the vertex-connectivity ofG.     

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 .     

A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS

Abstract

A connected graph G of order p =|V| and sise q =| E | is said to be (a_i, b_i)-destructible (with respect to E_i and V_i say) if a_i,b_i are integral factors of p and an a_i-set of edges E_i exists whose removal from G results in exactly b_i components isomorphic to K_i i.e. whose removal from G isolates the vertices in a b_i-set V_i. The operation of removing E_i and V_i from G results in either Ø or a subgraph H of G and is called an (a_i , b_i)-destruction of G. In this paper we show that the only graphs whose every (a_i,b_i)- destruction results in a complete subgraph are K (1,2) and K₄—e, where e ε K₄.     

Intersecting sperner families and their convex hulls

Let ℱ be a family of subsets of a finite set ofn elements. The vector (f ₀, ...,f _n ) is called the profile of ℱ wheref _i denotes the number ofi-element subsets in ℱ. Take the set of profiles of all families ℱ satisfyingF ₁⊄F ₂ andF ₁∩F ₂≠0 for allF ₁,F ₂teℱ. It is proved that the extreme points of this set inR ⁿ⁺¹ have at most two non-zero components. Dedicated to Paul Erdős on his seventieth birthday