On the order of certain close to regular graphs without a matching of given size

A graph G is a {d, d+k}-graph, if one vertex has degree d+k and the remaining vertices of G have degree d. In the special case of k = 0, the graph G is d-regular. Let k, p ⩾ 0 and d, n ⩾ 1 be integers such that n and p are of the same parity. If G is a connected {d, d+k{-graph of order n without a matching M of size 2|M| = n − p, then we show in this paper the following: If d = 2, then k ⩾ 2(p + 2) and

Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph

Let G be a graph with n vertices, m edges and a vertex degree sequence (d ₁, d ₂,..., d _n ), where d ₁ ≥ d ₂ ≥ ... ≥ d _n . The spectral radius and the largest Laplacian eigenvalue are denoted by ϱ(G) and μ(G), respectively. We determine the graphs with

Mader’s Conjecture On Extremely Critical Graphs

A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K_2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism). Here we prove this conjecture.     

Total Domination in Partitioned Graphs

We present results on total domination in a partitioned graph G = (V, E). Let γ _t (G) denote the total dominating number of G. For a partition , k ≥ 2, of V, let γ _t (G; V _i ) be the cardinality of a smallest subset of V such that every vertex of V _i has a neighbour in it and define the following

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number η(G) of a graph G is the largest integer n for which the complete graph K _n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, η(G) ≥ χ(G), where χ(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product of graphs. As the main result of this paper, we prove that for any two graphs G ₁ and G ₂ with η(G ₁) = h and η(G ₂) = l. We show that the above lower bound is asymptotically best possible when h ≥ l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following:

Precise asymptotics in self-normalized sums of iterated logarithm for multidimensionally indexed random variables

In the case of Zd (d ≥ 2)-the positive d-dimensional lattice points with partial ordering ≤, {Xk,k ∈ Zd } i.i.d. random variables with mean 0, Sn = ∑k≤nXk and Vn2 = ∑j≤nX2j, the precise asymptotics for ∑n1/|n|(log|n|)dP(|Sn/vn|≥ ε√loglog|n|) and ∑n(logn|)δ/|n|(log|n|)d-1 P(|Sn/Vn| ≥ ε√log n), as ε ↘ 0, is established.     

An extension of almost sure central limit theorem for order statistics

Let {X _n ,n ≥ 1} be a sequence of i.i.d. random variables. Let M _n and m _n denote the first and the second largest maxima. Assume that there are normalizing sequences a _n  > 0, b _n and a nondegenerate limit distribution G, such that . Assume also that {d _k ,k ≥ 1} are positive weights obeying some mild conditions. Then for x > y we have

Additive inequalities for intermediate derivatives of differentiable mappings of Banach spaces

Suppose thatX andY are real Banach spaces,U ⊂X is an open bounded set star-shaped with respect to some point,n, k ∈ ℕ,k <n, andMn, k (U,Y) is the sharp constant in the Markov type inequality for derivatives of polynomial mappings. It is proved that for anyM ≥M _n,k (U, Y) there exists a constantB > 0 such that for any functionf ∈C ⁿ (U, Y) the following inequality holds:

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces

Let G be an infinite graph embedded in a closed 2-manifold, such that each open face of the embedding is homeomorphic to an open disk and is bounded by finite number of edges. For each vertex x of G, define the combinatorial curvature

A Ramsey-Sperner theorem

Letn≥k≥1 be integers and letf(n, k) be the smallest integer for which the following holds: If ℱ is a family of subsets of ann-setX with |ℱ|<f(n,k) then for everyk-coloring ofX there existA B ∈ ℱ,A∈B, A⊂B such thatB-A is monochromatic. Here it is proven that for a fixedk there exist constantsc _k andd _k such that and ask→∞. The proofs of both the lower and the upper bounds use probabilistic methods.     

Extremal Problems for Imbalanced Edges

Albertson [2] has introduced the imbalance of an edge e=uv in a graph G as |d_G(u)−d_G(v)|. If for a graph G of order n and size m the minimum imbalance of an edge of G equals d, then our main result states that with equality if and only if G is isomorphic to We also prove best-possible upper bounds on the number of edges uv of a graph G such that |d_G(u)−d_G(v)|≥d for some given d.     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

Degree Bounded Spanning Trees

In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set ${S \subseteq V(G)}In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S í V(G){S \subseteq V(G)} of cardinality n(k−1) + c + 2, there exists a vertex set X í S{X \subseteq S} of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c −1. Then G has a spanning tree T with maximum degree at most k+éc/nù{k+\lceil c/n\rceil} and ?_{v ? V(T)}max{d_T(v)-k,0} ￡ c{\sum_{v\in V(T)}\max\{d_T(v)-k,0\}\leq c} .     

Precise rates in the law of the logarithm for the moment convergence in Hilbert spaces

Let （X, Xn; n ≥1） be a sequence of i.i.d, random variables taking values in a real separable Hilbert space （H, ｜｜·｜｜） with covariance operator ∑. Set Sn = X1 ＋ X2 ＋ ... ＋ Xn, n≥ 1. We prove that, for b 〉 -1,
lim ε→0 ε^2（b＋1） ∞ ∑n=1 （logn）^b/n^3/2 E{｜｜Sn｜｜-σε√nlogn}=σ^-2（b＋1）/（2b＋3）（b＋1） B｜｜Y｜^2b＋3
holds if EX=0,and E｜｜X｜｜^2（log｜｜x｜｜）^3bv（b＋4）〈∞ where Y is a Gaussian random variable taking value in a real separable Hilbert space with mean zero and covariance operator ∑, and σ^2 denotes the largest eigenvalue of ∑.     

The minimum degree threshold for perfect graph packings

Let H be any graph. We determine up to an additive constant the minimum degree of a graph G which ensures that G has a perfect H-packing (also called an H-factor). More precisely, let δ(H,n) denote the smallest integer k such that every graph G whose order n is divisible by |H| and with δ(G)≥k contains a perfect H-packing. We show that

A generalized Jensen’s mapping and linear mappings between Banach modules

Let X and Y be vector spaces. It is shown that a mapping f : X → Y satisfies the functional equation

Precise rates in the law of the iterated logarithm under dependence assumptions

Let {X, X1, X2,...} be a strictly stationaryφ-mixing sequence which satisfies EX = 0,EX^2（log2{X}）^2〈∞and φ（n）=O（1/log n）^Tfor some T〉2.Let Sn=∑k=1^nXk and an=O（√n/（log2n）^γ for some γ〉1/2.We prove that limε→√2√ε^2-2∑n=3^∞1/nP（｜Sn｜≥ε√ESn^2log2n＋an）=√2.The results of Gut and Spataru （2000） are special cases of ours.     

Quantitative form of the Luzin <Emphasis Type="Italic">C</Emphasis>-property

We prove the following statement, which is a quantitative form of the Luzin theorem on C-property: Let (X, d, μ) be a bounded metric space with metric d and regular Borel measure μ that are related to one another by the doubling condition. Then, for any function f measurable on X, there exist a positive increasing function η ∈ Ω (η(+0) = 0 and η(t)t ^−a decreases for a certain a > 0), a nonnegative function g measurable on X, and a set E ⊂ X, μE = 0 , for which

Observable actions of algebraic groups

Let G be an affine algebraic group and let X be an affine algebraic variety. An action G × X → X is called observable if for any G-invariant, proper, closed subset Y of X there is a nonzero invariant f ∈ \Bbbk\Bbbk [X] ^G such that f| _Y = 0. We characterize this condition geometrically as follows. The action G × X → X is observable if and only if: