Sets of unit vectors with small subset sums

We say that a family of m {xi}Ιi ε[m]\} vectors in a Banach space X satisfies the k-collapsing condition if the sum of any k of them has norm at most 1. Let C(k, d) denote the maximum cardinality of a k-collapsing family of unit vectors in a d-dimensional Banach space, where the maximum is taken over all spaces of dimension d. Similarly, let CB(k, d) denote the maximum cardinality if we require in addition that the m vectors sum to 0. The case k = 2 was considered by Füredi, Lagarias and Morgan (1991). These conditions originate in a theorem of Lawlor and Morgan (1994) on geometric shortest networks in smooth finite-dimensional Banach spaces. We show that CB(k, d) = max {k + 1, 2d} for all k, d ≥ 2. The behaviour of C(k, d) is not as simple, and we derive various upper and lower bounds for various ranges of k and d. These include the exact values C(k, d) = max {k + 1, 2d} in certain cases. We use a variety of tools from graph theory, convexity and linear algebra in the proofs: in particular the Hajnal–Szemerédi Theorem, the Brunn– Minkowski inequality, and lower bounds for the rank of a perturbation of the identity matrix

Equitable colorings of Kronecker products of graphs

AbstractFor a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→{1,2,…,k} such that f(x)≠f(y) whenever xy∈E(G) and ||f−1(i)|−|f−1(j)||≤1 for 1≤i<j≤k. The equitable chromatic number of a graph G, denoted by χ=(G), is the minimum k such that G is equitably k-colorable. The equitable chromatic threshold of a graph G, denoted by χ=∗(G), is the minimum t such that G is equitably k-colorable for k≥t. The current paper studies equitable chromatic numbers of Kronecker products of graphs. In particular, we give exact values or upper bounds on χ=(G×H) and χ=∗(G×H) when G and H are complete graphs, bipartite graphs, paths or cycles

Extremal graph colouring and tiling problems

In this thesis, we study a variety of different extremal graph colouring and tiling problems in finite and infinite graphs. Confirming a conjecture of Gyárfás, we show that for all k, r ∈ N there is a constant C > 0 such that the vertices of every r-edge-coloured complete k-uniform hypergraph can be partitioned into a collection of at most C monochromatic tight cycles. We shall say that the family of tight cycles has finite r-colour tiling number. We further prove that, for all natural numbers k, p and r, the family of p-th powers of k-uniform tight cycles has finite r-colour tiling number. The case where k = 2 settles a problem of Elekes, Soukup, Soukup and Szentmiklóssy. We then show that for all natural numbers ∆, r, every family F = {F1, F2, . . .} of graphs with v (Fn) = n and ∆(Fn) ≤ ∆ for every n ∈ N has finite r-colour tiling number. This makes progress on a conjecture of Grinshpun and Sárközy. We study Ramsey problems for infinite graphs and prove that in every 2-edge- colouring of KN, the countably infinite complete graph, there exists a monochromatic infinite path P such that V (P) has upper density at least (12 + √8)/17 ≈ 0.87226 and further show that this is best possible. This settles a problem of Erdős and Galvin. We study similar problems for many other graphs including trees and graphs of bounded degree or degeneracy and prove analogues of many results concerning graphs with linear Ramsey number in finite Ramsey theory. We also study a different sort of tiling problem which combines classical problems from extremal and probabilistic graph theory, the Corrádi–Hajnal theorem and (a special case of) the Johansson–Kahn–Vu theorem. We prove that there is some constant C > 0 such that the following is true for every n ∈ 3N and every p ≥ Cn−2/3 (log n)1/3. If G is a graph on n vertices with minimum degree at least 2n/3, then Gp (the random subgraph of G obtained by keeping every edge independently with probability p) contains a triangle tiling with high probability

Extremal problems in graphs

In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$-proportion of the vertices of $G$ (for any fixed $x ∈$ (0, 1) and graph $H$). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect $H$-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in $G_n,_p$. Specifically, for fixed graphs $H_1, . . . , H_r,$ we study the asymptotic threshold function for the property $G_n,_p$ → $H_1, . . . , H_r$. Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when $H_1 = · · · = H_r$. Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions)

Proximity Coordinated Random Access (PCRA) for M2M applications in LTE-A

A significant amount of research has been conducted on adapting 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) random access to be more efficient for machine-to-machine (M2M) devices because of the huge number of such devices that may reside in each LTE/LTE-A cell. However, there are other attributes of M2M applications that can be used as the basis of independent efficiency improvements. One characteristic which has been overlooked thus far is the spatial and temporal correlations that often exist in the activity of neighboring M2M devices belonging to the same M2M application. In this paper, we illustrate how these correlations can be exploited by coordinating the preambles to be used by neighboring M2M devices to reduce the number of collisions during LTE-A random access, particularly in wireless sensor network (WSN) type applications. The technique is referred to as proximity coordinated random access (PCRA). Through simulation of an example local preamble coordination algorithm that can be executed autonomously by randomly deployed devices of the same M2M application, we demonstrate an increase in the efficiency of the random access process

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu

A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of Kr that together cover all the vertices in G. In this paper we consider perfect Kr-tilings in the setting of randomly perturbed graphs; a model introduced by Bohman, Frieze, and Martin [7] where one starts with a dense graph and then adds m random edges to it. Specifically, given any fixed 0 < < 1 − 1∕r we determine how many random edges one must add to an n-vertex graph G of minimum degree (G) ≥ n to ensure that, asymptotically almost surely, the resulting graph contains a perfect Kr-tiling. As one increases we demonstrate that the number of random edges required “jumps” at regular intervals, and within these intervals our result is best-possible. This work therefore closes the gap between the seminal work of Johansson, Kahn and Vu [25] (which resolves the purely random case, that is, = 0) and that of Hajnal and Szemerédi [18] (which demonstrates that for ≥ 1 − 1∕r the initial graph already houses the desired perfect Kr-tiling)