To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The notion of an edge-colouring of a graph can be traced back to 1880 when Tait tried to prove the Four Colour Conjecture. (A detailed account of this can be found in many existing text books on Graph Theory and therefore we shall not repeat it here.) However, there was not much development during the period 1881–1963, A breakthrough came in 1964 when Vizing proved that every graph G having maximum valency Δ can be properly edge-coloured with at most Δ + 1 colours (“proper” means that no two adjacent edges of G receive the same colour). This result generalizes an earlier statement of Johnson [63] that the edges of every cubic graph can be properly coloured with four colours.
Many of the results of this chapter will be concerned with the socalled ‘critical graphs’ introduced by Vizing in the study of classifying which graphs G are such that x'(G) = Δ(G) + 1. The main reference of this chapter is Fiorini and Wilson [77].
We now give a few definitions. Let G be a graph or multigraph. A (proper, edge-) colouring π of G is a map π : E(G) → {1,2,…} such that no two adjacent edges of G have the same image. The chromatic index χ'(G) of G is the minimum cardinality of all possible images of colourings of G. Hence, if Δ = Δ(G), then it is clear that χ'(G) > Δ and Vizing's theorem says that Δ < χ'(G) < Δ + 1. If χ'(G) = Δ, G is said to be of class 1, otherwise G is said to be of class 2.
We can instal a graph G of order n into a computer by encoding the entries of the upper triangular part of its adjacency matrix. One problem arises naturally : “Can we find, in the worst case, whether the graph G has a specific property P, without decoding all the n(n–1)/2 entries of the upper triangular part of its adjacency matrix?”
The main objective of this chapter is to introduce a Two Person Game to tackle the above problem.
Let Gn be the set of all graphs of order n and let F ⊆. Gn be the set of all graphs such that each of its members has property P. To see that whether a graph G (of order n) possesses property P or not, it is equivalent of showing whether G belongs to F or not. Hence we can introduce the Two Person Game in a general setting and treat the graph property as a special case.
Let T be a finite set of cardinality |T| = t and let p(T) be the power set of T, i.e. the set of all subsets of T. We call F ⊆ p(T) a property of T. A measure of the minimum amount of information necessary, in the worst case, to determine membership of F is as follows. Suppose two players, called the Constructor (Hider) and Algy (Seeker), play the following game which we also denote by F. Algy asks questions of the Constructor about a hypothetical set H ⊂ T.
Suppose G1, G2, …, Gκ are graphs of order at most n. We say that there is a packing of G1, G2, …, Gκ into the complete graph κn if there exist injections αi : V(Gi) + V (κn), i = 1,2,…, κ such that α*i(E(Gi)) ∩ α*j(E(Gj)) = Φ for i ≠ j, where the map α*i : E(Gi) → E(kn) is induced by αi. Similarly, suppose G is a graph of order m and H is a graph of order n ≥ m and there exists an injection α : V(G) → V(H) such that α*(E(G)) ∩ E(H) = Φ. Then we say that there is a packing of G into H, and in case n = m, we also say that there is a packing of G and H or G and H are packable. Thus G can be packed into H if and only if G is embeddable in the complement H of H. However, there is a slight difference between embedding and packing. In the study of embedding of a graph into another graph, usually at least one of the graphs is fixed whereas in the study of packing of two graphs very often both the graphs are arbitrarily chosen from certain classes.
In practice, one would like to find an efficient algorithm to pack two graphs G and H. But this has been shown to be an NP-hard problem (see Garey and Johnson [79;p.64]).
The following theorem shows that when packing unit spheres in a large box the spheres occupy at most about 0.7784 of the volume of the box. This improves Rogers' bound [2], which is approximately 0.7796. In the most efficient known packing the ratio is about 0.7405. The box in the theorem could be any bounded solid. Then the (l + 2)(m + 2)(n + 2) becomes the volume of a larger solid all of whose boundary points are at least one unit away from the original solid. At the start of the proof the even larger box could be replaced with a large ball concentric with and radius five units larger than some ball containing the original solid.
Large sieve inequalities have been developed and applied to a host of arithmetical problems since their inception by Linnik in 1941. Such inequalities provide mean square estimates for a trigonometric polynomial over a set of well-spaced points. In particular, let x ∈ ℝ and let
The usual method of dealing with delay differential equations such as
is the method of steps [1, 2]. In this, y(x) is assumed to be known for − α < x < 0, thereby defining over 0 < x < α. As a result of integration, the value of y is now known over 0 < x < α, and the integration proceeds thereon by a succession of steps.
In the last three decades there appeared a number of elementary proofs of the prime number theorem (PNT) in the literature (see [3] for a survey). Most of these proofs are based, at least in part, on ideas from the original proof by Erdős [5] and Selberg [12]. In particular, one of the main ingredients of the Erdős-Selberg proof, Selberg's formula
(where p and q run through primes) appears, in some form, in almost all these proofs.
In a recent paper Taylor and Tricot [10] introduced packing measures in ℝd. We modify their definition slightly to extend it to a general metric space. Our main concern is to show that in any complete separable metric space every analytic set of non-σ-finite h-packing measure contains disjoint compact subsets each of non-σ-finite measure. The corresponding problem for Hausdorff measures is discussed, but not completely resolved, in Rogers' book [7]. We also show that packing measure cannot be attained by taking the Hausdorff measure with respect to a different increasing function using another metric which generates the same topology. This means that the class of pacing measures is distinct from the class of Hausdorff measures.
We continue the study of approximate subdifferentials initiated in [3], this time for functions on arbitrary locally convex spaces. The complexity of the infinite dimensional theory is in particular determined by the fact that various approaches and definitions which are equivalent in the finite dimensional situation are, in general, no longer equivalent if the space is infinite dimensional.
E. Cartan's famous isoparametric hypersurface in S4 with three distinct constant principal curvatures is geometrically a parallel hypersurface of the Veronese surface, and topologically it is an 8-fold quotient of the 3-sphere. In the present paper we describe a polyhedral analogue with only 15 vertices. Combinatorially this is an 8-fold quotient of the boundary complex of the 600-cell, and geometrically it is a quite regular subcomplex of a certain almost convex simplicial 4-sphere in E5. The euclidean symmetry group of this embedding is isomorphic to the icosahedral group A5 acting transitively on the 15 vertices.
It is well-known that if R is a commutative ring with identity, M is a Noetherian R-module and I is an ideal of R such that M/IM has finite length, then the function n → lR (M /InM) is a polynomial function for n large (cf. [3], p. II-25), where lR denotes length as an R-module. In this note we are concerned with the function
where a1, … , ar is a multiplicity system for has finite length.
In a series of papers we have analysed the embedding of certain groups H as normal subgroups of absolutely irreducible skew linear groups G, see [7], [8], [9] and [10]. Here we drop the absolutely irreducibility assumption on G. If H is locally finite we derive relatively strong conditions on G, although not as strong as when G is absolutely irreducible. If H is abelian, very much in contrast to the absolutely irreducible case, we show that nothing can be said. The phrase “bounded by an integer-valued function of n only” we abbreviate to “n-bounded”.
In 1979 Montgomery and Vaughan [3] showed that for each k > 0
the sum being over the non-principal characters χ modulo q. As a corollary they deduced that, if 0 < θ < 1 then there is a constant c(θ) such that at least θφ(q) of the non-principal characters χ modulo q satisfy
Let k denote a fixed natural number with k > 2, let ℛs(n) denote the number of representations of n as the sum of sk-th powers of natural numbers, and let
be a real quadratic form in n variables with integral coefficients (i.e., 2fij ε ℤ, fiiε ℤ.) and determinant D ≠ O. A well-known theorem of Cassels [1] states that if the equation f = 0 is properly soluble in integers x1 … , xn then there is a solution satisfying
where F = max |fij and we use the «-notation with an implicit factor depending only on n. More recently it has been shown that f has n linearly independent zeros x1 …, xn satisfying