BOLYAI SOCIETY MATHEMATICAL STUDIES
BOLYAI socrsrv MATHEMATICAL STUDIES Series Editor: GaborFejes T6th Publication Board: Gyula O.H. Katona- Laszlo Lovasz . PeterPalPalfy AndrasRecski . AndrasStipsicz . Domokos Szasz Managing Editor: DezsO Mikl6s 1. Combinatorics, Paul Erdlls is Eighty,Vol. 1 D. Miklos, V.T. S6s,T.Szonyi(Eds.) 2. Combinatorics, Paul Erdlls is Eighty,Vol. 2 D. Mikl6s,V.T. S6s,T.Szonyi(Eds.) 3. Extremal Problems for Finite Sets P. Frankl, Z. Fiiredi,G. Katona, D. Mikl6s(Eds.) 4. Topologywith Applications A.Csaszar(Ed.) 5. Approximation Theory and Function Series P.Vertesi, L. Leindler, Sz. Revesz, J. Szabados, V. Totik(Eds.) 6. Intuitive Geometry I. Barany, K. Boroczky (Eds.) 7. Graph Theory and Combinatorial Biology L. Lovasz, A. Gyarfas, G. Katona, A. Recski (Eds.) 8. Low Dimensional Topology K. Boroczky, [r.,W Neumann, A.Stipsicz (Eds.) 9. Random Walks P. Revesz, B. T6th (Eds.) 10. Contemporary Combinatorics B. Bollobas (Ed.) 11. Paul Erdlls and His Mathematics 1+11 G. Halasz, L. Lovasz, M. Simonovits, V. T. S6s (Eds.) 12. Higher Dimensional Varietiesand Rational Points K. Boroczky, Ir., J. Kollar, T. Szarnuely (Eds.) 13. Surgery on Contact 3-Manifolds and Stein Surfaces B.Ozbagci, A. I. Stipsicz 14. A Panorama of Hungarian Mathematics in the Twentieth Century,Vol.1 J. Horvath (Ed.) 15. More Sets, Graphs and Numbers E. Gy6ri,G. Katona,L. Lovasz (Eds.) 16. Entropy,Search, Complexity I. Csiszar, G. Katona,G. Tardos(Eds.) 17. Horizons of Combinatorics E. Gy6ri,G. Katona,L. Lovasz (Eds.) 18. Handbook of Large-Scale Random Networks B.Bollobas, R. Kozma, D. Miklos (Eds.) 19. Building Bridges M. Grotschel,G. Katona (Eds.)
Gyula o. H. Katona Alexander Schrijver Tamas Szonyi (Eds.)
Fete of Combinatorics and Computer Science
~ Springer
JANOS BOLYAI MATHEMATICAL SOCIETY
GyulaO. H. Katona
Managing Editor:
AlfredRenyi Institute of Mathematics HungarianAcademy of Sciences Realtanoda u. 13-15 Budapest1053 Hungary e-mail:
[email protected]
Gabor Sagi
AlexanderSchrijver
AlfredRenyi Instituteof Mathematics HungarianAcademy of Sciences Realtanoda u. 13-15 Budapest 1053 Hungary e-mail:
[email protected]
Centre for Mathematics and Computer Science Science Park 123 1098 XGAmsterdam The Netherlands e-mail:
[email protected]
Tamas Szonyi Eotvos University Department of Computer Science PazmanyPetersetany l/C Budapest1117 Hungary e-mail:
[email protected]
Mathematics Subject Classification (2000): 05XX, 68XX
Libraryof CongressControl Number:2010928477
ISSN 1217-4696 ISBN 978-3-642-13579-8 SpringerBerlinHeidelberg NewYork ISBN 978-963-9453-12-8 JanosBolyai Mathematical Society, Budapest This work is subject to copyright.All rights are reserved,whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting,reproduction on microfilmor in any other way, and storagein data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Lawof September 9,1965,in its current version, and permission for use must always be obtainedfrom Springer. Violations are liablefor prosecutionunder the German CopyrightLaw. Springeris a part of SpringerScience-sBusiness Media springer.com © 2010JanosBolyai Mathematical Societyand Springer-Verlag Printed in Hungary The use of general descriptive names, registered names, trademarks,etc. in this publicationdoes not imply. even in the absenceof a specific statement,that such namesare exemptfrom the relevant protectivelawsand regulations and thereforefree for generaluse. Cover design:WMXDesign GmbH,Heidelberg Printed on acid-freepaper 44/3142/db- 5432 10
CONTENTS
CONTENTS . ...... . ... . .. . . . . . . . .... .. . . . . . . .. . . .. .. . .. . .. . .. .. .... .. PREFACE. . . . ... ... ....... . . . ... .... . . . ... . ..... . .. .. . .. . ... . .. .. . . .. N. ALON and N. WORMALD: High Degree Graphs Contain LargeStar Factors S. BUTLER and R. GRAHAM: Iterated Triangle Partitions F. CHUNG and W . ZHAO: PageRank and Random Walks on Graphs . J . CIBULKA, J . KYNCL, V . MESZAROS , R. STOLAR and P. VALTR: Solution of Peter Winkler's Pizza Problem B . CSABA, I. LEVITT, J. NAGy-GYORGY and E . SZEMEREDI: Tight Bounds for Embedding Bounded Degree Trees G . ELEK: Betti Numbers are Testable T . JORDAN : Rigid and Globally Rigid Graphs with Pinned Vertices .. G. KALAl: Noise Sensitivity and Chaos in Social Choice Theory ..... A. KOSTOCHKA , M. KUMBHAT and V . RODL: Coloring Uniform Hypergraphs with Small Edge Degrees E. MARCHANT and A . THOMASON: Extremal Graphs and Multigraphs with Two Weighted Colours V. RODL and M . SCHACHT: Regularity Lemmas for Graphs B . SZEGEDY: Edge Coloring Models as Singular Vertex Coloring Models T .-L. WONG , D. YANG and X . ZHU: List Total Weighting of Graphs OPEN PROBLEMS
5 7 9 23 43 63 95 139 151 173 213 239 287 327 337 355
PREFACE
This book is the second volume of mathematical papers to commemorate the 60th birthday of Laszlo ('Laci ') Lovasz on March 9, 2008. Prominent mathematicians that were inspired by Laci were invited to contribute to the celebrations of this milestone in the Summer of 2008. The response was overwhelming, and therefore two conferences were organized , the first from 5-9 August 2008 in Budapest, and the second the week after, from 11-15 August 2008 in Keszthely, at the borders of Lake Balaton. The first meeting was baptized Building Bridges - Between Mathematics and Computer Sci ence, the second Fete of Combinatorics and Computer Science. These names also adorn the two volumes published to commemorate the celebrations. The two names very well reflect the power and the beauty of Laci's work. Many of his results indeed can be characterized by building new, powerful bridges between and within mathematics and computer science, and these are really feasts to the combinatorial and algorithmic mind. Several of the methods found by Lovasz have opened up new areas of research in discrete mathematics and algorithmics. Often , these methods were obtained by Lovasz by developing beautiful new techniques based on algebra , geometry, or topology, thus laying fundaments for the important role of classical mathematics in more modern fields like combinatorics, optimization, algorithmics, and complexity. Laci Lovasz has obtained so many pioneering results that it would be quite impossible to describe a reasonable part of it . Let us just give a brief selection. He solved several important open problems in discrete mathematics, like the perfect graph conjecture, Kneser's conjecture, the Shannon capacity problem , the matroid matching problem, and the matching lattice problem. He proved the now called 'Lovasz Local Lemma' , basic in probabilistic combinatorics and randomized algorithms. He pointed out the significance of the ellipsoid method and semidefinite programming for combinatorial optimization, and he designed the lattice basis reduction method, with a wealth of applications in discrete mathematics, combinatorial optimization , integer programming, number theory, algebra, and cryptography. Other basic algorithmic results were found for volume computation and
8
Preface
communication complexity. Recently, Laci was the main inspirator of the new area of graph limits, with its connections to extremal combinatorics and mathematical physics. Laci's deep insight in the combinatorial and algorithmic potentials of geometry and topology is unique. Several of his results are ground-breaking, and there seems little chance that they would have been detected without him. They have inspired and directed the work of a huge part of the researchers in discrete mathematics, optimization, and algorithmics . Laci's reputation is beyond any measure not only because of his results and insights , but also because of his very pleasant modesty, his willingness to cooperate and to exchange ideas, and the extreme transparency of his lectures, which form usually exciting eye-openers. The inspiration and charismatic ambiance offered by Laci and his wife Kati have given them many friends and collaborators, all over the world and in a wide range in mathematics and computer science. We are very happy that many of them have reacted enthusiastically to our invitation to contribute to the volumes, and that we received so many excellent articles. Like the first volume, also this second volume forms an expression of the impact of Laci Lovasz's work and of the inspiration given by him to many scientists world-wide. Budapest August 2009
Gyula Katona Alexander Schrijver Tamas Szonyi
Fete of Combinatorics, pp. 9-21.
BOlYAI SOCIETY MATHEMATICAL STUDIES, 20
HIGH DEGREE GRAPHS CONTAIN LARGE-STAR FACTORS
NOGA ALON* and NICHOLAS WORMALDt Dedicated to Laszl6 Loudsz, for his 60th birthday
We show that any finite simple graph with minimum degree d contains a spanning star forest in which every connected component is of size at least n((dj logd)l /3). This settles a problem of Havet, Klazar, Kratochvil, Kratsch and Liedloff.
Dedication This paper is dedicated to Lad Lovasz, for his 60th birthday. It settles a problem presented by Jan Kratochvil at the open problems session of the meeting Building Bridges, which took place in Budapest in August 2008, celebrating this birthday. The Lovasz Local Lemma is applied extensively throughout the proof. This work is therefore a typical example illustrating the immense influence of Laci, who not only provided the community with powerful tools and techniques, but also stimul ated research by his books, lectures and organization of conferences.
1. INTRODUCTION All graphs considered here are finite and simple. A star is a tree with one vertex, the center, adjacent to all the others, which are leaves. A star factor of a graph G is a spanning forest of G in which every connected component is a star. It is easy to see that any graph with positive minimum degree contains a star factor in which every component is a star with at least one "Research supported in part by ERC advanced grant, by a USA-Israel BSF grant, by NSF grant CCF 0832797 and by the Ambrose Monell Foundation. tSupported by the Canada Research Chairs Program and NSERC .
10
N. Alon and N. Worm ald
edge. A conjecture of Havet et al. [9], communicated to us by Jan Kratochvil [10], asserts that if the minimum degree is large then one can ensure that all stars are large. More precisely, they conjectured that there is a function g(d) that tends to infinity as d tends to infinity, so that every graph with minimum degree d contains a star factor in which every star contains at least g(d) edges. Our main result shows that this is indeed the case, for a function g(d) that grows moderately quickly with d, as follows. Theorem 1.1. There exists an absolute positive constant c so that for all d ~ 2, every graph with minimum degree d contains a star factor in which every star has at least cd1/ 3 j (log d) 1/3 edges.
The motivation for the conjecture of Havet et al. arises in the running time analysis of a recent exact exponential time algorithm for the so called L(2 , I)-labeling problem of graphs. See [9] for more details. As preparation for the proof of the main result, we prove the following simpler statement. Theorem 1.2. There exists an absolute positive constant c' such that for all d ~ 2, every d-regular graph contains a star factor in which every star has at least c'd] log d edges. This is optimal, up to the value of the constant c'.
Throughout the paper we make no attempt to optimize the absolute constants. To simplify the presentation we omit all floor and ceiling signs whenever these are not crucial. We may and will assume, whenever this is needed, that the minimum degree d considered is sufficiently large. It is easy to find, in any graph with all vertices of degree at least 1, a st ar factor with st ars of at least two vertices each, so the theorems then follow for all d ~ 2. All logarithms are in the natural base, unless otherwise specified. Our notation is standard. In particular, for a graph G = (V, E) and a vertex v E V, we let Nc(v) denote the set of all neighbors of v in the graph G, and let dc(v) = INc(v)1 denote the degree of v in G. For X c V, Nc(X) = UxEXNC(X) is the set of all neighbors of the members of X . The rest of this short paper is organized as follows. In Section 2 we present the simple proof of Theorem 1.2, and in Section 3 the proof of the main result. Section 4 contains some concluding remarks and open problems.
11
High Degree Graphs Contain Large-Star Factors
2.
REGULAR GRAPHS
Proof of Theorem 1.2 . Let G = (V, E) be a d-regular graph. Put p = (2 + 210gd)jd and let C be a random set of vertices obtained by picking each vertex of G, randomly and independently, to be a member of C, with probability p. We will show that, with positive probability, some such set C will be a suitable choice for the set of centres of the stars in the desired star factor . For each vertex v E V, let Av be the event that either v has no neighbors in C or v has more than 3pd neighbors in C. By the standard known estimates for binomial distributions (c.f., e.g., [4] , Theorem A.1.12), the probability of each event A v is at most (1 - p)d + (e2j27)2+2 log d < e-P + (lje)2+2logd < Ijed 2. Moreover, each event A v is mutually independent of all events Au except those that satisfy NG(v) n NG(u) =1= 0. As there are at most d(d - 1) < d2 such vertices u we can apply the Lovasz Local Lemma (c.f., e.g., [4], Corollary 5.1.2) to conclude that with positive probability none of the events Av holds. Therefore, there is a choice of a set C C V so that for every vertex v, 0 < N G ( v) n C 3pd = 6 + 6 log d.
I
I : :;
Fix such a set C, and let B be the bipartite graph whose two classes of vertices are C and V \ C, where each v E C is adjacent in B to all vertices u E V \ C which are its neighbors in G. By the choice of C, for every vertex v E C, dB(V) ~ d - 6 - 610gd and for every vertex u E V \ c, o < dB(U) :::; 6 + 6 log d. It thus follows by Hall's theorem that one can assign to each vertex v E C a set consisting of
d - 6 - 610gd 6 + 6 log d
d 7 log d
-,-------:-:--~>--
of its neighbors in V\ C, where no member of V\ C is assigned to more than one such v. (To see this from the standard version of Hall's theorem, split each vertex v in C into (d - 6 - 6 log d)j (6 + 6 log d) identical 'sub-vertices', each with the same neighbours in V \ C as v, and find a matching that hits every sub-vertex using Hall's theorem . Then for each v E C, coalesce the subvertices of v back together to form v.) By assigning each unassigned vertex U of V \ C arbitrarily to one of its neighbors in C (note that there always is such a neighbor) we get the required star factor, in which the centers are precisely the members of C and each star contains more than dj(710gd) edges.
12
N. Alon and N. Wormald
It remains to show that the above estimate is optimal, up to a constant factor. Note that the centers of any star factor form a dominating set in the graph, and thus if the minimum size of a dominating set in a d-regular graph on n vertices is at least O(nlogdld), then the star factor must contain a component of size at most O(dl log d). It is not difficult to check that the minimum size of a dominating set in a random d-regular graph on n vertices is 8(n log did) with high probability. In fact, if c < 1, the expected number of dominating sets of size k = n ( c + o(1)) (log d)I d tends to 0 for d sufficiently large . We give some details of verifying this claim. One can use the standard pairing or configuration model of random d-regular graphs, in which there are n buckets with d points in each bucket. It is enough to prove the result for the multigraph arising from taking a random pairing of the points and regarding the buckets as vertices (see e.g. [12] for details) . The expected number of dominating sets S of size k with m edges from S to N(S) is '=
A.
(n) ( ) k f k, m
(mrr- l (kd _ .)) M(kd - m)M( (n - k)d - m) M (nd) i=O
1,
where f(k , m) is the coefficient of x m in ((1 + x)d -1) n-k and M(r) is the number of pairings or perfect matchings of an even number r of points, i.e. (r - 1) (r - 3) . .. 1. In the above formula, the binomial chooses the k buckets of S, f(k, m) is the number of ways to choose m points in the other n - k buckets such that at least one point comes from each bucket (so that S dominates the graph) , and the next factor counts the ways to pair those points with points in buckets in S . The other factors in the numerator count the ways to pair up the remaining points, first within S, and then within the rest of the graph. The denominator is the total number of pairings. We may use standard methods to see that f(k, m) ::; ((1 + x)d -1) n-k x - m for all real x > 0 (since I's coefficients are all nonnegative). We set x = kin and take k = nc(log d)I d, which is justified by regarding c as a function of n that tends to a limit equal to the value c referred to in the claim above. This gives
A < (n) ((1 kl)d _ 1) n-k (~)m (kd)! + n k (kd - m)! - k M(kd - m)M( (n - k)d - m) M(nd)
13
High Degree Graphs Contain Large-Star Factors
Considering replacing m by m + 2 shows this expression is maximised when n 2(kd - m) ~ k 2( (n - k)d - m) and certainly only when kd - m rv n ( (clog d)21d). In fact, kd - m = 0 (n(log2 d)1d) is sufficient for our purposes. Fixing such a value of m, using n! = (nletnO(l) and M(r) = 8( (rler/ 2 ) , and noting that
(~) = exp (0 (n(log2 d)1d)) , d- c + O( d- llog2 d)),
(1 + kln)d - 1 = dC (1
-
(~)m =
(fr (fr exp(O(n(log
(f)-(kd-m)
d
d
=
3d)ld)),
((kd - m)le) kd-m = n kd- m exp (O( n(log3 d)ld)), ((n - k)d -
m) ((n-k)d-m)/2
= (nd - 2kd + (kd _ m)) ((n-k)d-m)/2
<":::
2k = (nd) ((n-k)d-m)/2 1 __
+k_m
n
2n
(
= (nd)((n-k)d-m)/2 exp ( - dk + o( n(log2 d)ld)) we find everything in the upper bound for A cancels except for
Since dC = ekd/n and the power of d is absorbed in the error term, this equals n 0(1) ( 1 - d- C + 0 (d- l log3 d) which, if c < 1, tends to 0 for large d as required. On the other hand, for c > 1 and large d, nc(log d)1d is an upper bound on the minimum dominating set size in all d-regular graphs [4, Theorem 2.2].
r,
An explicit example can be given as well: if d = (p - 1)12 with p being a prime, consider the bipartite graph H with two classes of vertices Al = A2 = Zp in which aibj forms an edge iff (ai - bj) is a quadratic nonresidue. A simple consequence of Weil's Theorem (see, e.g., [2], Section 4) implies that for every set S of at most, say, ! log2 p elements of Zp, there are more than JP members z of Zp so that (z - s) is a quadratic residue for all s E S. This implies that any dominating set of H must contain either more than! log2P vertices of A 2 or at least JP vertices of AI, and is thus of
14
N. Alon and N. Wormald
size bigger than ~ log2 p. (This can in fact be improved to (1- 0(1)) log2 p, but as we are not interested in optimizing the absolute constants here and in the rest of the paper, we omit the proof of this stronger statement). For degrees d that are not of the form (p - 1)/2 for a prime p one can take any spanning d-regular subgraph of the graph above with the smallest p for which (p - 1)/2 ~ d. Such a subgraph exists by Hall's theorem, and any dominating set in it is also dominating in the original (p -1)/2-regular graph , hence it is of size at least ~ log2 p. By the known results about the distribution of primes this prime p is (2+0(1)) d, and we thus get ad-regular graph on at most n = (4 + o(1)) d vertices in which every dominating set is of size greater than ~ log2 p > ~ log2 d ~ n(n(log d)/ d) . This completes the proof. _
3.
THE PROOF OF THE MAIN RESULT
In this section we prove Theorem 1.1. The idea of the proof is based on that of Theorem 1.2. Given a graph G = (V, E) with minimum degree d, we wish to define a dominating set C C V whose members will form the centers of the star factor , and then to assign many leaves to each of them. The trouble is that here we cannot pick the set of centers randomly, as our graph may contain a large set R of vertices of degree d whose total number of neighbors is much smaller than IRI, and then the number of centers in R is limited. This may happen if some or all of the neighbors of the vertices in R have degrees which are much higher than d. Thus, for example, if our graph is a complete bipartite graph with classes of vertices Rand U, with IRI = n - d and lUI = d « n - d, it is better not to choose any centers in R. In fact, it seems reasonable in the general case to force all vertices of degree much higher than d to be centers, and indeed this is the way the proof starts. However, if we then have a vertex all (or almost all) of whose neighbors have already been declared to be centers, then this vertex cannot be a center itself, and will have to be a leaf. Similarly, if almost all neighbors of a vertex are already declared to be leaves, then this vertex will have to become a center. The proof thus proceeds by declaring, iteratively, some vertices to be centers and other vertices to be leaves. At the end, if there are any vertices left, we choose a small subset of them randomly to be additional centers .
15
High Degree Graphs Contain Large-Star Factors
The Local Lemma has to be applied to maintain the desired properties that will enable us to apply Hall's theorem at the end to a bipartite graph, defined in a way similar to that in the proof of Theorem 1.2. An additional complication arises from the fact that we have to assign time labels to vertices and use them in the definition of the bipartite graph. We proceed with the detailed proof.
Proof of Theorem 1.1. Let G = (V, E) be a graph with minimum degree d. We first modify G by omitting any edge whose two endpoints are of degree strictly greater than d, as long as there is such an edge. We thus may and will assume, without loss of generality, that every edge has at least one endpoint of degree exactly d. Put h = lod4 / 3/(log d)I/3, and let H (for High) denote the set of all vertices of degree at least h. Since each of their neighbors is of degree precisely d, we can apply Hall's theorem and assign a set of h/d neighbors to each of them, so that no vertex is assigned twice. Let S' denote the set of all the !H!· l~dl/3 /(log d)I/3 assigned vertices, and let S (for Special) be a random subset of S' obtained by choosing each member of S' to be in S randomly and independently with probability 1/2. Claim 3.1. In the random choice of S , with positive probability the following conditions hold: (i) For each v E H , Nc(v) n > lsd1/3/(logd)I/3.
I
(ii) For each v
E
SI
V \ H, 1 NG(v) \
SI
~ d/3.
Proof. For each vertex v E H let A v be the event that condition (i) is violated for v. Similarly, for each vertex v E V \ H let B; be the event that condition (ii) is violated for v. By the standard known estimates for binomial distributions, the probability of each event A v is exp ( - n( d1/ 3/(log d)I/3)) and that of each event B; is e-O(d). In addition, each event A v is independent of all other events except for the events B u for vertices u that have a neighbor among the lod1/ 3 / (log d) 1/3 vertices of S' assigned to v (note that there are less than d4 / 3 such vertices u). The same reasoning shows that each event B; is mutually independent of all other events Au, B w with the exception of at most hd < d3 events. The desired result thus follows from the Local Lemma (with a lot of room to spare). This completes the proof of the claim. Fix an S satisfying the assertion of the claim, and define G' = G - S = (V' , E'). Note that by the above claim, part (ii),
(1)
for each v E V(G') = V \
s,
I NG'(v) 1
~ d/3.
16
N. Alan and N. Wormald
Note also that by part (i) of the claim, each vertex v E H has a set of at least 215 d1/ 3 / (log d)113 vertices from S assigned to it , and can thus serve as a center of a star of at least that size. We now construct two sets of vertices 0, LeV \ S. The set 0 will consist of vertices that are declared to be centers, and will serve as centers of stars in our final star factor . The set L will consist of vertices that are declared to be leaves in the final factor. Note that the vertices in S will not form part of these sets; they will also be leaves in the final star factor, and their associated centers will be the vertices in H to which they have been assigned, but since we have already specified their centers we do not need to consider them any more. Initially, define C = Hand L = 0. We will also need a time label t( v) which will be defined in the following for each vertex in V \ (H US) ; in the beginning set t = O. Put V' = V(G') = V\S and define D = d2/ 3(logd)1 / 3 . Now repeatedly apply the following two rules to define additional centers and leaves, and assign them time labels.
I
• (a) If there is a vertex v E V' \ (0 U L) such that NG/(v) \ 01 :s; D, add v to L, increase t by 1, and define t(v) = t.
I
• (b) If there is a vertex v E V' \ (0 U L) such that NG/(v) \ LI :s; d/6, add v to C, increase t by 1, and define t(v) = t. The process continues by repeatedly applying rules (a) and (b) in any order until there are no vertices left in V' \ (0 U L) that satisfy the conditions in rule (a) or in rule (b). Let to denote the value of the time parameter t at this point . Actually, since Land C will be disjoint, by (1) no vertex will satisfy the conditions in both rules simultaneously. Let F (for Free) denote the set of all vertices in V' \ (C U L) remaining once the process terminates. Define p = 20(log d)/ d, and let T be a random subset of F obtained by picking each vertex v E F, randomly and independently, to be in T with probability p. Assign the vertices of F \ T the time labels to + 1, to + 2, . . . , to + IF \ TI in any order. Finally, assign the vertices of T the time labels to + IF \ TI + 1, to + IF \ TI + 2, ... , to + IFI. In our final star factor, the vertices HUOUT will serve as centers, while the remaining vertices, that is, those in S U L U (F \ T), will serve as leaves. In order to show that it is possible to define large stars with these centers and leaves, we need the following.
High Degree Graphs Contain Large-Star Factors
17
Claim 3.2. With positive probability, every vertex of F has at least one neighbor in CUT, and no vertex v E V' - H has more than 2ph = 4d1/3(log d)2/3 neighbors in T. Proof. For each vertex v E F that does not have any neighbor in C, let A v be the event that it has no neighbor in T. Note that as v E F, the definition of rule (b) implies that Nc'{v) \ LI > d/6 , and as it has no neighbor in C, it has more than d/6 neighbors in F. Therefore, the probability that none of these neighbors is in T is at most (1 - p)d/6 < d- 3. For each vertex v E V' \ H, let B; be the event that v has more than 2ph neighbors in T. Since the degree of v in G' is at most h, its number of neighbors in F is certainly at most h, and hence the standard estimates for binomial distributions imply that the probability of each event B; is at most e-O(ph) which is much smaller than, say, d- 3 .
I
Note that each event A v is mutually independent of all other events Au or B w apart from those corresponding to vertices U or w that have a common neighbor with v in F , and the number of such vertices u, w is smaller than hd < d7 / 3. Similarly, each of the events B; is independent of all others but at most hd < d7 / 3. The claim thus follows from the Local Lemma. Returning to the proof of the theorem, fix a choice of F satisfying the assumptions in the last claim. Let B be the bipartite graph with classes of vertices (C \ H) U T and L U (F \ T), in which each v E (C \ H) U T is adjacent to any of its neighbors u that lies in L U (F \ T) and satisfies t{u) < t(v). Note that, crucially, prospective centers are connected in B only to prospective leaves with smaller time labels. Our objective is to show, using Hall's theorem, that we can assign to each vertex v in (C \ H) U T some O{d1/ 3 /(log d)1/3) neighbors of v (in B, and hence also in G') from LU{F\T) , such that each vertex in LU{F\T) is assigned at most once. To do so, we first establish several simple properties of the bipartite graph B that follow from its construction. Claim 3.3. The following properties hold.
INB(U) n (O \ H) I : :; D = d2/3{10g d)1/3. (ii) For each vertex u E L, INB{u) n TI :::; 4d1/3{logd)2/3. (iii) For each vertex u E F \ T, INB{U) I = INB{U) n TI :::; 4d1/3{10gd)2/3. (i) For each vertex u E L,
(iv) For each vertex v E 0 \ H , dB{v) 2: d/6.
(v) For each vertex vET, INB{V)! 2: D - 4d1/3{logd)2/3 > D/2 = !d2/3{logd) 1/3 .
18
N. Alon and N. Wormald
Proof. (i) By the definition of rule (a), each u E L can have at most D neighbors with time labels exceeding t(u) , and therefore can have at most that many neighbors in B .
(ii) This follows immediately from the condition in Claim 3.2 that F was chosen to satisfy. (iii) By the definition of the graph B, the vertices in F \ T are joined in B only to vertices of T , as these are the only vertices with bigger time labels. Therefore, 1 NB(U) I = I NB(u) n TI for each u E F \ T, and the claimed upper estimate for this cardinality follows from Claim 3.2. (iv) By the definition of rule (b), each vertex v E C \ H satisfied ING'(v) \ at the point of being added to C. Since by (1), 1NG,(v)1 ~ d/3, it follows that at that time , v had at least d/3 - d/6 = d/6 neighbors in L. As all these leaves have smaller time labels than v, it is joined in B to all of them.
£1 :::; d/6
I
(v) If vET, then v E F, and thus, by the definition of rule (a), NG'(v) \ > D. Vertices in T are given the largest time labels , so in the graph B, v is joined to all members of N G/ ( v) \ 0 except for those that lie in T. However, by the condition in Claim 3.2, at most 4d1/ 3(logd)2/3 of these vertices are members of T, implying the desired estimate. This completes the proof of th e claim.
CI
Corollary 3.1. For each subset X d1/ 3 / (log d) 1/3 .
c
(0 \ H) U T, INB(X)I
> IXI·
l6
Proof. If at least half the elements of X belong to C \ H, then, by Claim 3.3(iv), the total number of edges of B incident with them is at least ~IXI . id. By the first observation in the proof of part (iii) of the claim , these edges are not incident in B with any member of F \ T. By part (i) of the claim, at most D = d2/ 3(log d)1 /3 of these edges are incident with any one vert ex in L. Thus, in this case, IN(X)I ~ ~IX I' id.1/D = IXI ·l d1/ 3/ (log d)1/3, providing the required estimate. 6
Otherwise, at least half of the vertices of X lie in T . By Claim 3.3, part (v), the total number of edges of B incident with them is greater than ~ IXI ·~D. By parts (ii) and (iii) of the claim, each neighbor of these vertices in LU(F\T) is incident with at most 4d1/ 3(logd)2/3 of these edges, implying
19
High Degree Graphs Contain Large-Star Factors
that in this case
N (X ) I >1!lD
I
-
2
1 2 4d1/3(log d)2/3
d 1/ 3
16(logd)1/3
IX1.
This completes the proof of the corollary. By the last Corollary and Hall's theorem, one can assign a set of d1/ 3 / (log d)1/3 members of L U (F \ T) to any element of (C \ H) U T, so that no member of L U (F \ T) is assigned more than once. This makes all elements of (C \ H) U T centers of large vertex disjoint stars. Adding to these stars the stars whose centers are the elements of H and whose leaves are those of 5, we may apply Claim 3.2 to conclude that if there are any unassigned vertices left in L we can connect each of them to one of the existing centers. Similarly, (1) and the definition of rule (a) do the same job for unassigned vertices in F \ T. Thus, we get a star factor in which each star has at least 215 d1/ 3 / (log d) 1/3 leaves. This completes the proof. •
l6
4.
CONCLUDING REMARKS AND OPEN PROBLEMS
We have shown that for every positive integer 9 there is an integer d so that any graph with minimum degree at least d contains a star factor in which every component has at least 9 edges. Let d(g) denote the minimum number d for which this holds. Our main result shows that d(g) O(g3log g), while the construction described in the proof of Theorem 1.2 implies that d(g) 2: n(g log g). It seems plausible to conjecture that d(g) = 8(g log g), but this remains open. It will be interesting to determine d(g) precisely (or estimate it more accurately) for small values of g, like 9 = 2 or 3. Our proof, even if we try to optimize the constants in it, will yield only some crude upper bounds that are certainly far from being tight. It is worth noting, however, that even for showing that d(2) is finite, we do not know any proof simpler than the one given here for the general case. On the other hand, a random 3-regular graph contains a Hamilton cycle with probability tending to 1. Hence, if it has number of vertices divisible by 3, it contains a spanning factor of stars of two edges each. Similarly, a random 4-regular graph having number of vertices divisible by 4 contains a spanning factor
:s
of stars of three edges each with probability tending to 1 [5]. Immediately
20
N. Alon and N. Wormald
from contiguity results discussed in [12], the same statements are true if we change 4-regular to d-regular for any d ~ 4. Our proof, together with the algorithmic version of the local lemma proved by Beck in [6] (see also [1]) , and any efficient algorithm for bipartite matching, show that the proof here can be converted to a deterministic, polynomial time algorithm that finds, in any given input graph with minimum degree at least d, a star factor in which every star is of size at least n( (d/logd)1 /3). We omit the details. There are several known results that show that any connected graph with large minimum degree contains a spanning tree with many leaves, see [11], [8], [7]. In particular, it is known (and not difficult) that any connected graph with minimum degree d and n vertices contains a spanning tree with at least n - 0 ( n(log d)/ d) leaves. A related question to the one considered here is whether it is true that any connected graph with large minimum degree contains a spanning tree in which all non-leaf vertices have large degrees. Specifically, is there an absolute positive constant c so that any connected graph with minimum degree at least d contains a spanning tree in which the degree of any non-leaf is at least cd/ log d? Another intriguing question is the following possible extension of the main result here. Is it true that the edges of any graph G with minimum degree d can be partitioned into pairwise disjoint sets, so that each set forms a spanning star forest of G in which every component is of size at least h(d), where h(d) tends to infinity with d? A related result is proved in [3], but the proof of the last statement, if true, seems to require additional ideas.
REFERENCES
[1]
N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2 (1991), 367-378.
[2J
N. Alon, Tools from higher algebra, in: Handbook of Combinatorics (R. L. Graham, M. Grotschel and L. Lovasz, eds) , North Holland (1995), Chapter 32, pp. 17491783.
[3]
N. Alon, C. McDiarmid and B. Reed, Star arboricity, Combinatorica , 12 (1992), 375-380.
[4J
N. Alon and J. H. Spencer , The Probabilisti c Method, Third Edition, Wiley (New York, 2008).
[5J H. Assiyatun and N. Wormald, 3-star factors in random regular graphs , Europ. J. Combinato rics, 27 (2006), 1249-1262.
21
High Degree Graphs Contain Large-Star Factors
[6]
J. Beck, An algorithmic approach to the Lovasz Local Lemma, Random Stru ctures and Algorithms, 2 (1991),343-365 .
[7J Y. Caro , D. B. West and R. Yuster, Connected domination and spanning trees with many leaves, SIAM J. Discrete Math., 13 (2000), 202-211. [8J J . R. Griggs and M. Wu, Spanning tre es in graphs of minimum degree four or five, Discrete Mathematics, 104 (1992), 167-183 . [9]
F. Havet, M. Klazar, J. Kratochvil , D. Kratsch and M. Liedloff, Exact algorithms for L(2, I)-labelling, Algorithmica, to appear.
[10]
J . Kratochvil, An open problem presented in "Building Bridges" , Budapest, 2008.
[11] D. J. Kleitman and D. B. West, Spanning trees with many leaves, SIAM Journal on Discrete Mathematics, 4 (1991), 99-106 . [12]
N. C. Wormald, Models of random regular graphs, in: Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series 267 (J. D. Lamb and D. A. Preece, eds), Cambridge University Press (Cambridge, 1999), pp . 239-298 .
Noga Alon
Nicholas Wormald
Tel Aviv University Tel Aviv 69978 Israel and lAS, Princeton, NJ 08540, USA
Department of Combinatorics and Optimization University of Waterloo Waterloo ON Canada
e-mail:
nogaa~tau.ac.il
e-mail:
nwormald~waterloo.ca
BOlYAI SOCIETY MATHEMATICAL STUDIES, 20
Fete of Combinatorics, pp . 23-42.
ITERATED TRIANGLE PARTITIONS
STEVE BUTLER* and RON GRAHAM
For a given triangle there are many points associated with the triangle that lie in its interior; examples include the incenter (which can be found by the intersection of the angle bisectors) and the centroid (which can be found by the intersection of the medians) . Using this point one can naturally subdivide the triangle into eit her three or six "daughter" triangles. We can then repeat the same process on each of the daughters and so on and so on. A natural question is after some large number of steps what does a typical nth generation daughter look like (up to similarity)? In this pap er we look at this problem for both the incenter and the centroid and show that they have very distinct behavior as n gets large . We will also consider the Gergonne point and the Lemoine point.
1.
INTRODUCTION
In this paper we will be considering triangles and are concerned only with the shape, i.e., up to similarity. So we can denote a triangle T by the triple T(A, B, C) where A, Band C are the interior angles. Given a point P in the interior of T we can use the point to subdivide T into smaller "daughter" triangles. This is done by taking each vertex and drawing the line passing through P and connecting it to the opposite side (sometimes referred to as Cevians), subdividing the triangle into six daughters (Figure la); or by taking each vertex and drawing the line to P subdividing into three daughters (Figure 1b). We are interested in the case when P is a well-defined point lying in the interior of T for any non-degenerate T . Examples of such points include the "This work was partially done with support of an NSF Mathematical Sciences Postdoctoral Fellowship.
24
S. Butler and R. Graham
(a) Six daughters
(b) Three daughters
Fig. 1. Given an interior point P how to subdivide the triangle
incenter (which is the intersection of the angle bisectors of T), the centroid (which is the intersection of the medians of T), along with many others. A rather complete listing of well known distinguished points associated with triangles is maintained at the Encyclopedia of Triangle Centers [9] (however not all of these points will always lie in the interior of T, the excenter being one such example) .
Once we have settled on a way of choosing P, we can iterate the process of subdivision, say for n times, producing 6n (or 3n ) nth generation daughters from our original triangle T. We are interested in what can be said about an nth generation daughter of T as n goes to infinity. For example, what is the distribution of the shape of the daughters? What is the distribution of the smallest angle (or second smallest angle) of T? It will turn out that the answers to these questions depend in a crucial (and currently not well understood) way on exactly how P is chosen. In the following sections, we will specify various choices for P and address these questions and show that well known points P can produce dramatically different results as n goes to infinity. To help us answer these questions we first will need a convenient way of describing the triangles. Each triangle T(A, B, C) corresponds to a point (A, B, C) E ]E3 which will lie in the intersection of the plane x + y + Z = 1f with the positive orthant (see Figure 2). We will denote this intersection, which is actually an equilateral triangle, by P (this representation has been used before in the analysis of pedal triangles; see [1, 10, 11]).
2. SUBDIVIDING BY BISECTORS One of the easiest points P to work with is the incenter which is formed by using the angle bisectors. What is nice about this point is that the angles in
25
Iterated Triangle Partitions
(0. IT . 0)
Fig. 2. Representing triangles as points in lE3
the daughter triangles are linear combinations of the angles in the original triangle. So the angles of the daughter triangle can be formed via matrix multiplication. This transforms the problem into a Markov process using matrices which has been extensively studied (see the survey [6] for more information). We will consider both possibilities of subdivision shown in Figure 1.
2.1. Subdividing into three daughters If we associate the triangle T( A, B, C) with the vector t = (A, B, C) * in ]E3, then the three daughters of T can be found by Mit where i E {1, 2, 3} and
1/ 2
M1
0 0)
= 1/2 1 1/2 , (
o
0 1/2
M2
1 1/2 1/2)
= 0 1/2 (o
0
0
1/2
,
M3
=
1/ 2 (
0
0
1/2
0)
0 .
1/2 1/2 1
The nth generation daughters of T can then be found by Mil M i2 .. . Mint where each ij E {1,2,3}. Starting with the triangle T(1r/9, 21r/9 , 21r/3) we have plotted the nth generation daughters for n = 2,4,6 ,8 in Figure 3. The figures are very suggestive about what is happening. To see why we are getting the Sierpinski triangle it helps to see how the image of M, maps P to P . This is shown in Figure 4. So we have that there will be exactly one daughter in each of the subtriangles indicated in Figure 5a. Similarly, if we look at the location of the second generation daughters there will be one daughter in each of the nine triangles indicated in Figure 5b, and if we look at the location of the third generation daughters there will be one daughter in each of the twenty seven triangles indicated in Figure 5c. Since this process mirrors that
s.
26
(a) n
(b) n
= 2
=4
Butler and R. Graham
(c) n = 6
(d) n
=8
Fig . 3. The nth generation daughters for angle bisectors with three daughters at each
generation
Fig .
4. The image of P under the three maps
M,
used to form the Sierpinski triangle, as n goes to infinity the distribution of daughters are the points in the Sierpinski triangle.
(a) First generation
(b) Second generation
(c) Third generation
Fig. 5. Location of the descendants in the first three generations
2.2. Dividing into six triangles As before if we associate a triangle T(A, B, C) with the vector t = (A, B, C)* in ]E3, then the six daughters of T can be found by Mit where i E {I, 2, 3, 4, 5, 6} and
M1 =
1/ 2
0
0)
1/2 1/2 0 , 1/2 1
( o
1/2 M2 =
0
( 1/2
o 1/2) 1/2 o , 1/2
1/2
27
Iterat ed Triangle Partitions
1 1/2
M4 =
0 1/2 ( o 0
0)
1/2 , 1/2
M5 =
1/ 2 0 1/2) 1/2 1 0 , ( o 0 1/2
M6 =
1/ 2 0 0 1 ( 1/2 0
And as before we can form the nth generation daughters by looking at all 6n possible products of the form M il M i2 ... M in t with each ij E {l , 2, 3, 4, 5, 6}. Starting with the equilateral triangle T 1 = T(7r /3, 7r /3, 7r /3) we have plotted the nth generation daughters for n = 1,3 ,5 in Figure 6.
... ... .
(a) n
=1
.. .......
(b) n
=3
(c) n
=5
Fig. 6. The nth generation daughters for angle bisectors with six daughters at each generation
Looking at Figure 6c we see that the daughters seem to fill in Prather uniformly. A patient count though will reveal that there are far fewer than 65 triangles in Figure 6c. It is not hard to see that an nth generation daughter of the equilateral triangle must have the form T( Ul7r /2 n , U27r /2 n , U37r/2 n ) for positive integers Ul , U2 , U3 with Ul + U2 + U3 = 2n . In particular there are at most (2;) possible different daughter triangles among the 6n which will be generated. So on average each triangle is being hit approximately 2(3/2t times. In particular, any triangle which is not being hit must be missed for a good reason. It is not too hard to see that one condition that is needed is for gcd(Ul,U2,U3) = 1, which rules out a positive fraction of the daughters but does not still explain all of the missing daughters. If we start with a triangle which does not have rational multiples of 7r then we do not have as many triangles stacking up on top of each other. As an example , the fifth generation daughters of T2 = T( 7r /3, V27r /3,
( 2 - V2) 7r /3) are shown in Figure 7 (this should be compared to Figure 6c). One problem that we run into is that the triangles can be fairly densely packed in these pictures. So instead of plotting the individual triangles it is better to look at a histogram. We will divide P into a large number of small
28
S. Butler and R. Graham
Fig . 7. The fifth generation daughters for angle bisectors starting with an "irrational"
triangle
regions and then shade each region according to the number of triangles that fall into that region, the darker a region is the more triangles fall into that region. We have plotted histograms for Tl and T2 in Figure 8 (these should be compared with Figures 6c and 7). The situation is obviously much richer than the previous case when we looked at three daughters. The reason for this is previously the image of each one of the M, was disjoint, but this is no longer the case. If we plot the images of the six maps we get Figure 9, in particular there is a lot of overlap between pairs of maps. However, we still have one nice feature of these maps . Namely, they are contracting. To see this we note that we can put Pinto ]E2 by putting T(A,B,C) at ((A + 2B)jV3,A) . We then can put the first generation daughter T(Aj2,(A+B)j2,(B+2C)j2) at ((3A+2B)j(2V3),A/2). If we now compare the distance between triangles T(A, B, C) and T(A' , B' , C') and their daughters, a calculation shows
~ ((A + 2B
_ A'
_ ((3A
+ 2B
4
V3
2V3
+ 2B')2 + (A _
V3
_ 3A'
A')2)
+ 2B')2 + (A
2V3
2
_ A')2) =
2
~(B _ B,)2 > O. 3
-
It follows that for the euclidean distance d we have
d(T( A/2, (A
+ B)/2, (B + 2C)/2) , T( A' /2, (A' + B')/2, (B' + 2C')/2)) :::;
~ d(T(A, B, C), T(A', B' , C')) .
29
Iterated Triangle Partitions
(a) Triangle T1 ; n
=5
(b) Triangle T2 ; n
=5
(c) Triangle T1 ; n
= 12
(d) Triangle T2 ; n
= 12
Fig. 8. Histograms for the distribution of triangles in P under bisector division
Fig. 9. The image of P under th e six maps M,
By symmetry, the same statement holds for all the daughter triangle maps. Since these maps are contracting with Lipschitz constant ..;3/2 then it follows (see [6]) that there is a fixed stationary distribution on P that the process converges to . Further it converges exponentially. Hence Figures 8c and 8d are nearly identical, and these are approximations for the histogram of the limiting distribution.
30
S. Butler and R. Graham
2.2.1. The smallest angle. We now consider the problem of analyzing the distributions of the smallest angles. Just as we have a quick rate of convergence to the stationary distribution in P: we experimentally see a quick convergence to the same distribution of minimal angles. In Figure 10 we split the interval between a and 1r/3 into 1000 intervals and took 50, 000, 000 random walks of length 50 in this Markov process and recorded the minimum angle.
Fig . 10. The distribution of th e smallest angle using bisectors
A few things certainly stand out . Perhaps the simplest thing to observe is that the minimum angles are not concentr ated near 0, so that the nth generation daughters are not becoming "flat" . There also is a certain amount of self-similarity (but given the distributions we saw in Figure 8cd this should not be surprising). We also have marked a few of the values between a and tt /3 in Figure 10. In particular we see that a few of the "valleys" are located at 1r/16,1r/8, 31r/16, 1r/4 and a few of the peaks are located at tt /10, 31r/20, 71r/ 40, 1r/5. The tallest peak is located at 1r/5. If we look closely at the histograms in Figure 8cd we see that the darkest region is located at T(1r/5,1r/5, 21r/5). This particular triangle has the following unique property; T( 1r/5, 21r/5, 21r/5) is the only triangle where two of its daughters are similar to itself (this is shown as the shaded triangles in Figure 11). In terms of the M, this means that some permutation of the vector t = (1r/5, 21r/5 , 21r/5)* is an eigenvector associated with eigenvalue 1 for two of the Mi. The only other nondegenerate triangle that also acts as an eigenvector is T(21r /9, tt /3, 41r/9) which has one of its daughters similar to itself. Figure 10 was computed using random walks and so the distribution is at best approximate. It is not too difficult to find upper and lower bounds for the distribution (though in practice the amount of computation needed
31
Iterated Triangle Partitions
Fig. 11. The decomposition of T(1r/5, 21r/ 5, 21r/ 5)
to compute these bounds to an accuracy to be able to produce Figure 10 is prohibitive) . The basic idea is to note for a fixed k that Mil ... M ik maps P into a smaller triangular region of P , let us denote this by Q. SO in particular we have that Mil ' " MikMik+l ... Min t must lie in Q as well for any choice of initial t and any choice of the ik+l,"" in . In essence if we know what the last k steps of this Markov process are then we have a lot of information about where in P we end up (the higher the value of k the more precisely we can approximate the point). With this in mind the procedure is to fix a value of k and then look at the image of P under each of the 6k possible combinations of Mil " ·Mik . Now divide the interval between 0 and 1f/3 in some fashion. For each interval a lower bound for the distribution is found by counting the number of images Q which must have smallest angle in that interval divided by 6k ; an upper bound is found by counting the number of images of Q which can have some smallest angle in the interval divided by 6k . An example of the resulting bounds on the distribution is shown for k = 15 and the interval split into widths of tt /256 in Figure 12.
.
:I
Fig. 12. Upper (black) and lower (red) bounds for the true distribution of smallest angle
The precise location of the peaks and valleys is in general not well understood. For comparison we also include the distribution of the middle
32
S. Butler and R. Graham
and largest angles Figure 10.
III
Figures 13 and 14 computed in the same way as 1T
o
"2
Fig. 13. The distribution of the middle angle using bisectors
Fig. 14. The distribution of the largest angle using bisectors
3.
SUBDIVIDING BY MEDIANS
We now consider the subdivision using the centroid, or median point of the triangle. We will restrict our attention to the case of six daughters. This case has been well studied because of its close relationship to barycentric subdivision. We will see that this situation is quite different from the case of the incenter. One major difference is that the median map is not contracting on P as we saw previously. In Figure 15 we indicate how one of the median daughters maps P to itself (the other five are similar and differ by rotation and reflections). To get some intuition about what is happening in this case let us consider the histogram for T( 7f /3, 7f /3, 7f /3) for n = 4,6,8,10 shown in Figure 16.
33
Iterated Triangle Partitions
Fig . 15. A subdivision of P and its image under th e median map
(a) n
=4
(b) n
=6
(c) n
=8
(d) n
= 10
Fig . 16. The nth generation daughters for medians with six daughters at each generation
Looking at these pictures what seems to be happening is that the triangles in P tend to go towards the vertices as n increases. Or in other words, the triangles are becoming "flat" , or nearly colinear, as n gets large. This behavior was noted by David Blackwell and was passed on to us by Persi Diaconis [5] , independently Barany et al. [2, 15], inspired by a question of Stakhovskii about the distribution of shapes of triangles, showed that most triangles are flat.
3.1. Analytic approach
Blackwell started by putting a triangle in a standard position by putting the longest side along the x-axis with vertices at (0,0) and (1,0), the third vertex is then put with y > 0 and x ~ 1/2. Given a triangle T in standard position we now define the pseudo-fatness of T, denoted PF(T), by PF(T) = JY(3 - x) . It should be noted that for a triangle in standard position that y /2 is the area of the triangle, so the term JY relates to the area. The term (3 - x) acts as an error correction term. If T 1 , . .. , T6 are the six daughter triangles of T then Blackwell noted that if the average of the pseudo-fatness of the daughters was small compared to
34
S. Butler and R. Graham
the pseudo-fatness of T for each triangle T, i.e.,
~ LPF(Td ::; cPF(T) t:
for all T and some c < 1, then most ofthe triangles will have pseudo-fatness going to zero. In particular, most of the triangles would be flat. Computation using Maple confirms this assertion for the value c = 0.99 as we show in Figure 17. From this, for example, it would follow that the number of nth generation daughters with smallest angle greater than 0.99n radians is at most 5.9n . However, at present no one has confirmed analytically that the above inequality is valid with this value of c. Also it would be interesting to find the best pseudo-fatness function.
0.0
0.1
0.4
0 .6
0.3
1.0
0 .9
0.1
0.7
0 .6
OS
Y
Fig . 17. Average of the pseudo-fatness of daughter triangles, seen from the side
There are weaknesses in this approach . Namely, while we can show that the smallest angle is small, this does not automatically imply that the largest angle is large (~ 1r) . Or put another way, this approach shows that the triangles drift to the edges of P but not necessarily to the vertices of P. Robert Hough [8J using a different technique was able to show that the largest angle does in fact approach 1r and moreover gave asymptotic bounds for the proportion of triangles with angles near 1r, this shows that the triangles do accumulate at the vertices of P.
35
Iterated Triangle Partitions
3.2. Hyperbolic approach The method of Barany et al. was to move the problem from P to the hyperbolic half plane. The following approach is similar to theirs and was discovered independently by Curt McMullen [14]. The first step is to associate with each triangle T (up to) six points z in the hyperbolic upper half plane lHI as shown in Figure 18. Namely, some edge of T is located with vertices at z = 0 and z = 1 and the third vertex is located at the complex coordinate z with positive imaginary part. McMullen then observes that reflecting z across the three circles R(z) = ~' [z] = 1, and [z - 11 = 1 induces a natural action of 8 3 on lHI in which all six orientations of T occur.
R(z) = &
[z] = 1
Fig . 18. Triangles as points in the hyperbolic plane
Now, the centroid point of a triangle in this position is represented by the point (z + 1)/3, and so one of the corresponding daughters becomes 2(z + 1)/3 when normalized. The group of automorphisms of !HI generated by the map B(z) = 2(z + 1)/3 and 83 is dense in Aut(lHI) (see [2]). From this, using results of Furstenberg [7] , it follows that almost all random walks formed from products of B(z) and elements of 8 3 tend to infinity (in the hyperbolic plane) as the length of the product increases. This then implies that almost all of the nth generation daughters have smallest angle tending to 0 as n increases. Actually more can be said in that these points are dense in the hyperbolic space and so every triangle is arbitrarily "close" so some descendant of the starting triangle.
36 4.
S. Butler and R. Graham SUBDIVIDING BY THE GERGONNE POINT
We again restrict ourselves to the case of six daughters. The Gergonne point of a triangle is the point of concurrence of the three line segments joining each vertex of the triangle to the point of tangency of the inscribed circle to the side opposite the vertex. We show an example of this in Figure 19. (As a side note the example shown is the only triangle (up to similarity) with the equilateral triangle as one of the daughters; its side lengths are proportional to 19, 40 and 49, see [4] .)
Fig. 19. A triangle and its Gergonne point G
In Figure 20 we look at how one of the Gergonne daughters maps P to itself. It is interesting to note that unlike the medians or angle bisectors this map is not 1-to-l. That is, there is a small region which gets mapped 2-to-l.
Fig . 20. A subdivision of P and its image under the Gergonne map
Looking at Figure 20 it also looks like the map might be contracting
(this would then imply a limiting distribution). However this is not the case. For instance if we consider the following two triangles in the corner T 1 (170°,5°,5°) and T 2(160°, 10°,10°) then two of their corresponding
37
Iterated Triangle Partitions
daughters are respectively DT1 (170.0377.. .° ,9 .9245...° ,0.0377 ... 0) and DT2(160.2935 . .. 0 ,19.4129 ...°,0.2935 ... 0). SO IIDT1 - DT211/IITl - T211 = 1.1106... showing that there is a slight expansion in the corner. This does not rule out a limiting distribution (and the authors do believe that a limiting distribution exists) it only shows that more sophisticated techniques will be needed. In Figure 21a we have drawn the histogram for the tenth generation daughters (higher generation daughters seem to have a similar structure) . There appears to be a fair amount of white, this is caused not by there being very few triangles in the region, but no triangles in the region. In Figure 21b we have darkened the histogram by making any region with a daughter black and any region without a daughter white. As the figure indicates there seems to be large regions with missing daughters. It would be interesting to know what triangles are possible for the nth generation (this is not even known precisely for the first generation) .
(a) Histogram
(b) Darkened
Fig . 21. The tenth generation daughters for the Gergonne point with six daughters at
each generation
In Figure 22 we indicate the distributions for the middle and largest angles using the Gergonne point divison. Looking at the distributions it seems that the middle angle is concentrated around 1r /3 while the largest angle has some approximate symmetry around 1r /2 . For the largest angle what appears to be happening is that for "most" triangles when using the Gergonne point the largest angles of the daughters are located at the vertex along the edge of the parent triangle. So by pairing up adjacent daughters along the edge their two largest angles should be symmetric around rr/2.
38
S. Butler and R. Graham
" 3"
o
l . . - - -_
_
7T
"2
7T
"2
J ~----...J
(a) Middle angle
(b) Largest angle
Fig . 22. The distribution of angles using the Gergonne point
5.
SUBDIVIDING BY THE LEMOINE POINT
The Lemoine point of a triangle is the intersection of the symmedians which are the medians reflected across the angle bisectors, so it is also known as the symmedian point. This point seems to be similar to the medians in that the smallest angles go to 0 but experimentally the triangles seem to be going to the sides of P rather than the corners of P. Further, they seem to be drifting slowly. In Figure 23a we have plotted the histogram for all the 10th generation daughters while Figure 23b was formed by random walks of length 30 using the Lemoine point to subdivide.
(a)n=lO
(b) n
= 30
Fig. 23. The nth generation daughters for the Lemoine point with six daughters at each
generation
Iterated Triangle Partitions
39
In Figure 24 we look at how one of the Lemoine daughters maps P to itself. Clearly the map is not contracting. It is also difficult to see what is happening on the right hand side, this is because there is a region which gets mapped 3-to-1 onto. It would be interesting to know more about this mapping, for instance where is the folding occurring (experimentally it seems to be folding near the preimage point of T( 1r /3, tt /3, 1r /3)) .
Fig . 24. A subdivision of P and its image under the Lemoine map
6.
CONCLUDING REMARKS
There are still a large number of questions yet to be answered. For instance, what can be said about the limiting distribution when using bisectors? Is there a limiting distribution when using the Gergonne point, if so what is it? What is the behavior as n tends to infinity when using the Lemoine point? If the triangles are becoming flat what can be said about the rate of convergence? When looking at the medians we were interested in how the two smallest angles compared. When looking at the square of the smallest angle divided by the second smallest angle (giving a ratio between 0 and 1) we got the histogram in Figure 25 divided into 5000 slots; 13611504/17702781 went into the first slot and so we removed that extreme case. The remaining data showed spikes in unusual places, which seem to be connected to the Farey fractions. Is there any explanation for this behavior? In addition, there is of course a vast catalogue of additional points that can be considered (see [9]) . One can also consider variations such as alternating between bisectors and medians at each stage, or using as
40
S. Butler and R. Graham
a
1 -2
·9L7'1.ra o~ ·~TT' ~3 min " .:!4;;7
1
54
.1,
,
I
Fig . 25. The square of the ratio of the smallest and middle angles using 4091277 random
walks with medians of depth 300
a central point the midpoint between the incenter and centroid. A much more general question would be to ask what characterizes points where in the limit most triangles are not flat? One could also consider the problem of where we pick the point uniformly at random in each daughter. In this direction Mannion [12, 13] has shown that if we choose all three vertices at random in the triangle then almost surely the limiting process is collinear. Similar questions can be asked for higher dimensional analogues. For example Schwartz [18, 19] looked at the distribution of "shapes" when nsimplices are recursively subdivided using Barycentric subdivision. In that case he showed that the behavior is similar to the case of division of triangles using the centroid. It would be interesting to see if there were other well defined points in simplices which generate different behavior (Le. , similar to that of the incenter or Gergonne points). Beyond the int rinsic curiosity of these iterated triangle partitions there is also a vast literature on how to subdivide triangles so that the minimal angle is always bounded away from 0 (see [3, 16, 17]). This is desirable since certain methods can fail when the subdivision creates a large number of triangles with minimal angles going to 0 as n gets large. So for instance using medians for subdividing is not desirable since this creates many flat triangles. On the other hand, if we use angle bisectors we can guarantee that all but f(c) proportion of the triangles have minimal angles at least e so that we can limit the proportion of "bad" triangles.
Iterated Triangle Partitions
41
Acknowledgements. We thank Persi Diaconis and Curt McMullen for many useful discussions and insights and the referee for directing us to related literature.
REFERENCES [1]
J. C. Alexander, The symbolic dynamics of pedal triangles, Math. Mag., 66 (1993), 147-158 .
[2]
Imre Barany, Alan F. Beardon and Thomas Keith Carne, Barycentric subdivision of triangles and semigroups of Mobius maps, Mathematika 43 (1996), 165-17l.
[3]
Marshall Bern and David Eppstein, "Mesh generation and optimal triangulation" , in: Computing in Euclidean Geometry, Ding-Zhu Du and Frank Hwang, eds. (1992), 23-90.
[4]
Steve Butler, The lost daughters of Gergonne, Forum Geometricorum, 9 (2009), 19-26.
[5]
Persi Diaconis , personal communication.
[6]
Persi Diaconis and David Freedman, Iterated random functions, SIAM Review, 41 (1999), 45-76.
[7]
Harry Furstenberg, Noncommuting random products, Trans. Amer. Math. Soc., 108 (1963), 377-428.
[8]
Robert Hough, personal communication.
[9]
Clark Kimberling, Encyclopedia of Triangle Centers, http ://faculty .evansville.edu/ck6/encyclopedia/ETC .html
[10]
John Kingston and John Synge, The sequence of pedal triangles, Amer. Math. Monthly, 95 (1988), 609-620.
[11)
Peter Lax, The ergodic character of sequences of pedal triangles, Amer. Math. Monthly, 97 (1990), 377- 38l.
[12]
David Mannion, Convergence to collinearity of a sequence of random triangle shapes, Adv. Appl. Prob., 22 (1990), 831-844.
[13]
David Mannion, The invariant distribution of a sequence of random collinear triangle shapes, Adv. Appl. Prob., 22 (1990), 845-865 .
[14]
Curt McMullen, personal communication.
[15]
Andrei A. Ordin, A generalized barycentric subdivision of a triangle, and semigroups of Mobius transformations, Russian Math. Surveys, 55 (2000), 591-592.
[16]
Maria-Cecilia Rivar and Gabriel Iribarren, The 4-triangles longest-side partition of triangles and linear refinement algorithms, Math. of Computation, 65 (1996), 1485-1502.
[17]
Ivo Rosenberg and Frank Stenger, A lower bound on the angles of triangles constructed by bisecting th e longest side, Math. of Computation, 29 (1975),390-395.
[18J Richard Evan Schwartz , The density of shapes in three-dimensional barycentric subdivision, Discrete Comput. Geom., 30 (2003), 373-377 . [19J Richard Evan Schwartz , Affine subdivision, steerable semigroups , and sphere coverings, Pure and Applied Mathemat ics Quarterly, 3 (2007), 897-926 .
Steve Butler
Ron Graham
Department of Mathematics UCLA , Los Angeles CA 90095
Department of Computer Science and Engineering University of California San Diego, La Jolla CA 92093
e-mail:
butler~ath.ucla.edu
e-mail :
graham~ucsd.edu
BOLVAI SOCIETY MATHEMATICAL STUDIES, 20
Fete of Combinatorics, pp . 43-62 .
PAGERANK AND RANDOM WALKS ON GRAPHS
FAN CHUNG and WENBO ZHAO Dedicated to Loiuisz on the ocassion of his sixtieth birthday
We examine the relationship between PageRank and several invariants occurring in the study of random walks and electrical networks . We consider a generalized version of hitting tim e and effective resistance with an additional parameter which controls the 'speed' of diffusion. We will establish their connection with PageRank. Through these connections, a combinatorial interpretation of PageRank is given in terms of rooted spanning forests by using a generalized version of the matrix-tree theorem. Using PageRank, we will illustrate that the generalized hitting time leads to finding sparse cuts and efficient approximation algorithms for PageRank can be used for approximating hitting time and effective resistance.
1. INTRODUCTION
The notion of PageRank, first introduced by Brin and Page [2] , forms the basis for their Web search algorithms. Although the original version of PageRank was used for the Webgraph (with all the webpages as vertices and hyperlinks as edges), PageRank is well defined for any given graph and is quite effective for capturing various relations among vertices of graphs . In this paper, we will investigate several implications of PageRank for a given graph. To start with, we give the graph-theoretical definition of PageRank. Roughly speaking , PageRank is a way to organize random walk of various lengths. Instead of having to determine the number of steps a random walks is taking, PageRank uses a positive real value a , where a E [0,1) to control the "diffusion" of a combination of random walks.
44
F. Chung and W. Zhao
The original definition for PageRank was to assign a value to each vertex (Webpage), denoting the "importance" of a vertex under two assumptions: For some fixed probability a, a surfer at a Webpage jumps to a random Webpage with probability a and goes to a linked Webpage with probability I-a. The importance of a Webpage v is the expected sum of the importance of all the Webpages u that preceed v. In this paper, we will use a more general version of PageRank, called personalized PageRank, introduced by Jeh and Widom [7] (also see Haveliwala [6]). The personalized PageRank pra(s) depends on two parameters, the jumping constant a and a seed s. A seed can be viewed as a vertex or a probability distribution on vertices. The original definition of PageRank is the special case where the seed is the uniform distribution. To define the PageRank for a connected graph G, we consider random walks on G with transition probability matrix P and the lazy random walk on G, denoted by Z = (I + P)/2. In this paper, all vectors are regarded as row vectors unless stated otherwise. The personalized PageRank vector pra(s) with a jumping constant a and a seed vector s is defined to be the unique solution of the linear system
(1) An alternate but equivalent definition for pr a is an expression of a geometric sum of random walks: 00
pra(s) = as
L (1- alZ
k
.
k=O
In addition to the practical applications of Websearch algorithms, PageRank has numerous connections to various graph invariants. For example, PageRank can be used to find cuts with a certain isoperimetric guarantee, similar to the Cheeger inequalities. It was shown in [1] that for an arbitrarily chosen vertex u, if we arrange vertices in a row using PageRank pra(u), one of the cuts which consists of vertices in initial segments has Cheeger ratio optimal up to a quadratic factor with high probability. The performance guarantee is quite similar to that given by the spectral partitioning algorithm using eigenvectors. However, the advantages of using PageRank are multifold. We can choose an appropriate a to specify the approximate size of the part that we wish to cut and thus PageRank leads to so-called local algorithms. Furthermore, there are effective algorithms for computing
PageRank and Random Walks on Graphs
45
approximate PageRank with finite support with size depending only on the error bound and the desired size of the smaller separated part [1] . In this paper, we explore the relationship of PageRank and various graph invariants occuring in random walks and electrical networks. In the spirit of PageRank, we consider a generalized version of the hitting time and effective resistance with an additional parameter Q . In a way, these generalized invariants provide a quantative ranking of edges, indicating how important an edge is while allowing the choice of Q . In Section 2, we will define the Laplacian and the discrete Green's function as well as their connection to PageRank. In Section 3, we consider electrical networks and the generalized versions of hitting time and the effective resistance. In Section 4, we will give several matrix-forest theorems, which generalize the classical Matrix-Tree Theorem [11]. In Section 5, we will derive a combinatorial interpretation of PageRank in terms of spanning forests in the graph. In Section 6, we consider some useful properties of the generalized hitting time in connection of identifying sparse cuts. In Section 7, we use PageRank to estimate the effective resistance .
2.
LAPLACIAN, THE GREEN'S FUNCTION AND PAGERANK
We consider a connected weighted undirected graph G = (V, E , w). Suppose G has vertex set V, edge set E, edge weight wu,v 2': 0 and IVI = n, lEI = m. A typical random walk is determined by the transition probabilities P(u,v) = wuv/du where the degree d u ofu is the sum L:v :{u,V}EE wu,v ' The volume of a subset 8 ~ V, denoted by vol (8), is the sum of degrees of vertices in 8. In particular, the volume of G, denoted by vol (G), is equal to vol (V) . For the special case of wu,v = 1 for all {u, v} E E , we have vol (G) = 2m. Let A denote the weighted adjacency matrix with entries A( u, v) = wu ,v and D denote the diagonal degree matrix. Then the transition probability matrix P is equal to D- 1 A and for any initial distribution l, the distribution of the random walk after k steps is f pk . For undefined terminology, the reader is referred to the excellent survey of Lovasz [13] The combinatorial Laplacian of G is defined by L = D - A. If we orient the edges of G in an arbitrary but fixed way, we can write its Laplacian as
(2)
46
F. Chung and W. Zhao
where B is the signed edge-vertex incidence matrix, given by
B(e, v) = {
1
if v is e's head
-1
if v is e's tail
a
otherwise
and W is the digonal matrix with W(e, e) = We ' The normalized Laplacian of G is defined to be £ = D- 1/ 2 LD- 1/ 2 and we can write
where S = BD- 1/ 2 . Since E is symmetric and we can express E by n-l
n-l
i= O
i=1
c = 2: )..i
a follows from the connectivity of G. The eigenvalue )..1 is intimately related to the rate of convergence of random walks. The reader is referred to [4] for numerous properties concerning eigenvalues of the normalized Laplacian. Although the combinatorial Laplacian is useful for various flow problems in the study of electrical networks, the spectrum of combinatorial Laplacian is not effective (except for almost regular graphs) for applications requiring isoperimetric properties. Denote the ,8-normalized Laplacian £f3 by ,81 + £, . Then we may write Lf3 = SfTWf3S' where we define S' and Wf3 as follows: S'
=
[I] S
B' (n+m)xn
=
[D
1 2 / ]
B
and Wf3 (n+m)xn
=
[,81
a
~]
. (n+m) x (n+m)
For simplicity, we index the columns of S' and the columns of Wf3 by VUE where the first n columns are indexed by V and the last m columns are indexed by E. The rows of Wf3 are indexed in the same way. It is easy to verify that Green's functions were first introduced in a celebrated essay by George Green [8] in 1828. Since then, the concept of Green's functions has been
47
PageRank and Random Walks on Graphs
used in a wide range of areas, especially in the study of partial differential equations and quantum field theory. The discrete analog of Green's functions, which are associated with the normalized Laplacian of graphs , were first introduced in a 2002 paper [5] in connection with the study of Dirichlet eigenvalues with boundary conditions. The Green's function 9 denotes the symmetric matrix satisfying
1£9 = 19£ = f. for all vectors
1 which are orthogonal to the
eigenvector
where 1 denotes the all l 's vector. The Green's function 9 has the following form:
(3) The following modified Green's function 9(3 was also used in [5] . For f3 E jR+ , let Green's function 9(3 denote the symmetric matrix satisfying
(4) Clearly, we have
(5) By comparing with the recurrence of the PageRank in (1), we remark that the discrete Green's function is basically a symmetric form of the PageRank. Namely, we can write
(6) where
(7)
f3=~ . I-a
48
3.
F. Chung and W. Zhao
PAGERANK, THE HITTING TIME AND THE EFFECTIVE RESISTANCE IN ELECTRICAL NETWORKS
A connected weighted undirected graph G = (V, E, w) can be viewed as an electrical network, where the edge weight We represents the conductance of e. The effective resistance R( u, v) between two vertices u and v is defined as the voltage potential difference induced between them when a unit current is injected at u and extracted at v. The effective resistance can be characterized by the combinatorial Laplacian of the graph (see [11]). Since we wish to establish the connection of the effective resistance with PageRank, we will consider the normalized Laplacian instead. Suppose we are given the injected current function iv : V --7 JR. The induced current ie on the edges satisfies the property that the sum of all induced current on edges entering v is equal to iv(v) , as asserted by Kirchoff's current law: iv = iEB.
For any function f : V --7 JR, we can regard f as a voltage potential function in the following sense: The induced flow for the edge from u to v is the product of f(u) - f(v) and the conductance ofthe edge, according to Ohm's law, and can be expressed by
We can write
Suppose we only consider the voltage potential function f satisfying Lv f(v) = O. By using the definition of Green's function , we have
Suppose we inject a unit current to vertex u and extract a unit current from v, i.e., iv = Xv - Xu where Xu is the characteristic function with Xu(x) = 1 if x = u and 0 otherwise. Thus, the effective resistance between vertices u and v can be written as
(8)
R(u, v) =
Ivix» -
Xu?
= ivD- 1/ 2gD- 1/ 2 (Xv -
Xu)T
49
PageRank and Random Walks on Graphs
The effective resistance is closely associated with the hitting time and commute time for a random walk on G. The hitting time H(u, v) is the expected number of steps of a random walk starting from u until it first visit v. The commute time C(u, v) of u and v is the expected number of steps in a random walk starting at u, before vertex v is visited, and the vertex u is reached again. The commute time can be expressed as the sum
C(u, v) = H(u, v) + H(v, u). It has been shown [12] (also see [3]) that the commute time C(u, v) satisfies
R(u,v) C(u, v) = vol (G)" For two distinct vertices u and v, the hitting time H(u, v) satisfies the following equation:
(9)
1
H(u,v) = 1 + d
u
L
H(w,v)
w :{w,u}EE
and H(u, u) = O. Here we will express the hitting time in terms of the Green's function . Lemma 1. For all u, v E V,
H(u, v) _ ( _ )D-1/2gD-1/2 T vol (G) - Xv Xu Xv· Proof. Clearly, H(v, v) = 0 for all v E V. We use the equation in (9). Consider 1 1" -1/2 -1/2 T vol (G) + d L..t (Xv - Xu)D gD Xv u w: (w,u)EE 1 + X D-1/2gD-1/2XT - X D- 1AD-1/2gD-1/2XT v v u v vol (G)
= VOI~G) + XvD-1/2gD-1/2Xr - Xu D- 1/2(I - £)gD- 1/2Xr
50
F. Chung and W. Zhao
= (Xv - Xu)D- 1/2gD-1/2Xr
+ XuD- 1/2 (
1
wl(~
D1/2J D 1/2 + £,g) D- 1/2XT v
= (Xv - Xu)D- 1/2gD-1/2Xr
+ Xu D- 1/2 ( vol1(G) D 1/2J D 1/2 + I
- uT u ) D- 1/2XT 0 0
= (Xv - Xu)D- 1/2gD-1/ 2Xr
+ XuD-1Xr
= (Xv - Xu)D- 1/ 2gD-1/2Xr
•
v
We define
H(u ,v) h(u, v) = vol (G) . Now, we define a generalized hitting time with an additional parameter Q'
> o.
(10) We define the generalized effective resistance Ra(u,v) as follows:
It is easy to check that R a ( u, v) satisfies
where f3 satisfies (7). By using the connection with PageRank in (6), we can write
(11)
Ra (U ,V )
_ [pra(xu)] (u) _ [pra(xu)] (v) -
+
d
u
d;
[pra(xv)] (v) _ [pra(xv)] (u) . dv
du
51
PageRank and Random Walks on Graphs
4.
SEVERAL MATRIX-FoREST THEOREMS
It is well-known that in a simple graph G for an edge joining u and v, the effective resistance R(u, v) is proportional to the number of spanning trees containing the edge {u,v}. Later on we will show that the generalized effective resistance Rex. (u, v) is proportional to a combination of spanning forests of certain types . A forest is a graph containing no cycle. A k-rooted forest is a forest with k connected components where each of the connected components contains a special vertex that we call a root . A k-rooted spanning forest is a k-rooted forest containing all vertices as vertices. It has exactly n - k edges. The special case for k = 1 is a rooted spanning tree. The weight of a forest F is defined to be the product of all weights of edges in F. We define the weight w(F) of an unrooted forest as follows:
w(F) =
II w(e). eEF
For example, if F is a rooted tree in a simple graph, then w(F) = 1. For a rooted tree F, we denote by F* the set of all vertices in F which are not roots . The weight w*(F) of a rooted forest is defined by w*(F) =
ITeEF w(e). ITvEF.
dv
First, we prove several useful facts along the same lines as the MatrixTree Theorem [11] Theorem 1. In a graph G = (V, E, w), for 13 > 0, the determinant of £(3 is related to rooted spanning forests as follows: n
det £(3 =
L 13 L k
k=l
w*(F)
FEFk
where Fk denotes the family of all k-rooted spanning forests in G.
Proof. For a matrix M and subsets X, Y of indices of rows and columns, we denote a submatrix Mx,Y of M by restricting rows and columns of M to X and Y. We consider the determinant of £(3 as follows: det £fj = det SfTWfjS' =
L
(det Sp,v)( det WF,F)(det Sp,v)
FCVUE
IFI=n
52
F. Chung and W. Zhao
by the Cauchy-Binet Theorem. We note that det S~,v = 0 if F contains a cycle. In the other direction, if F does not contain a cycle, F is a spanning forest and the vertices in F n V are the k roots of the spanning forest. Therefore, we have n
det£/3 =
L
L
k=l
F
(detS~,v)2det (W/3)F,F'
k-rooted spanning forest with roots in FnV
Note that for a k-rooted spanning forest F, we have
13 k
detSF V
= ±~
1 d
k
I
,
II .a;
11v d; uEFnv
Thus we have
det Z, =
11
n
Lf3
v v k=l
L
II
F uEFnv k-rooted spanning forests
du
II
We
eEF
n
=
Lf3 L k
k=l
w*(F)
FEFk
as claimed. _ Theorem 2. In a graph G = (V, E, w), for 13 > 0 and a vertex v in G, the determinant of the principle minor £~v), obtained by excluding the row and column associated with v satisfies:
det£~v) =
n
Lf3 k=l
k 1 -
L
w*(F)
FEFk ,v
where Fk,v denotes the family of k-rooted trees having v as one of the roots.
Proof. Let V' denote V \ {v} . We can write the determinant of £~v) as follows:
= FCV'UE IFnv'l=k-l IFI=n-l
53
PageRank and Random Walks on Graphs n
=L k=1
L
(det S~,v,)
2 det (WI') F,F
F k-rooted spanning forest with roots in FnV' and v
since if the forest F satisfies det S~ v #- 0, then F ~ V' U E and F forms a k-rooted spanning forest with v as ~ root . Thus,
and we have
det.C~) =
n
1 d
L
/3k-1
ITu#v u k=1
L
II
F
uEFnv
k-rooted spanning forests v is a root
du
II
We
eEF
n
=
L/3k-1 L
w*(F)
FEFk,v
k=1
as desired. _ Theorem 3. In a graph G = (V, E , w), for /3 > 0 and two distinct vertices u, v in G, the determinant of the minor .c~u,v), obtained by excluding the row associated with u and column associated with v satisfies:
where Fk ,u,v denotes the family of k-rooted spanning forests in which u and v are in the same connected component and u is a root.
Proof. We denote VI = V \ {u} and V2 = V \ {v} . We consider the determinant of .c~u,v) as follows: det .c~u,v) = cr( u , v) det ( (S~lUE,V) T WfJS~2UE,v ) n
=
cr(u,v)
L
L
k=1
FCVUE IFnvl!=k-1 IFI=n-1
(detS~,vJ (detS~,V2) det
(WfJ)F,F
54
F. Chung and W. Zhao n
= u(u,v)
L
L
k=l
FCVUE
(detS~,vJ (detS~,v2) det (Wf3)F,F
IFnV"I=k-l IFI=n-l
since if u or v is in F, one of the determinants in the product of the preceding equality becomes zero. Here u( u, v) denotes (-1) i+j if u is the index of the ith row and v is the index of the jth column of Lf3 . If det S~v is non, 1 zero, the edges in F form a spanning tree with roots {u} U (F n V") where V" = V\ {u, v}. If det S~, v2 is non-zero, then the edges in F form a spanning tree with roots {v} U (F n V") . Therefore if the product is nonzero, vertices u and v are in the same connected component in the spanning forest formed by the edges in F. Suppose F ~ V" U E forms a rooted spanning forest with k connected components, one of which contains both u and v. Thus we have det L~u,v) =
t
u( u, v) J dudv Il#u,v dx k=l
L
FCV"UE IFnv"l=k-l IFI=n-l
We will prove the following Claim later. Claim. det B~,V2 = u(u, v) det B~,Vl' From the Claim, we have det L~u,v) =
1
n
L
J dudv Il#u,v dx k=l
1
n
= J dudv Il#u,v dx L k=l n
F k-rooted spanning forest u is a root u,v are in the same c.c.
L
(det B~,vJ 2 det (Wf3)F,F
FEFk,u,v
L L
II
II
1 {3k-l We dx dudv Ilx#u,v dx k=l FEFk,u ,v eEFnE xEFnv
ITT V
L
55
PageRank and Random Walks on Graphs
=
=
.Jdudv
tj3k-1 k=1
~t
j3k-1
1
k=1
L
IleEFwe
FEFk ,u,v IlxEF.\{v}
L
dx
w*(F).
FEFk ,u,v
It remains to prove the Claim.
Proof of the Claim. We prove the claim in three steps: Case 1: First we see that the Claim holds if F forms a path with vertices U = UI, U2, . . . , Uk+! = v and edges ei = {Ui, Ui+I} in F where Ui is the index for the ith row of L, and ej is the index of the jth column in B . Case 2: Since U and v are in the same connected component of F, let U = VI,V2, . . . ,Vt = V denote the path joining U and V in F. If Ui is the index for the ith row of L, and ej is the index of the jth column in B for 1 ::; i ::; t + 1 and 1 ::; j ::; t, then the claim holds in the same way as in Casel. Case 3: Now we consider the general case. We follow the notation in Case 2 concerning the paths joining U and V in F. We denote by U the permutation on V that moves Vi to the ith place for i = 1, . .. , k + 1 and denote by U' the permutation on E that moves ej = {Vj, vj+d to the jth place for j = 1, ... ,k. We consider
O"(U, v) det (( B~,vJ T B~,V2) = O"(U(u), U(v)) det (UB~,Vl TUfl'U'B'p,V2 V)
We have reduced Case 3 to Case 2. Thus the above expression is equal to 1 and the Claim is proved. The proof of Theorem 3 is completed.
_
56
5.
F. Chung and W. Zhao PAGERANK AND OTHER INVARIANTS IN TERMS OF ROOTED SPANNING FORESTS
Using the matrix-forest theorems in the preceding section, we can establish the connection between the discrete Green's function and rooted spanning forests. We consider the discrete Green's function Q/3 for (3 > O. For a fixed vertex v, we consider
(12) Clearly, f = Q/3Xv is a solution to the above equation. We can view (12) as a linear system with variables f(u) for u in V. By Cramer's rule, we have
= Q/3(v , v) =
det £(v) d et /3
I
(13)
f(v)
(14)
det £~u,v) f(u) = Q/3(U, v) = d £ . et /3
From equation (6) and Theorems 1, 2 and 3, we can express PageRank in terms of the combinatorial sums involving rooted spanning forests as follows:
Theorem 4. For a vertex v in G, the PageRank pra satisfies
where (3 = 2aj (1- a), Fk denotes the family of all k-rooted spanning forests in G and Fk,v denotes the family of k-rooted trees having v as one of the roots.
Theorem 5. For two distinct vertices u and v in G, the PageRank pra satisfies
where (3 = 2aj(1 - a) and Fk,u,v denotes the family of k-rooted spanning forests in which u and v are in the same connected component and u is a root.
57
PageRank and Random Walks on Graphs
As it turns out, the generalized hitting time can also be expressed in a similar form:
Theorem 6. For an edge e = {u, v} in G, the hitting time heA u, v) satisfies
where f3 = 2aj(1 - a) and Fk,e,v denotes the family of k-rooted spanning forests containing e as an edge which is in the path from v to its root.
Proof. From (10), we have
Note that the set of Fk ,v \ Fk,v ,u consists of k-rooted trees in which u and v are in different connected components and v is a root. For every rooted forest F in Fk,v \ Fk,v,u we consider the rooted tree F' formed by adding the edge e = {u, v} where v is no longer a root . The path from v to its root in F' contains e. Clearly, F' has k - 1 connected components and k - 1 roots. Let Fk-l,e,v denote the family of k - 1 forests with the additional property that the path from v to its root contains e. Thus F' is in Fk-l,e,v' We note w*(F') = wew*(F) dv
since v is no longer a root. This is a bijection from Fk ,v \ We can then write
The proof is complete. _
Fk ,v ,u
to
Fk-l ,e ,u-
58
F. Chung and W. Zhao
By using the above theorems, we can then derive a relatively clean formulation for the generalized effective resistance . Theorem 7. For an edge e = {u, v} in G and a E [0, 1), the effective resistance Rex (U, v) satisfies R (
ex
)_
U,
V -
R ",n-l Rk ' "
L..,FEFk,e We L:~=l 13 k L:FEFk
fJ
L..,k=l
fJ
w* (F) w*(F)
where 13 = 2aj(1 - a) and Fk,e denotes the family of k-rooted forests containing e as an edge with k roots.
Proof. The proof follows from the fact that and
Fk,e,u
and
Fk,e,v
are disjoint
Therefore we have
Rex(u, v) = hex(u, v) + hex (v, u)
13 L:~:~ 13 L:FEFk,e w*(F) = k We L:~=l 13 L:FEFk w*(F) . k
6.
•
USING THE GENERALIZED HITTING TIME TO FIND SPARSE CUTS
There are several useful properties of the hitting time hex which we will describe. Lemma 2. For a subset S
c
V with S
L
=1=
hex(u,v)
0, we have
~
{u,v}EE UES,vf!.S
2a l-a
--.
Proof. Since we can view prex(xv) as a probability distribution, we have
L {u,v}EE uES,vf!.S
hex(u,v) =
L {u,v}EE UES,vf!.S
([prex ( :
: )]
(v) _ [prex ( : :
)]
(U))
59
PageRank and Random Walks on Graphs
Since the PageRank vector pra(xv) is the unique solution of the following equation,
I+P
pra(xv) = axv + (1 - a) pra(Xv)-2-' by rearranging the terms above, we have
Thus,
For two distinct vertices, we consider a partition of V into two parts, one of which contains u and the other contains v. In particular, we are interested in the Cheeger ratio of such partitions defined as follows: >uv =
min e(8, S) . scv _ min { vol (8), vol (8)}
uES,vES
Theorem 8. For two distinct vertices u and v and a constant > E (0,1), suppose two sets X = {w : ha(w,v) ~ o} and Y = {w : ha(w,v) < ha ( u , v)} satisfy the following conditions: .
4a
(1) ha(u,v) > (1- a)> vol (X); (ii) vol (X) ~ vol (G)/2 ; (iii) vol (Y)/ vol (X) ~ (1 + >/2).
Then >uv
~
> .
Proof. The proof is by contradiction. We first observe that X c Y. Suppose >uv (15)
> >. Then we have
e(X, Y) ~ e(X, X) - vol (Y\X)
60
F. Chung and W . Zhao ~
¢>vol (X) - (¢>/2) vol (X)
~
(¢>/2) vol (X) .
by hypothesis and (iii)
By (i) and Lemma 2, we have
I:
ha(x,y) ~
{x ,Y}EE XEX,YEX
I:
ha(x,y)
{x,Y}EE XEX,yEY
since ha(u,v) is the smallest value among all edges (x, y) such that x E X and y E Y. By inequality (15) and (i), the above inequality implies that ~
L.J
2a ha (x , y) > 1 _ a .
{x,Y}EE xEX,yEX
This contradicts Lemma 2 and the proof is complete. _
7. USING PAGERANK TO ESTIMATE THE EFFECTIVE RESISTANCE
The effective resistance R(u, v) is a very useful graph invariant. For example, the recent work by Spielman and Srivastava [14] on graph sparsification relies on the effective resistance . Here we wish to illustrate that we can use the generalized effective resistance to approximate the effective resistance. Then by using the effective approximation algorithm for computing PageRank [1] and the PageRank representation in (11) for the generalized effective resistance, we can approximate the effective resistance as a result. Recall that for a = f3/(2 + (3) , we have
Ra(u, v) = f3(Xu - Xv)D- I / 2Y/3D- 1/ 2(Xu - Xvf · Theorem 9. For two distinct vertices u and v in G, we have
If3R(u, v) -
Ra(u, v)1
::; f32Ai
( 1
1)
d +d u v
where Al is the smallest nontrivial eigenvalue of L of G and a = f3 / (2 +(3) .
61
PageRank and Random Walks on Graphs
Proof. From (3) and (8), we have
R(u, v) = (Xv - Xu)D- 1/2gD- 1/2(Xv - Xu)T =
~ ~ (
_
~
i=l Ai
.a;
From equation (5), we have
Ra(u,v) = ~ _f3_ ( 0,
If3R(U,v) - Ra(u,v)1 :::; (
(tAi __Ai f3+ f3 ) (
~
f32 (
2
since
Thus we have
If3R(u ,v) <
f32 - A1(A1 + (3) f32 :::; Ai
Ra(u,v)\
(2 ((
(2
1
vol (G) + du
-
1
< f32 (~+~) - Ai
since
I«
du
1
J du vol (G) + dv
d;
and fv are orthonormal vectors. -
-
1)
J d; vol (G)
62
F . Chung and W. Zhao
REFERENCES [1] R. Andersen, F. Chung and K. Lang , Local graph partitioning using pagerank vectors, Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (2006), pp. 475-486.
[2] S. Brin and L. Page , The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, 30(1-7) (1998), pp. 107-117 .
[3] A. k. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky and P. Tiwari , The electrical resistance of a graph captures its commute time and cover time, Proceedings of the 26th ACM Symposium on Theory of Computing (1989), pp . 574-586 . [4]
F. Chung , Spectal Graph Theory, AMS Publication, 1997.
[5] F. Chung and S.-T . Yau, Discrete Green 's Functions. Journal of Combinatorial Theory, Series A , 91(1-2) (2000), pp. 191-214.
[6] H. Haveliwala, Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search , IEEE Trans. Knowl. Data Eng., 15(4) (2003), pp . 784-796.
[7] Glen Jeh and Jennifer Widom, Scaling personalized web search. Proceedings of the 12th World Wide Web Conference (WWW) (2003), pp. 271-279 .
[8] G. Green, An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism, Nottingham, 1828.
[9] S. Guattery and G. L. Miller, Graph embeddings and laplacian eigenvalues, Journal on Matrix Analysis and Applications, 21(3) (2000), pp. 703-723. [10]
G. Kirchhoff, Uber die Auflosung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Strome gefiihrt wird, Ann. Phys . chem. , 72 (1847), 497-508.
[11]
G. Kirchhoff, On the motion of electricity in conductors (Uber die Bewegung der Elecktricitiit in Leitem), Annalen der Physik, Vol. 102 (1857), pp . 529.
[12]
C. St . J . A. Nash-Williams, Random walks and electronic currents in networks , Proceedings of the Cambridge Philosophical Society , 55 (1959), pp. 181-194.
[13]
L. Lovasz, Random walks on graphs: A survey, Combinatorics, Paul Erdos is Eighty, 2 (1993), pp . 1-46.
[14]
D. A. Spielman and N. Srivastava, Graph sparsification by effective resistances, Proceedings of the 40th ACM Symposium on Theory of Computing (2008), pp . 563-568.
Fan Chung and Wenbo Zhao University of California, San Diego, La Jolla, CA 92093, US e-mail:
{fan.w3zhao}~ucsd.edu
BOlYAI SOCIETY MATHEMATICAL STUDIES, 20
Fete of Combinatorics, pp. 63-93.
SOLUTION OF PETER WINKLER'S PIZZA PROBLEM*t
JOSEF CIBULKA, JAN KYNCL, VIOLA MESzAROS, RUDOLF STOLAR and PAVEL VALTR
Bob cuts a pizza into slices of not necessarily equal size and shares it with Alice by alternately taking turns. One slice is taken in each turn. The first turn is Alice's. She may choose any of the slices. In all other turns only those slices can be chosen that have a neighbor slice already eaten. We prove a conjecture of Peter Winkler by showing that Alice has a strategy for obt aining 4/9 of the pizza. This is best possible, that is, there is a cutting and a strategy for Bob to get 5/9 of the pizza. We also give a characterization of Alice's best possible gain depending on the number of slices. For a given cutting of the pizza, we describe a linear time algorithm that computes Alice's strategy gaining at least 4/9 of the pizza and another algorithm that computes the optimal strategy for both players in any possible position of the game in quadratic time . We distinguish two types of turns, shifts and jumps. We prove that Alice can gain 4/9, 7/16 and 1/3 of the pizza if she is allowed to make at most two jumps, at most one jump and no jump, respectively, and the three constants are the best possible.
1.
INTRODUCTION
Peter Winkler posed the following problem at the conference Building Bridges, honouring the 60th birthday of Laszlo Lovasz, in Budapest in 2008. Bob and Alice are sharing a pizza. Bob cuts the pizza into slices "Work on this paper was supported by the projects 1M0545 and MSM0021620838 of the Ministry of Education of the Czech Republic . Viola Meszaros was also partially supported by OTKA Grant K76099. Josef Cibulka and Rudolf Stolar were also supported by the Czech Science Foundation under the contract no. 201/09/H057. t A short version of the paper appeared in Combinatorial Algorithms, the proceedings of the IWOCA 2009, Hradec nad Moravici, Czech Republic , LNCS, Vol. 5874, pp . 356-368 , Springer (2009) .
64
J. Cibulka, J. Kync], V. Meszaros , R. Stolar and P. Valtr
of not necessarily equal size. Afterwards they take turns alternately to divide it among themselves. One slice is taken in each turn. In the first turn Alice takes any slice. In the forthcoming turns one may take a slice if it is adjacent to some previously taken slice. This is called the Polite Pizza Protocol. How much of the pizza can Alice gain? The original puzzle, that is determining whether Bob can get more than half of the pizza, was devised by Dan Brown in 1996. Bob can easily ensure for himself one half of the pizza. For example, he may cut the pizza into an even number of slices of equal size. Then Bob always obtains exactly one half. Peter Winkler found out that Bob can actually get 5/9 of the pizza if he cuts the pizza properly - see Theorems 4 and 5 for such cuttings. He conjectured that Alice can obtain 4/9 of the pizza for any cutting. The main aim of this paper is to show a strategy of Alice proving this conjecture. The pizza after Bob's cutting may be represented by a circular sequence P = POPl .. . Pn-l and by the sizes IPil ~ 0 (for i = 0,1 , .. . , n - 1); for simplicity of notation, throughout the paper we do not separate the elements of (circular) sequences by commas. The size of P is defined by !PI := L:~:ollpil· Throughout the paper the indices are counted modulo n. For 1 < j ::; n , if one of the players chooses a slice Pi in the (j - 1)-st turn and the other player chooses Pi-lor Pi+! in the j-th turn, then the j-th turn is called a shift, otherwise it is called a jump. Except for the first and the last turn, there are two choices in each turn and exactly one of them is a shift and the other one is a jump. The last turn is always a shift. If some strategy of a player allows the player to make at most j jumps, then we call it a j -jump strategy. We remark that given a circular sequence P of length n, Alice has exactly n zero-jump strategies on P, determined by Alice's first turn. Let E be a particular strategy of one of the players. We say that E is a strategy with gain 9 if it guarantees the player a subset of slices with the sum of sizes at least g. Note that according to this definition, if E is a strategy with gain 9 then it is also a strategy with gain g' for any g' ::; g. If the number of slices is even, Alice has the following zero-jump strategy with gain IPI/2. She partitions the slices of the pizza into two classes, even and odd, according to their parity in P. In the first turn Alice takes a slice from the class with the sum of slice sizes at least IP\/2. In all her forthcoming turns she makes shifts, thus forcing Bob to eat from the other class in each of his turns.
Here is our main result.
Solution of Peter Winkler's Pizza Problem
65
Theorem 1. For any P, Alice has a two-jump strategy with gain 4IPI/9. More generally, we determine Alice's guaranteed gain for any given number of slices.
Theorem 2. For n ~ 1, let g(n) be the maximum 9 E [0,1] such that for any cutting of the pizza into n slices, Alice has a strategy with gain giPI. Then if n=l, I
g(n) =
4/9 if n E {15, 17, 19, ... }, {
1/2
otherwise.
Moreover, Alice has a zero-jump strategy with gain g(n)IPI when n is even or n ::; 7, she has a one-jump strategy with gain g(n)IPI for n E {9, 11, 13}, and she has a two-jump strategy with gain g(n)IPI for n E {15,17 ,19, . . . }. If we make a restriction on the number of Alice's jumps we get the following results.
Theorem 3. (a) Alice has a zero-jump strategy with gain 1P1/3 and the constant 1/3 is the best possible. (b) Alice has a one-jump strategy with gain 71PI/16 and the constant 7/16 is the best possible. Due to Theorem 2, the following theorem describes all minimal cuttings for which Bob has a strategy with gain 5IPI/9.
Theorem 4. For any w E [0,1], Bob has a one-jump strategy with gain 51PI/9 if he cuts the pizza into 15 slices as follows: Pw = 0010100(1+w )0(2w)00202. These cuttings describe, up to scaling, rotating and flipping the pizza upside-down, all the pizza cuttings into 15 slices for which Bob has a strategy with gain 5IPI/9. For w = 0 or w = 1, the cutting in Theorem 4 has slices of only three different sizes 0,1,2. If all the slices have the same size, then Alice always gets at least half of the pizza. But two different slice sizes are already enough to obtain a cutting with which Bob gets 5/9 of the pizza.
Theorem 5. Up to scaling, rotating and flipping the pizza upside-down, there is a unique pizza cutting into 21 slices of at most two different sizes for which Bob has a strategy with gain 5IPI/9. The cutting is 001010010101001010101.
66
J. Cibulka, J. Kyucl, V. Meszaros, R. Stolar and P. Valtr
In Subsection 7.1 we describe a linear-time algorithm for finding Alice's two-jump strategy with gain g(n)IPI guaranteed by Theorem 2. Theorem 6. There is an algorithm that, given a cutting of the pizza with n slices, performs a precomputation in time O(n) . Then, during the game, the algorithm decides each of Alice's turns in time 0(1) in such a way that Alice makes at most two jumps and her gain is at least g(n)IPI. There is also a straightforward quadratic-time dynamic algorithm finding optimal strategies for each of the two players.
Claim 7. There is an algorithm that, given a cutting of the pizza with n slices, computes an optimal strategy for each of the two players in time 0(n 2 ) . The algorithm stores an optimal turn of the player on turn for all the n 2 - n + 2 possible positions of the game. We remark that, unlike in Theorem 1, the number of Alice's jumps in her optimal strategy cannot be bounded by a constant. In fact, it can be as large as ln/2J-1 for n ~ 2 (see Observation 28 in Subsection 7.2). A similar statement holds for the number of Bob's jumps in his optimal strategy. The following question is still open .
Problem 1. Is there an algorithm that uses o(n 2 ) time for some precomputations and then computes each optimal turn in constant time? We remark that we even don't know if Alice's optimal first turn can be computed in time o(n 2 ) . Independently of us and approximately at the same time, K. Knauer, P. Micek and T . Ueckerdt [3] also proved Theorem 1 and some related results. The paper is organized as follows. Theorem 1 is proved in Section 2. Section 3 contains examples of cuttings showing that the constant 4/9 in Theorem 1 cannot be improved. Section 4 is devoted to the proof of Theorem 2. Theorems 4 and 5 are proved in Section 5. Section 6 contains the proof of Theorem 3. The algorithms from Theorem 6 and Claim 7 are described in Subsection 7.1 and Subsection 7.2, respectively.
In a follow-up paper [1] we discuss generalizations of the Pizza Problem.
67
Solution of Peter Winkler 's Pizza Problem
2. THE LOWER BOUND
1P1/2.
When the number of slices is even, Alice can always gain at least Here we prove the lower bound on her gain when n ;::: 3 is odd.
2.1. Preliminaries If the number of slices is odd, instead of the circular sequence P = POPl " ·Pn-l we will be working with the related circular sequence V = VOVl . .. Vn-l = POP2·.· Pn -lPlP3 ... Pn-2 that we call the characteristic cycle (see Figure 1). The size of the characteristic cycle is denoted by IVI. Clearly IVI = IPI· Vo = Po Vn-I
=
Pn-2
•
•
VI
•
• • •
v~ =PI 2
•2
Vn 1
=
P2
• • =
Pn- I
Fig. 1. A cutting of a pizza and the corresponding characteristic cycle
An arc is a sequence of at most n - 1 consecutive elements of V. If we talk about the first or the last element of an are, we always consider it with respect to the linear order on the arc inherited from the characteristic cycle V. For an arc X = ViVi+1 . . . Vi+l-l, its length is l(X) := l and its size is IXI := L:~~li-llvjl. An arc of length (n + 1)/2 is called a half-circle . Figure 2 shows an example of a game on V . The slice taken in the i-th turn is labelled by the initial letter of the player with i in the subscript. At any time during a game, a player may decide to make only shifts further on. The player will take one or two arcs of the characteristic cycle afterwards. An example of such a game when Alice decided to make no more jumps is depicted on Figure 3 (slices taken before the decision point are labelled with *, and selected pairs of slices neighboring in the original pizza are connected by dashed segments) . The slices she took after the
68
J. Cibulka, J. Kyncl , V. Meszaros, R. Stolar and P. Valtr
A3
B
- -
_
6
Al
-A7
B4-
-
B2
- A5
Fig. 2. A game illustrated on the characteristic cycle V (the turns are AI, B2, A 3 , . •. ). The turns B 4 and A 5 are jumps and all the other turns (except AI) are shifts
decision point are forming two arcs that are separated in between by some arc of previously taken slices.
•
-
B I 4-
- - - --
• Fig. 3. Situation before Bobs turn with the two possible options marked by arrows (left) and two of the possible ends of the game where Alice made no more jumps (middle and right)
Observation 8. Consider a position after Alice's turn Aj,j =1= 1, n. We have V = TIRIT2R2 , where £(TI) = £(T2) + 1 = (j + 1)/2, £(R I) = £(R 2), T I and T 2 are two arcs of already taken slices, and R I and R2 are two arcs containing the remaining slices. Suppose that all the remaining turns of Alice (Aj+2' Aj+4, "" An) are shifts. Then, regardless of Bob's remaining turns B j +1 , " " Bn-l, the slices taken by Alice in the turns Aj+2' Aj+4,"" An necessarily form two arcs Xl and X2 such that XITIX2 is a half-circle of V. In addition, for any half-circle YITIY2, Bob can choose his turns Bj+2' ... ,Bn- l so that Xl = YI and X 2 = Y2.
Proof. We will show by induction that before any Bob's turn Bj+2k+b the slices taken by him in turns B j +1 , " " B j+2k-1 form two arcs Zl and Z2 such that Z = ZlT2Z2 is an arc and his two possible moves are on the
69
Solution of Peter Winkler's Pizza Problem
two neighbors of Z. This is true for B j+1 and by induction if this is true before Bj+2k+1' then Bob takes for Bj+2k+1 one of the two neighbors of Z and Z' := Z U Bj+2k+1 is an arc. After Alice's shift, Bob's shift would be a neighbor of Bj+2k+1' thus a neighbor of Z'. Bob's jump would be the neighbor of Z different from B j +2k+1' thus a neighbor of Z' . For any given half-circle YITIY2 and before any of Bob's turns Bj+l,"" B n - l , the two slices available for Bob are neighbors of an arc of length at most (n - 3)/2 which is not a subarc of Y ITIY2 • Thus one of the two slices available for him is not in YITI l'2 and Bob can choose his turns Bj+1," " B n - l so that Xl = Y I and X2 = Y2. •
*~ITl,r*
•
*• •* -
*•
•
III I,'" I} ,
•
II 1/
~
I
B w• R 2
'I ,
•
,
,
•
1\ 1'1 1/
~12.
* Fig .
I
h,.
•
B 14• B 1;
•
•4
B
T2
*'
•
•
Ag
A7
As
4. Two possible choices of Bob's next
turn (left) and the two possible ends of the game where Bob made no more jumps (middle and right)
If Bob decides to make only shifts for the rest of the game, he takes one arc afterwards. Namely, if there are two arcs of already taken slices in V at his decision point, then the arc that will be taken by Bob is neighboring these two arcs at both of its ends (see Figure 4). Observation 9. Consider a position after Alice's turn Aj,j i= 1,n. We have V = TIRIT2R2, where f(TI) = f(T2) + 1 = (j + 1)/2, f(RI) = f(R 2), TI and T2 are two arcs of already taken slices, and RI and R2 are two arcs containing the remaining slices. Bob's turn B j+1 may be on the last slice of R I or on the first slice of R2. If B j+1 is on the last slice of RI and all the remaining turns of Bob are shifts then , regardless of Alice's remaining turns, Bob will take RI and Alice will take R2 in this phase of the game. Similarly, if B j+1 is on the first slice of R2 and all the remaining turns of Bob are shifts then, regardless of Alice's remaining turns, Bob will take R2 and Alice will take R I in this phase of the game. Proof. Similarly to the proof of Observation 8, it is easy to prove by induction that if Bob played Bj+1 on R I, then before each Alice's turn, the two slices available for her are from R2. •
70
J. Cibulka., J. Kyticl, V. Meszaros, R. Stolar and P. Valtr
2.2. Minimal triples For each v in V the potential of v is the minimum of the sizes of half-circles covering v. The maximum ofthe potentials in V is the potential of V, which we further denote by p(V) . It is an immediate conclusion that Alice has a strategy with gain p(V) because by choosing an element with potential equal to p(V) and making only shifts afterwards Alice obtains at least p(V) . Therefore we may assume that p(V) < 1V1/2. A covering triple of half-circles is a triple of half-circles such that each element of V appears in at least one of the three half-circles . We allow two half-cirIes to be equal in the covering triple. A covering triple is minimal if it contains a half-circle of minimum size (among all n half-circles), all halfcircles forming the triple have size at most p(V) and none of them may be replaced in the triple by a half-circle of strictly smaller size.
Claim 10. Each half-circle of minimum size lies in at least one minimal triple. Proof. Take a half-circle HI of minimum size. Consider Vk and vk+(n-3)/2 the two uncovered elements neighboring HI on V . Let H 2 be the halfcircle of size at most p(V) that covers Vk and as many elements of V not covered by HI as possible. We define H 3 in the same way for Vk+(n -3) /2' The above triple of half-circles covers V. If it is not the case, then take an uncovered element v . Consider a half-circle H that has minimal size among half-circles covering v. At least one of Vk and vk+(n-3)/2 is covered by H. This contradicts the choice of H2 or H 3 . So we get that the given triple of half-circles forms a covering triple. Now while any of the half-circles can be replaced in the triple by a half-circle of strictly smaller size, we replace it . Obviously HI won't be replaced as it is a half-circle of minimum size. Consequently the triple we get is a minimal triple. _ Observation 11. If the size of a half-circle in a minimal triple is z then Alice has a zero-jump strategy with gain z. Proof. As in a minimal triple all half-circles are of size at most p(V) and Alice has a zero-jump strategy with gain p(V), the statement of the observation follows. _ Claim 12. Let p(V) < 1V1/2. Then any minimal triple contains three pairwise different half-circles, and thus there is a partition of V into six
Solution of Peter Winkler's Pizza Problem
71
arcs A, B, C, D, E, F such that the half-circles in the minimal triple are ABC, CDE and EFA (see Figure 5). The lengths of the arcs satisfy l(A) = l(D) + 1 ~ 2, l(C) = l(F) + 1 ~ 2 and l(E) = l(B) + 1 ~ 2.
Fig . 5. The partitioning of the characteristic cycle given by the covering half-circles
Proof. If two of the three half-circles in a minimal triple are equal then V can be covered by two half-circles of the triple. Since each half-circle in the triple has size at most p(V), the total size of the pizza is at most 2p(V) < lVI, a contradiction. If at least one of B, D, F has length 0, we argue exactly in the same way.
We have l(ABC) + l(EFA) = n + 1 = l(A) + ...+ l(F) + 1, therefore l(A) = l(D) + 1 ~ 2. The other two equalities are analogous. _
2.3. An auxiliary one-jump strategy
Throughout this section we assume that p(V) < 1V1/2. We fix any minimal triple T of half-circles. By Claim 12, it yields a partition of V into six arcs A, B , C, D, E, F such that the half-circles in the triple are ABC, CDE, EFA (see Figure 5). We further use the notation a := IAI, b := IBI, and so on. We define a median slice of an arc X = ViVi+l ' " Vi+l to be a slice Vk EX such that IVjl ~ IXI/2 and I:,~~~+llvjl ~ IXI/2. Observe that any arc of positive length has at least one median slice.
I:,J:f
Claim 13. Alice has a one-jump strategy for V with gain b/2 + min {c + d,
f + a} if p(V) < /V1/2.
72
J. Cibulks , J. Kyn cl, V. Meszaros, R. Stolar and P. Valtr
Proof. By Claim 12 we have that l(B) > O. In the first turn Alice takes a median slice Vk of B. Consequently Bob is forced to start in E. He may t ake the element Vk+( n -l )/2 or v k+ (n+1)/2' Alice makes only shifts while the shift implies taking an element of B . In the meantime Bob necessarily takes elements from E . In the turn, when Alice's shift would imply t aking an element outside of B , Alice makes a jump instead. In that moment some init ial arc Eo of E st arting from the boundary of E is already taken. Let El be th e remaining part (subarc) of E . Alice takes the available element of E 1 . Note that such an element exists since in the sequence P , all the neighbors of the slices of B are in E. (see Figure 6). The half-circle X 1EoX2 can replace either CDE or EFA in the fixed minimal triple. Thus due to the minimality of the triple, the size of X 1X2 is always at least the size of either CD or FA. As Alice obtained at least the half of B before the jump, in the end she gains at least b/2 + min {c + d, f + a}. •
A3
.\. •
-
/ / / / /
/.~ B •
A7
•
// C • • • D •
• • •
B2
B l 2 B8
5
./ /
• • F
B4
•
/~
• A
6
AlA
• • B
.".
B22 . \
·
B 20 A 19
A l7
• • •A
•
_
A l5 •
A3
• • B
AlA
•
•
C
:x \
2
\
\
D
F
.
An / ' ~ Eo
B6
5
. / B lO
"
E
X
1/
• Bl6
• Bl 8 • • 23
.'
•
A
.. _ -- / .'\. A 21
. " ..
• • • A
B4 B 2
• Bl 4
A7
A l3 9
Fig. 6. One-jump st rategy: Alice chooses a jump rather than a shift (left) and makes no
more jumps afterwards (right )
Corollary 14 . Alice has a one-jump strategy for V with gain (a+b+ c)/4+ (d + e + 1)/2 if p(V) < 1V1/2. Proof. By Claim 13 Alice has a strateg y with gain b/2 + min {c + d, f + a}. Without loss of generality we may assume thi s sum is gl := b/2 + c + d. Alice also has a strat egy with gain g2 := e + f + a by Observation 11. Combining the two results Alice has a gain max {gl ' g2} 2: g1/2 + g2/2 = (a + c + d + e + 1)/2 + b/4 2: (a + b + c)/4 + (d + e + 1)/2. •
Solution of Peter Winkler's Pizza Problem
73
2.4. A two-jump strategy Throughout this subsection we assume that p(V) < 1V1/2 and that V is partitioned into six arcs A, ... , F in the same way as in the previous subsection. In this subsection we describe a strategy satisfying the following claim.
Claim 15. Alice has a two-jump strategy for V with gain b/2 min {c + d, f + a} if p(V) < 1V1/2.
+ e/4 +
2.4.1. Two phases of the game. Let B = ViVi+l . . . Vi+~ ' Then E = VjVj+l .. . vj+~+}, where j = i + (n - 1)/2. Consider the circular sequence V' = ViVi+l .. . Vi+~ Vj Vj+l . . . Vj+~+l obtained by concatenating the arcs B and E . Let H be a half-circle of V' containing Vj' Then its size is not smaller than the size of E, since otherwise the half-circle CD E of V could be replaced in the minimal triple T by a half-circle of smaller size - namely by the half-circle formed by the slices contained in CD and in H . Similarly, if H is a half-circle of V' containing vj+~+l, then its size is also not smaller than the size of E. Since each half-circle of V' contains "i or vj+~+}, it follows that E is a half-circle of V' of minimum size. If p(V') 2: 1V'1/2 then Alice has a zero-jump strategy E for V' with gain p(V') 2:: 1V'1/2 2:: b/2 + e/4. Otherwise, by Corollary 14 (applied on V'), Alice has a one-jump strategy E for V' with gain b/2 + e/4 (we use the fact that E is a half-circle of V' of minimum size, and therefore it is contained in a minimal triple yielding a partition of V' into six arcs A' , B' , ... ,F' such that E = A' B'G' and B = D' E' F') . Briefly speaking, Alice's strategy on V follows the strategy E as long as it is possible, then Alice makes one jump and after that she makes only shifts till the end of the game. In the rest of this subsection (Subsection 2.4), we consider a game G on V . We divide the turns of G into two phases. The first phase of G is the phase when Alice follows the strategy E and it ends with Bob's turn. Alice's first turn that does not follow (and actually cannot follow) the strategy E is the first turn of the second phase of G. It is always a jump and all the other turns of Alice in the second phase are shifts . We now describe Alice's strategy in each of the two phases of G in detail.
74
J . Cibulka, J . Kyncl , V. Meszaros, R. Stolar and P. Valtr
2.4.2. Alice's strategy in the first phase. As mentioned above, Alice has a one-jump strategy E for V' with gain b/2 + e/4. We now distinguish two cases.
Case 1: The strategy E is a zero-jump strategy. Let the first turn in the zero-jump strategy E be on a slice q E V'. The first turn could be also on any other point of V' with the same or larger potential. Observe that the potentials of the slices in V' are e on E and at least e on B. Therefore we may assume that q lies in B . In the game G, Alice makes her first turn also on q. In the second turn Bob can choose between two slices in E . In the subsequent turns Alice makes shifts as long as Bob's previous turn was neither on the first nor on the last slice of E. Consider all slices taken by Bob up to any fixed moment during the first phase of the game G. They always form a subarc of E (and the slices taken by Alice form a subarc of B). The first turn in which Bob takes the first or the last slice of E is the last turn of the first phase. Note that after that Alice's shift would be either on the last slice of A or on the first slice of C (see Figure 7). But Alice makes a jump and this jump is the first turn of the second phase. Note that this jump is in E (see Figure 7).
• •
• • • D •
.-:
Fig . 7. Case 1: After the end of first phase, Alice chooses a jump rather than a shift
(two examples shown)
Case 2: The strategy E is not a zero-jump strategy. Following the proof of Corollary 14, we may suppose that E is the strategy that we describe below. By Claim 10, the half-circle E of minimum size is contained in some minimal triple T' of half-circles of V'. The triple T' determines a partition
75
Solution of Peter Winkler's Pizza Problem
of V' into six arcs A' , B' , ... , P' in the same way as T determined a partition of V into A, B , . .. , F. We may suppose that E = A' B' 0' and B = D' E'P' . We may suppose that the size of B' is positive, since otherwise one of the half-circles 0' D' E' and E'P' A' has size at least b/2+ e/2 and thus Alice has a zero-jump strategy for V' with gain b/2 + e/ 2, allowing us to use the above Case 1. In the first turn Alice takes a median slice of B'. Then in the second turn Bob can choose between two slices of E'. In the subsequent turns Alice makes shifts as long as Bob's previous turn was neither on the first nor on the last slice of E'. In each moment in this part of the game Bob's turns form a subarc of E' . At the first instance when Bob takes the first or the last slice of E' , Alice makes a jump, which is always in E' (see Figure 8). Note that so far the game was an analogue of the first phase in Case 1, with B' and E' in place of B and E, respectively. After her first jump Alice makes shifts as long as Bob's previous turn was neither on the first nor on the last slice of E. Note that Bob's turns in this part of the game are in E (see Figure 8). At the first instance when Bob takes the first or the last slice of E , Alice makes a jump, which is already the first turn of the second phase. This jump is necessarily in E (see Figure 8).
B
B
.\. • • D'
•
, ,,
• •
•
,
•
, ,,
• 6
,
./.
B'
• •As A 7 A•3 Al
E
Bs
E'
.;'
• Al7
---.. - .. -
A' • •
.\.
•
AI S
F'·
F'·
0' ," II
B B B • 6 Bs
4 2 ••
v·I.
A9 B4 B2 B
- - - -~
.~ ' --A' •
B 1S
•
B 16 • / B' B I 4/ . A 7 A·3 Al • •As
\.
•
B10 B 12
•
A 19
E
Fig. 8. Case 2: During th e first phas e, Alice makes a jump rather than a shift (left) and
then she makes an other jump after the end of th e first phase (right)
76
J. Cibulka, J. Kyncl, V. Meszaros, R. Stolar and P. Valtr
2.4.3. Alice's strategy in the second phase. Alice's strategy in the second phase is very simple. Above we describe the first phase and also the first turn of the second phase, which is always a jump done by Alice. In the rest of the second phase Alice makes only shifts. 2.4.4. Analysis of Alice's gain. Since the first phase of G ends by Bob's turn on the first or on the last slice of E, we may suppose without loss of generality that it ends with Bob's turn on Vj ' Then the part of V removed in the first phase of G is a union of some initial subarc Bo of B and some initial subarc Eo of E. Let E I be the arc formed by the slices of E not taken in the first phase of G, thus E = EoE I , and letel := JEll. In her jump at the beginning of the second phase of G, Alice takes the first slice of E I . By Observation 8, all the slices taken by Alice in the second phase of G form two arcs Xl and X 2 such that X IEoX 2 is a half-circle of V (see Figure 6). Since none of the half-circles CDE and ·EF A can be replaced in the triple T by a half-circle of a strictly smaller size, the sum IXII + IX2 1 achieves its minimum either for Xl = CD and X 2 = E I , or for l(X I ) = 0 and X2 = ElF A . Thus, the portion collected by Alice in the second phase of G is at least ei + min {c + d, f + a}. Now, consider an auxiliary game G' on V' consisting of two phases defined as follows. The turns in the first phase of G' are exactly the same as the turns in the first phase of G (this is a correct definition, as all turns in the first phase of G are in B U E and the first or the last slice of E is taken only at the very end of the first phase). In the second phase of G', both Alice and Bob make only shifts. We claim that Alice actually follows the one-jump strategy E in the whole game G'. This is obvious in the first phase of G'. Further, if E is a zero-jump strategy then Alice clearly follows E also in the second phase of the game G'. Otherwise Alice makes her only jump in the first phase of the game (see Case 2 in Paragraph 2.4.2) and thus again she follows E also in the second phase of G'. By Observation 9, Alice collects exactly the slices of E I in the second phase of G'. Thus , if 9 denotes the portion collected by Alice in the first phase of G' then 9 + el is her portion in the whole game G'. Since the strategy E guarantees gain b/2 + e/4 to Alice, we get 9 + el ~ b/2 + e/4. Alice's portion in the whole game G is at least 9
+ (el + min {c + d,
f + a}) 2: b/2 + e/4 + min {c + d, f + a}, which completes the proof of Claim 15.
77
Solution of Peter Winkler's Pizza Problem
2.5. Proof of the lower bound Proof of Theorem 1. If the number of slices is even then Alice has a zero-jump strategy with gain 1P1/2. We further suppose that the number of slices is odd. We consider the characteristic circle V. If p(V) 2': 1V1/2 then Alice has a zero-jump strategy with gain 1V1/2 = IPI/2. Suppose now that p(V) < 1V1/2. Then V may be partitioned into six arcs A, . . . , F as in Claim 12. Without loss of generality, we may assume that a+b+c:S; c+d+e:S; e+ f +a. Thus, a+b:S; d+e and c+d:S; f +a. By Observation 11, Alice has a zero-jump strategy with gain
91 := e + f + a. By Claim 15, Alice has a two-jump strategy with gain
92 := b/2 + e/4 + min {c + d, f
+ a} =
b/2 + e/4 + c + d.
By an analogue of Claim 15, Alice also has a two-jump strategy with gain
93
:=
f /2 + c/4 + min {a + b, d + e} = J/2 + c/4 + a + b.
One of the three strategies gives gain
max {91 ,92 ,93} 2': (391
+ 492 + 293)/9
= (5a + 4b + 9c/2 + 4d + 4e + 4J)/9 = (41PI + a + c/ 2) /92': 4IPI/9.
3.
•
THE UPPER BOUND
In this section we show a strategy for Bob that guarantees him 5/9 of the pizza. Then Bob has to cut the pizza into an odd number of slices, since otherwise Alice has a strategy with gain IP!/2, as was observed in the introduction. Before each turn of Bob, the number of the remaining slices is even. The sequence of all the remaining slices can be then written as PiPi+lPi+2· .. Pi+2j -l·
Let K := PiPi+2 .. . Pi+2j-2 and L := Pi+1Pi+3 . . . Pi+2 j-l be the sequences of slices on odd and even positions respectively. We use the following reformulation of Observation 9:
78
J. Cibulka, J. KynCl, V. Meszaros, R. Stolar and P. Valtr
Observation 16. Before any of his turns, Bob has a strategy that guarantees him max {IKI, ILl} in addition to what he already has. In the strategy Bob makes only shifts, except possibly for the first turn. Proof. We prove that Bob can get all slices from L . A similar proof shows that he can get all slices from K . In his first turn, Bob takes Pi+2j-l E L. In each other turn, Bob makes shifts. Then before each of Alice's turns, the two slices available for her are from K. •
Claim 17. Bob has a one-jump strategy with gain 51PI/9 if he cuts the pizza into 15 slices in the following way: 002020030300404. Proof. The size of the pizza is 18, which means that Bob wants to get slices with sum of sizes at least 10. We consider all possible first moves of Alice: 1. Alice takes a zero slice located between two nonzero slices. The sizes of the slices remaining after her turn are QOQbQbQOfOfOQa,
where the elements of K are underlined and a, band c are in one of the six possible bijections with 2, 3 and 4. Then IKI = 2c + a and ILl = 2b + a and by a case analysis of the possible values of a, band c, Bob gets max { IKI, ILl} ~ 10. 2. Alice takes a zero slice located between a zero slice and a nonzero slice. This leads to QOQOQbQbQOfOfO and Bob gets max {IKI, ILl} = max {2a
+ 2c, 2b} = 2a + 2c ~ 10.
3. Alice takes a nonzero slice. The situation is then QaQOQOQOQcQcQO.
Bob now takes the rightmost slice and then makes shifts until he either takes a or the two slices c. This leads to three possible cases:
(a) QOQOQOQcQcQ,
(b) QOQOQOQcQ,
79
Solution of Peter Winkler's Pizza Problem
(c) QaQOQOQOQ.
After Alice takes one of the available zero slices, we use Observation 16 to show that the gain of Bob in these three cases is (a) a + max {IKI, ILl} = a + max {2b, 2c} , (b) a + c+ max { IKI , ILl} (c) 2c + max {IKI, ILl}
= a + c+ max{2b,c} = a + c+ 2b,
= 2c + max {2b, a} = 2c +
2b.
In any of the three cases and for any bijective assignment of the values 2, 3 and 4 to a, band c, Bob gets slices of total size at least 10. •
Corollary 18. For any w E [0,1], Bob has a one-jump strategy with gain 51PI/9 if he cuts the pizza into 15 slices as follows: Pw = 0010100(1 +w)0(2w)00202. Proof. The claim holds for w = 1/2, since P1 / 2 is a scale-down of the pizza considered in Claim 17. Clearly, if some slices of P1 / 2 have total size at least 5 then also the corresponding slices of Pw , w E [0,1], have total size at least 5. Therefore, Bob can ensure gain 51Pwl/9 = 5 for Pw , w E [0,1], with the same strategy as for P1 / 2 • • In Section 4 we show that Bob has no strategy with gain 51PI/9 for pizza cuttings with fewer than 15 slices. Moreover, in Section 5 we show that Corollary 18 describes essentially all cuttings into 15 slices that guarantee Bob 5/9 of the pizza .
Claim 19. For any odd n ~ 15, Bob has a one-jump strategy with gain 51PI/9 using some cutting of the pizza into n slices. Proof. For n = 15 the claim follows from Claim 17. For larger n, we take the cutting P from Claim 17 and add n - 15 zero slices between some two consecutive zero slices in the sequence . If Alice starts in one of the added slices, then the situation is similar to the case 2 of the proof of Claim 17. The only difference is that there might be additional zeros at the beginning and at the end of the sequence . But these zeros either do not change the values of IKI and ILl or swap the two values. Thus Bob can get max {IKI ,ILl} = 10.
80
J. Cibulka., J. Kyucl, V. Meszaros, R. Stolar and P. Valtr
Otherwise Bob uses the strategy from the proof of Claim 17. In cases 1, 2, the even number of consecutive newly added zero slices does not change the value of max {IKI, ILl} and Bob can thus get slices of total size 10. In case 3, Alice first takes the slice of size a. The even number of added zero slices does not change the fact that before she is able to take any other nonzero slice, Bob takes either the slice of size a or the two slices of size c. After this, the value of max {IKI, ILl} is the same as in the proof of Claim 17. • For w = 0 or w = 1, the cutting used in Corollary 18 has slices of only three different sizes 0,1,2. If all the slices have the same size, then Alice always gets at least half of the pizza. But two different slice sizes are already enough to obtain a cutting with which Bob gets 5/9 of the pizza:
Claim 20. If Bob can make slices of only two different sizes, then he can gain 5/9 of the pizza by cutting the pizza into 21 slices of sizes 0 and 1 in the following way: 001010010101001010101. Moreover for any odd n 2: 21, there is a cutting with n slices of two different sizes of slices, for which Bob has a one-jump strategy with gain
5IPI/9. Proof. Let n 2: 21 and let the cutting be (00)mlOlOlOlO0l010010101 where m 2: 1. After Alice makes her first turn, there will be an even number of slices remaining and they can be partitioned into two classes based on their parity in the new sequence. If Alice takes a slice of size 0 in the first turn, necessarily one of the classes will contain more slices of size 1 than the other class. Bob's strategy will be to take the available element of the bigger class in each turn. Consequently Alice will be forced to take an element of the smaller class in each turn. If in the first turn Alice takes a slice of size 1 but the previous partitioning still gives two classes of different size, Bob uses the same strategy. Obviously Bob gains at least 5/9 of the pizza in these cases . There are three slices of size 1 indicated by bold which if taken in the first turn result in a partitioning into two classes of equal size: (OO)m1010101001010010101. The sequences below show the situation after the first turn, the vertical line indicates the place of the taken slice: 1. (00)m!1010IQ100101 P010101
Solution of Peter Winkler's Pizza Problem
81
2. (OO)m10101010q 1OIQ0101011 3. (OO)mlOlO1010~ 101OQI01011 Bob takes the underlined slice of size 0 in his first turn. He will make shifts until he gets to one of the borders of the boxes indicated above, then he makes a jump in his next turn and afterwards only shifts till the end of the game. Regardless of what turns Alice makes, depending on the case Bob will obtain at least one or two slices of size 1 before anybody reaches outside the given box. As he makes a jump in his next turn and later only shifts , he will get all slices of size 1 outside the box. Therefore in all cases his gain adds up to at least 5/9 of the pizza. The claim can also be checked for any fixed odd number n 2:: 21 with a computer program based on the algorithm from Section 7.2. •
4.
FIXED NUMBER OF SLICES
Here we prove Theorem 2. The theorem is trivial for n = 1 and easy for n even as observed in the introduction. Further, the theorem for n E {15, 17, 19, . . . } follows from Theorem 1 and Claim 17. An upper bound g(n) ~ 1/2 for any n 2 2 can be seen on the pizza 1100 .. . 00. It remains to show that Alice has a one-jump strategy with gain 1/2 for any pizza PIP2 . . . Pn, where n is odd and 3 ~ n ::; 13. Let n be odd and let 3 ::; n ::; 13. We partition the characteristic cycle V = VI V2 .. • V n into six arcs A, B , ... , E in the same way as in Section 2. We may suppose that each of the six arcs has a positive length, since otherwise Alice has a zero-jump strategy with gain 1P1/2 (by Claim 12). Therefore, as l(A) = l(D) + 1, 1( C) = l(F) + 1 and l(E) = l(B) + 1, and n ::; 13, at least one of the arcs B, D, F has length at most 1 (and hence, exactly 1). Due to the symmetries, it therefore suffices to prove the following claim:
Claim 21. If l(B) = 1 then Alice has a one-jump strategy with gain 1/2. Proof. First we describe a one-jump strategy with gain b+min {c+d, f+a} . Alice's first turn in the strategy is on the only slice of B . Recall that l(E) = l(B) + 1 = 2. Bob can choose between the two slices of E in the
82
J. Cibulka, J. KynCl, V. Meszaros, R. Stolar and P. Valtr
second turn. Alice takes the other slice of E in the third turn of the game . In the rest of the game, Alice makes only shifts, thus collecting slices of some pair of arcs Xl and X 2 such that X lEX2 is a half-circle (see Figure 6). Since none of the half-circles CDE and EFA can be replaced in the triple T by a half-circle of a strictly smaller size, the sum IXll + IX21 achieves its minimum either for Xl = CD and X2 = 0, or for Xl = 0 and X 2 = FA . Thus, the portion collected by Alice in the whole game is at least 91 :=b+min{c+d,f+a}.
By two applications of Observation 11, Alice also has a zero-jump strategy with gain 92 :=max{c+d+e,e+f+a}. One of the two strategies is a one-jump strategy with gain
5. CUTTINGS INTO 15 AND 21 SLICES Here we prove that Bob's cuttings described in Section 3 include all pizza cuttings into 15 and into at most 21 slices where he gets his best possible gain. Theorem 2 implies the minimality of 15 slices as well.
Claim 22. Corollary 18 describes, up to scaling, rotating and flipping the pizza upside-down, all the pizza cuttings into 15 slices for which Bob has a strategy with gain 5IPI/9. Proof. Suppose Bob cuts the pizza into 15 slices so that Alice cannot gain more than 4IPI/9. It follows that p(V) ~ 4/9 < 1/2. By Claim 12, the characteristic cycle can be partitioned into non-empty arcs A, B, C, D , E , F such that ABC, CDE and EFA form a minimal triple. Following the proof of Theorem 1, we assume without loss of generality that a+b+ c ~ c+d+ e ~ e+ f+a and we consider the same three strategies with gains 91, 92 and 93. Combining the assumption 91,92 , 93 ~ 41PI/9 with the inequalities (391 + 492 + 293)/9 ~ (41PI + a + c/2)/9 ~ 41P1/9 we get equalities everywhere. Consequently, 91 = 92 = 93 = 41PI/9 and a = c = O. This, in particular, implies that e + f = b/2 + e/4 + d = f /2 + b = 4IPI/9.
83
Solution of Peter Winkler 's Pizza Problem
Now we show that e = O. Applying Claim 21 three times, we get that = l(D) = l(F) = 2 and l(A) = l(C) = l(E) = 3. Particularly, the length of the circular sequence V' obtained by concatenating arcs Band E is 5. Hence, by Theorem 2, Alice has a strategy with gain b/2 + e/2 on V'. Following the proof of Claim 15 we get a two-jump strategy on V with gain b/2 + e/2 + c + d = tn + e/4 = 41PI/9 + e/4. Therefore e = O.
l(B)
It follows that f = 4IPI/9, b = 21PI/9 and d = 3IPI/9. If one of the two slices in B had size greater than 1P1/9, then by the proof of Claim 13 Alice would have a one-jump strategy with gain greater than 1P1/9 + c + d = 4IPI/9. It follows that both slices in B have size exactly IPI/9. Similarly, using an analogue of Claim 13, we conclude that both slices in F have size exactly 21PI/9 and both slices in D have size at most
2!PI/9. • Lemma 23. Let P = PIP2 ... Pn be a cutting of a pizza into an odd number of slices for which Bob has a strategy with gain 9 ~ 1P1/2. Let x = miniE{1,2,...,n} IPi I and let P' = p~p~ . .. p~ be a cutting of a pizza with slices of sizes Ip~1 = IPil - x. If x > 0, then for the cutting P' Bob has a strategy with gain strictly greater than gIPII/IPI. Proof. Let l: be Bob's strategy for the cutting P with gain 9 ~ 1P1/2. For the cutting P', Bob uses the same strategy l:. In this way he is guaranteed to get a subset Q' c P' of (n -1) /2 slices such that the corresponding subset Q c P has size at least g. Therefore, Bob's gain is
L p~EQ'
Ip~1 =
L
(Ipi\- x) ~ 9 - x(n -1)/2.
PiEQ
Since IPII = IPI - xn, we have to show that (g - x(n - 1)/2) IPI > g( IPI-xn) , which is equivalent to x(n-1)IPI/2 < xng. The last inequality follows directly from the assumptions 9 ~
1P1/2 and x > O.
•
Claim 24. Corollary 20 describes, up to scaling, rotating and flipping the pizza upside-down, all the pizza cuttings into at most 21 slices of at most two different sizes for which Bob has a strategy with gain 5IPI/9. Proof. Let P be a cutting of the pizza into n ~ 21 slices of at most two different sizes for which Bob has a strategy with gain 5IPI/9. If n is even, then Alice has a (zero-jump) strategy with gain IPI/2. If all slices have positive size, then by Theorem 1 and Lemma 23, Bob has no strategy with
84
J. Cibulka, J. KynCl, V. Meszaros , R. Stolar and P. Valtr
gain 5IPI/9. Therefore n is odd and at least one slice in P has size O. So we can without loss of generality assume that each slice has size a or 1. Now we proceed exactly as in the proof of Claim 22, up to the point where we are showing that e = O. After we apply Claim 21 (three times), we only conclude that l(B), l(D), l(F) ~ 2 and consequently l(A) , l(C), l(E) ~ 3. The length of the circular sequence V' obtained by concatenating arcs Band E is then at most 11. The rest of the argument that e = a is exactly the same as in the proof of Claim 22. We also conclude that f = 4IPI/9, d = 31PI/9 and b = 2IPI/9. Since the numbers f, d and b are non-negative integers , their sum must be a positive multiple of 9. Since l(F) + l(D) + l(B) :::; 12 and the size of each arc is bounded by its length, we have IFI = 9, f = 4, d = 3 and b = 2. Consequently, l(F) ~ 4, l(D) ~ 3, l(B) ~ 2 and l(C) ~ 5, l(A) ~ 4, l(E) ~ 3. Since l(A) + ... + l(F) :::; 21, none of these six inequalities may be strict. Therefore A = 0000, B = 11, C = 00000, D = 111, E = 000 and F = 1111. •
6.
ONE-JUMP STRATEGIES
The main aim of this section is to prove Theorem 3. The following corollary proves Theorem 3(a). Corollary 25. Alice has a zero-jump strategy for V with gain 1V1/3. The constant 1/3 is the best possible. Proof. The gain 1V1/3 trivially follows from Observation 11. Let V = 100100100. For every element v of V there is a half-circle C; of size not greater than 1V1/3 covering it. So no matter which element v Alice takes in the first turn, as Alice only makes shifts, Bob can play in such a way that Alice gets Cv . • In the rest of this section we prove Theorem 3 (b).
Solution of Peter Winkler 's Pizza Problem
85
6.1. Lower bound
In this subsection we show the strategy for Alice to gain at least 7/16 of the pizza. We can assume that the number of slices is odd and that p(V) < 1V1/2 (otherwise Alice has a strategy with gain 1P1/2 ~ 7IPI/16). We also fix a minimal triple of half-circles and a partition of V into arcs A, B , C, D , E and F given by Claim 12. We can use the zero-jump strategy with gain equal to p(V) and the one-jump strategies from Claim 13 (and its analogues). It can be shown, however, that these strategies alone guarantee Alice only 3/7 of the pizza. To improve Alice's gain we introduce one more one-jump strategy. Claim 26. Alice has a one-jump strategy with gain 3b/8+e/2+min {c + d, j + a} if p(V) < 1V1/2. Proof. If 3b/8 - e/2 :::; 0, Alice starts by taking a slice from E and then she makes shifts only. As observed in the proof of Claim 13, the potential of any slice in E (and thus Alice's gain) is equal to e + min {c + d, j + a} ~ 3b/8 + e/2 + min{c+ d,j + a}.
For the rest of the proof we assume that 3b/8 - e/2 > 0. The main idea of the Alice's strategy is to start with taking a slice somewhere in the arc B and to jump at some appropriate moment before crossing the boundary of B. Let k = I(B) . For i = 0,1 , .. . k, let B, be the initial sub arc of B of length i. Symmetrically, let B: be the arc containing the last i slices of B. Similarly we define arcs E; and E: for i = 0,1, ... k + 1. For i = 0,1 , ... k, let h(i) = IBil- IEil and h'(i) = IB:I-IE:I. The functions hand h' can be used to measure the difference between Alice's and Bob's gain during the first phase (before Alice decides to jump). We call this difference an advantage of Alice. During the first phase, Alice takes a sub-arc of B and Bob takes an equally long subarc of E. If Alice took B j \Bi and Bob took E j \Ei during the first phase, then Alice's advantage is h(j) - h( i). The other possibility is that Bob took Ej+1 \ E i+1 j equivalently, Alice took B:, \ Bj, and Bob took E i , \ Ej', where i ' = k - i and j' = k - j. In this case the advantage of Alice is h'(j') - h'(i'). By the minimality of the triple that determined the arcs A , B , ... , F , both functions hand h' are non-negative.
86
J . Cibulka., J. KynCl, V . Meszaros, R. Stolar and P. Valtr
Similarly as in the previous strategies, Bob's best choice after Alice's jump is to let Alice take the rest of the arc E and one of the arcs CD or FA . It follows that if Alice's advantage is g, then her gain will be at least 9 + e + min {c + d, f + a}. It only remains to show that Alice can always achieve an advantage greater than or equal to 3b/8 - e/2 . Let i be the largest index such that h(i) :::; 3b/8 - e/2. Symmetrically, Let i' be the largest index such that h'(i') :::; 3b/8-e/2. We distinguish two cases.
Case 1: i + i' :::; k. Equivalently, B, and B~, are disjoint. Observe that we actually have i + i' :::; k - 1. Alice starts by taking any of the slices from B \ iB, UBi')' She jumps as soon as Bob takes the first or the last slice from E. During the first phase either Alice took B j and Bob took Ej for some j ~ i + 1, or Alice took Bj, and Bob took Ej, for some j' ~ i ' + 1. Alice's advantage is 9 = h(j) > 3b/8 - e/2 in the first case and 9 = h'(j') > 3b/8 - e/2 in the second case. Case 2: i + i' > k . Divide the arc B into consecutive arcs B I = Bk-i' , B 2 = B, \ B k-i, and B 3 = B~_i ' Similarly the arc E is divided into I 2 3 E = Ek-i'+1, E = e. \ Ek-i'+1 and E = ELi+I ' Since IE 2 1 ~ IE21-IB2 1 = -( h(i) + h'(i') - (b - e)) ~ b - e - 2(3b/8e/ 2) = b/4, we have min (IEII, IE31) :::; (e - b/4)/2. We can without loss of generality assume that jEll :::; IE31, hence jEll :::; (e - b/4)/2. Note that the arc B I (and hence E I) is non-empty, as IBII ~ IBII - jEll = b - e - (IB~,I-IE~,I) = b - e - h'(i') ~ 5b/8 - e/2 > b/4 > O. Alice now plays as in the proof of Claim 13, where B is replaced by B I and E is replaced by E I. That is, she starts with taking the median slice of B I and jumps as soon as Bob takes the first or the last slice of E I . In this way she gets an advantage 9 ~ IBII/2 _jEll = (IBII-IEII) /2 -IE II/2 = (b - e - h'(i')) /2II/2 IE ~ (5b/8 - e/ 2)/ 2 - (e - b/4)/4 = 3b/8 - e/ 2. •
Remark. By iterating the strategy from Claim 26 we obtain an infinite sequence 2;1,2;2 , ... of one-jump strategies, where 2;k+1 recursively uses 2;k in the same way as the strategy 2;1 from Claim 26 used the strategy 2;0 from Claim 13. These iterated strategies give better gain when the ratio bf e tends to 1. However, if the ratio b/e is smaller than 5/3, the strategies 2;i are beaten by the previous one-jump strategies that start outside the arcs Band E.
87
Solution of Peter Winkler's Pizza Problem
Proof of the lower bound in Theorem 3(b). As in the proof of Theorem 1, we may without loss of generality assume that a + b + c ::; c + d + e ::; e+ f +a. By Observation 11, Alice has a zero-jump strategy with gain 91 := e + f
+ a.
By Claim 15, Alice has a one-jump strategy with gain 92 := b/2 + min {c + d, f + a} = b/2 + c + d.
By an analogue of Claim 15, Alice also has a one-jump strategy with gain 93 := f /2 + min {a + b, d + e} = f /2 + a + b. By Claim 26, Alice has a one-jump strategy with gain 94 := 3b/8 + e/2 + min{c+ d,J + a} = 3b/8 + e/2 + c+ d.
One of these four strategies gives gain max {91,92 ,93 ,94} 2:: (591 + 392 + 493 + 494)/16
= (9a + 7b + 7c +
7d + 7e + 71)/16 = (71 P I + 2a) /162:: 7IPI/16.
•
6.2. Upper bound Claim 27. If Alice is allowed to make only one jump, then Bob has a strategy with gain 9IPI/16. This gain is achieved for the following cutting of the pizza into 23 slices: 20200200202006060050500. Proof. The characteristic cycle V is depicted on Figure 9. The size of the pizza is 32, which means that we need to show that Bob can get slices with the sum of the sizes at least 18. The potential of the cutting is 14, thus Alice has no zero-jump strategy with gain greater than 14. It is easy to check that on the cutting sequence P , every zero slice has a neighboring nonzero slice and both neighbors of every nonzero slice are zero slices. If Alice starts by taking some zero slice, then Bob takes the nonzero
88
J. Cibulka, J. KynCl, V. Meszaros, R. Stolar and P. Valtr
Fig . 9. Characteristic cycle of the cutting used in Claim 27
slice. Alice can then jump, but since she cannot make any more jumps, she would get only at most the potential of V. If she does not jump, she takes a zero slice in her next turn and from Observation 9, Bob can take one of the two arcs. Since Bob already took a nonzero slice, the sum of the sizes of the two arcs is at most 30. If both the arcs have size 15, then both must contain a slice of size 5 because there are no other slices of odd size. But this is impossible because the two slices with size 5 are neighbors on the characteristic cycle. Thus one of the arcs has size at most 14 and if Bob chooses the other one, he gets 18 for the whole game. Now we may assume that Alice starts by taking a nonzero slice. In his first turn, Bob takes a zero slice such that Alice cannot take a nonzero slice in the next turn. In the first phase , Bob makes shifts. The first phase ends after Alice's jump or if Bob's shift would allow Alice to take a nonzero slice in her next turn.
If Alice jumped in the first phase , she would get at most the slice from her first turn plus the potential of one of its two neighbors from the cutting sequence P. But it is easy to verify that this would mean a gain at most 14 for Alice. If Alice did not start in V4 or in VlO and did not jump, then it is easy to verify that after the first phase, one of the two Bob's zero-jump strategies from Observation 9 guarantees Bob gain 18. If Alice started in VlO and the first phase did not end by Alice's jump, then Bob continues making shifts until either Alice jumps or his shift would allow Alice to take the VIS slice in her next turn. This is the second phase. If Alice jumped during the second phase then Bob can make sure that she gets at most IVlOl + IVI41 + IV41 + IV51 = 12, see Figure 10 (left)) . If she did not jump until the end of the second phase , then from Observation 9,
89
Solution of Peter Winkler's Pizza Problem
Bob can make sure that Alice gets at most IVIOI Figure 10 (right).
+ IVI41 + IV91
14, see
b)
a) Fig. 10. Two examples of games starting in
V10 illustrating how Bob can prevent Alice from gaining more than 14
If Alice started in V4 and the first phase did not end by Alice's jump, then Bob starts the second phase by making a jump and then only shifts. The second phase ends after Alice's jump or if Bob's shift would allow Alice to take V9. If Alice jumped during the second phase then Bob can make sure that she gets at most IV41 + Ivsl + IVISI + IVI91= 14, see Figure 11 (left). Otherwise we use Observation 9 to show that Bob can make sure that Alice gets at most IV41 + Ivs l + Ivai + IVI I = 8, see Figure 11 (right) . •
a)
b)
Fig. 11. Two examples of games starting in
V4 illustrating how Bob can prevent Alice from gaining more than 14
90 7.
J. Cibulka, J. Kyncl , V. Meszaros, R. Stolar and P. Valtr ALGORITHMS
7.1. Linear Algorithm In this section we describe an algorithm proving Theorem 6. For a given cutting of the pizza with n slices, the algorithm computes Alice's two-jump strategy with gain 4jPj/9 in time O(n). Without loss of generality we may assume that IVI is a part of the input. The algorithm first computes consecutively the sizes of all n halfcircles and finds a half-circle of minimum size in the following way. Consider the characteristic cycle V = VOVI ... Vn-l. For i = 0 to n - 1 let Si be the variable in which the size of the half-circle with starting point Vi, continuing in clockwise direction, is stored. Let S be the size of a currently minimal halfcircle H , and V the starting point of H. In the initialization step, compute So := l:;:~I)/2Ivjl and set S := So and V := Vo. Then for i = 1,2, .. . , n -1 , compute Si := Si-l -lvi-I I + hn+2i-I)/21. If Si < s , then set S := s; and The above computations can be done in time O(n).
V := Vi .
After t hese precomputations we get a half-circle H of minimum size that we fix. Let Vk and Vk+ (n-3 )/2 be the two uncovered elements neighboring H on V. In the following the algorithm computes the potentials of the elements of the uncovered arc X = Vk .. . Vk+ (n-3 )/2' Any half-circle covering an element Vi of X also covers Vk or Vk+(n-3)/2 ' Let the right potential of Vi be the minimum of the sizes of half-circles covering both Vi and v k+ (n - 3)/ 2' The algorithm computes the right potential Pr for Vk by comparing the values of Sk- l and Sk, i.e., Pr(Vk) := min {Sk-l, Sk}. For i = k + 1 to k + (n - 3)/2 set Pr(Vi) := min {Pr(Vi -I), Analogously let the left potential of Vi be the minimum of the sizes of half-circles covering both Vi and Vk. The computation of the left potentials PI is similar. Obviously the potential of Vi is min {PI(Vi),Pr(Vi)}' The computations are done in time O(n) .
sd.
The potential of any element of X is at least as big as the potential of any element of H due to the minimality of H . Therefore p(V) is equal to the maximal potential on X. If p(V) ~ IVI/2, then the algorithm returns an element of potential p(V) in time O(n). This will be Alice's first turn and all her other turns will be shifts that can be computed in time 0(1). From now on we assume that p(V) < IVI/2. The algorithm finds the index j E X for which PI(Vj) + Pr(Vj) is minimal among all j such that
Solution of Peter Winkler's Pizza Problem
91
both PI (Vj) and Pr(Vj) do not exceed p(V). There exists such a j E X as a consequence of Claim 10 and Claim 12. Let HI be the half-circle that gives the left potential PI(Vj) for Vj, and H 2 the half-circle that gives the right potential Pr(Vj) for Vj' Then H , HI and H 2 form a minimal triple. Indeed, suppose that there is a half-circle in the triple that can be replaced by a half-circle of strictly smaller size. Clearly, this half-circle is not H but HI or H2. A contradiction to the choice of j . We get that the triple is minimal. Knowing the minimal triple the algorithm computes A, B , G, D, E , F and V' in time O(n). If p(V') 2': lV'I/2, a slice of potential p(V') can be found in time O(n) . Otherwise, the algorithm computes the arcs A', B' , G', D', E', F' on V' similarly as above in time O(n) . A median slice of B' can be found in time O( n) by traversing B' twice. At first the algorithm computes IB'I. Then it adds the sizes of the elements one by one again and checks in every step if the sum exceeds IB'I/2. That will occur at a median slice. The algorithm orders a+b+c, c+d+e and e+ f +a. Assume without loss of generality that a + b + c ::; c + d + e ::; e + f + a. According to Section 2.5 Alice has three strategies with gains gi := e + f + a, g2 := b/2 + e/4 + c + d and g3 := f /2+cJ.4+a+b . These strategies were computed in time O(n) as described above. Alice chooses one of the three strategies corresponding to max {gI ,g2,g3}. Once the strategy is known, Alice's turn can be computed in time 0(1) in any position of the game.
7.2. Optimal strategies The following result implies, for example, that Alice can be forced to make only jumps (except AI, An) in her optimal strategy. Observation 28. (i) For any odd n 2': 3 and for any of the 2n - 2n permutations allowed in the game on n slices, the pizza can be cut into n slices in such a way that if both Alice and Bob make only optimal turns then the order of taken slices is the chosen permutation.
(ii) For any even n 2': 4 and for any of the 2n - 3n plausible permutations in which Alice's second turn is a jump, the pizza can be cut into n slices in such a way that if both Alice and Bob make only optimal turns then the order of taken slices is the chosen permutation. Proof. We give the sizes 1,1/2,1/4, . .. in the order in which we want the slic es to be taken.
_
92
J. Cibulka., J. Kyncl, V . Meszaros, R. Stolar and P. Valtr
Now we describe an algorithm that computes both player's optimal strategy for a given cutting of the pizza with n slices in time O(n 2 ) . Proof of Claim 7. A position of a game is an arc X characterized by its leftmost slice x; and its rightmost slice x; or the empty-set if there are no more slices left. If l(X) = 1, then x; = X r . There are n 2 - n + 2 possible positions X. The parity of l(X) determines whose turn it will be. For i = 0 to n - 1 the algorithm traverses all X with l(X) = i and decides the best strategy for the player on turn. The best possible gain on X is the value of X , denoted by v(X). The algorithm stores v(X) for all positions X . For i E {O, I} the strategy is obvious and v(X) = IXI. Let X - X be the arc X omitting the slice x. For i ~ 2, v(X) = IXI- min {v(X - Xj),v(X - xr ) } and the player takes the corresponding slice yielding the minimum in the previous expression . All this can be done in time O(n 2 ) . A program implementing the algorithm described above can be downloaded from the following webpage: http://kam.mff.cunLczrcibulka/pizza. The program can be used to verify Claims 17, 20 and 27. •
Acknowledgments. We thank Peter Winkler for posing this problem and for the discussions. The third author thanks Dirk Oliver Theis for the discussions about the upper bound during Fete of Combinatorics and Computer Science in Keszthely, August 11-16, 2008. We also acknowledge the use of the LPSolve IDE [2J software , which made our computations much more efficient.
REFERENCES
[IJ J. Cibulka , J . Kyncl, V. Meszaros, R. Stolar and P. Valtr, Generalizations of Peter Winkler 's Pizza Problem, in preparation. [2] H . Gourvest , LPSolve IDE v5 .5, http://www.progdigy.com
M. Berkelaar, J. Dirks, K. Eikland and P. Notebaert, lp...solve 5.5, http://lpsolve.sourceforge.net/5.5 [3]
K. Knauer, P. Micek and T . Ueckerdt, How to eat 4/9 of a pizza, manuscript.
93
Solution of Peter Winkler's Pizza Problem
Josef Cibulka, Rudolf Stolar Department of Applied Mathematics, Charles University, Faculty of Mathematics and Physics, Malostronske tuim . 25, 11800 Praha 1, Czech Republic e-mail: cibulka~kam.mff.cuni.cz ruda~kam.mff . cuni . cz
Jan Kyncl, Viola Meszaros, Pavel Valtr Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University , Faculty of Mathematics and Physics, M olostromske tuim . 25, 11800 Praha 1, Czech Republic e-mail:
Viola Meszaros Bolyai Institute, University of Szeged, Aradi vertanuk tere 1, 6720 Szeged, Hungary e-mail:
viola~ath.u-szeged.hu
kyncl~kam.mff.cuni .cz
Fete of Combinatorics, pp. 95-137.
BOlVAI SOCIETY MATHEMATICAL STUDIES, 20
TIGHT BOUNDS FOR EMBEDDING BOUNDED DEGREE TREES
BELA OSABA*, IAN LEVITT, JUDIT NAGY-GYORGY and ENDRE SZEMEREDIt
Let T be a tree on n vertices with constant maximum degree K . Let G be a graph on n vertices having minimum degree o(G) ~ n/2 + CK logn, where CK is a constant. If n is sufficiently large then T C G. We also show that the bound on the minimum degree of G is tight.
1.
INTRODUCTION
In this paper we will only deal with simple graphs, without loops or multiple edges. Given a graph F = (V, E), and U C V, the subgraph of F induced by the vertices of U will be denoted by Flu' The degree of a vertex v E V(F) is denoted by degF(v), or by deg (v) if F is clear from the context. The minimum degree and maximum degree of F will be denoted by 8(F) and 6.(F), respectively. We will let N(v) represent the neighborhood of a vertex v, hence deg (v) = N (v) The number of vertices in a graph F is written v(F) , and the number of its edges is e(F) . If A, B c V(F) , then e(A, B) is the number of edges of F with one endpoint in A and the other endpoint in B, and e(A) = e(A , A) = e( FIA) ' For a tree T we denote the set of its leaves by £(T).
I
I.
Given a bipartite graph H , a proper 2-coloring of H is a 2-coloration of the vertices of H such that adjacent vertices of H get different colors. "Partially supported by th e Office of Sponsored Programs at WKU and the OTKA grants T049398 and K76099. tpartially sup p orted by the Ellentuck Fund.
96
B. Csaba, I. Levitt, J . Nagy-Gyorgy and E. Szemetedi
For graphs J and F , we will write J c F if and only if there exists an adjacency preserving injection I : V{J) -+ V{F). If I{x) = v then we say that x maps onto v and that v is covered by x, If a vertex of F is not covered by any vertex of J then we call it uncovered. Throughout the paper we use a « b to denote that a is sufficiently smaller than b. Our goal is to show the following:
Theorem 1. Assume that T = (V, E{T)) is a bounded degree tree on n vertices with f1{T) = K . Let G = (W,E{G)) be a graph on n vertices. Assume that its minimum degree , <5{G) ~ n/2 + CK logn where CK is a constant depending only on K . Then there exists no such that T C G for n ~ no . Furthermore, the bound on <5 (G) is tight: there exists a graph G with <5{ G) > n/2+ log n/17 such that the complete ternary tree on n vertices is not a subgraph of G if n is sufHciently large. Bollobas [2] conjectured that if G is a graph on n vertices, <5{G) ~
{1/2+c)n for some e > 0, and T is a bounded degree tree on n vertices, then T C G. The problem was solved in the affirmative by Komlos , Sarkozy and Szemeredi [3] for large graphs. They then strengthened their result (see [4]), and showed, that f1{T) need not be bounded: there exists a constant c such that T C G if f1{T) ::; cn/logn, <5{G) ~ (1/2 + c)n and n is large . Both proofs are based on the Regularity Lemma - Blow-up Lemma Method. In this paper we eliminate the use of the Regularity Lemma under the original assumption that f1{T) is bounded. As a result the threshold no is much smaller, but more importantly, we prove a stronger statement than the original conjecture. Indeed, in Theorem 1 <5{G) - n/2 can be as small as O{logn), and o{logn) is not sufficient. We may assume that G is minimal with respect to edge deletion, retaining the property that <5{G) ~ n/2 + CK logn. In particular, there are no edges xy E E{G) such that both vertices x, y have degree larger than n/2 + CK logn. We divide the problem into two subproblems, depending on whether G is extremal or non-extremal. We call G ,-extremal for, > 0 if either G or its complement G contains a subgraph on n/2 vertices with at most ,n2 induced edges. Otherwise G is -y-non-cxtremal. Let, = K- 20 . We first prove the statement for ,-non-extremal graphs, then for -y-extremal graphs.
In each case we will construct the adjacency preserving mapping I : V -+ W step by step. It is worth noting that while at any time in the course of embedding we have an adjacency preserving partial mapping, the
97
Tight Bounds for Embedding Bounded Degree Trees
final I is not necessarily an extension of it . It is possible that we rethink the way we mapped certain subtrees. In the last section we show that for complete ternary trees the log n additive term in the minimim degree of G is necessary in case G is a suitably defined extremal graph. Let us remark that studying some cases of trees having larger degrees suggest that one needs the minimum degree <5(G) 2: n/2 + C.6.(T) logn, up to the point when the tree has maximum degree en/ log n for some positive constant c. Throughout the paper we make no attempt to optimize on the absolute constants.
2.
THE NON-ExTREMAL CASE
The case of non-extremal G is divided into two sub cases depending on the structure of T. It is shown below that T has either a small subtree with many leaves, which we call a broad subtree , or it has a large subtree with few leaves, called a long subtree. Specifically, Tb is a broad subtree of T if £(Tb) c £(T), V(Tb) ~ ,5 n /K2 and 1£(n)1 2: ,7n. We call 11 c T long if £(11) c £(T), v(1I) > ,5 n /K3 and 1£(11)1 < ,7 n . We use a simple method to decide which case applies.
2.1. Some tools for the proofs in the non-extremal cases
Definition 1. Assume that we are given a rooted tree F with root p. Let x and y be any two vertices of F. We say that y is below x if the simple path connecting y with p goes through x . Let F(x) denote the subtree rooted at x containing every vertex which is below x. Sometimes we will call x the tip of the subtree F(x). We turn to the method of determining whether T has a broad or a long subtree. First, (temporarily) designate a root p E V(T) . Repeat the following for every x E V(T): color x blue if 1£(T(x)) 2: n , otherwise color it red . If p is red, then T itself is long. If not, then T must have a blue vertex x such that all of its children are red. If v(T(x)) ~ ,5 n/ K 2 then T(x) is a broad subtree and we let Tb = T(x). If v(T(x)) > ,5n/ K 2
I
,7
98
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
then one of its red children, y, is such that long subtree, and we let 1/ = T(y) .
,5
v(T(y)) > n/ K3. T(y)
is a
,n
Observe that if G is not ,-extremal, then it has many triangles: there 2 edges in the neighborhood of every vertex, since these are at least neighborhoods are of size larger than n/2. As any such edge is in a triangle, summing over vertices will count each triangle three times. We find that 3 there are at least /3 triangles in G.
,n
We record here a simple statement, which is also very useful throughout the proof:
Lemma 2. Let H be a tree of size m. If J is a graph with fJ(J) ~ m, then there is an embedding of H into J . If J' = J'(A, B) is a bipartite graph such that every bE B has at least m/2 neighbors in A and every a E A has at least m neighbors in B then H C J' . Proof. We leave the proof of the first part to the reader. For the second part we remark that H is 2-colorable, and one of its color classes has size at most m/2. _ We will frequently apply the following folklore statement (proof is omitted):
Lemma 3. Every graph H has a subgraph H' such that
fJ(H')
~
e(H)/v(H).
_
Remark 1. We will frequently use the above two lemmas in the following way: whenever we find a dense subgraph in the uncovered part of W, we can find a subgraph of it with large minimum degree into which we can map a large subtree of T . Let F ments:
= F(A, B) be a bipartite graph satisfying the following require-
• IAI = t •
')'-3
and
IBI = t 2 ,
«t,
• every bE B has at least (1/2 + ')'3)t neighbors in A. Then we have the following Cleaning Lemma.
99
Tight Bounds for Embedding Bounded Degree Trees
Lemma 4 (Cleaning lemma - first version). F has a subgraph F' = F'(A', B') such that A' c A, B' c B, every s « B' has at least (1/2+,3/2)t neighbors in A' and every a E A' has at least t neighbors in B' . Proof. First we assume, that every vertex in B has exactly (1/2 + ,3)t neighbors in A - if necessary, we discard edges incident to those vertices of B which have larger degrees. Then we have e(F) = (1/2 + ,3)t3. We will find the desired subgraph F' step-by-step in the following way. Let Al = {a E A : IN(a)nBI < t}, and let B 1 = {b E B : N(b) n (A - AI) (1/2 +,3 /2)t}. In the first cleaning step we delete the vertices of Al from A and the vertices of B 1 from B. Removing these vertices deletes at most IA 11t + 2IA 1It(1/2 + ,3);'3 edges from F. In the ith cleaning step we first identify a subset Ai C A - u~-=-=i A j and
I
I ::;
a subset B, C B - u~-=-=i B j :
and
e(A-t , B - Ui.- 1 B ·) .I < 2 IB t
-
,
3t
)=1)
<
t 2lA-I _
,
3'
Deleting the vertices of Ai and B, therefore removes at most IAiit + 2IAil(1/2 + ,3)t/,3 edges. Let us assume that after k cleaning steps the cleaning process stops: either every vertex left satisfies the degree requirements of the lemma, or there are no vertices left. The total number of edges we lose from F is at most
We must have the former case, as most of the edges are still present when the process stops. The induced subgraph on A-U~ Ai and B-U~ B, will be denoted by F', and is easily seen to satisfy the requirements of the lemma.
•
100
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemetedi
For the second version of the Cleaning Lemma we assume that F satisfies the following: • IAI = t and IBI = t 3 ,
•,-4 «t, • every b E B has at least (1/2 - ,4)t neighbors in A . While the setup is somewhat different, the proof of the Lemma is very similar to that of the first version, we omit the details: Lemma 5 (Cleaning lemma - second version). F has a subgraph F' = F'(A', B') such that A' c A , B' c B, every bE B' has at least (1/2 - 2,4)t neighbors in A' and every a E A' has at least t 2 neighbors in B'. •
Randomly choose three disjoint subsets from W , denoted by D 1 , D 2 and M, with sizes ID11 = ID21 = ,8n, and IMI = ,IOn. The common size of the DiS will be denoted by 8. We make three assertions regarding these sets: • Every u E W has at least 8/2 - O( Jnlogn) neighbors in the and IMI/2 - O( In log n) neighbors in M with high probability.
DiS
• If G is ,-non-extremal, then the subgraphs induced by D 1 , D2 and M
will be , /2-non-extremal with high probability. • The induced bipartite subgraph on Dl and D2 will be , /2-nonextremal with high probability. That is, if A c D 1 , B C D 2 , each of size 8/2, then there are at least ,8 2/2 edges between A and B. The proofs of these statements are straightforward. We sketch a proof of the non-extremality of Ds, We demonstrate that the induced subgraph on D1 cannot have a sparse subset of size 8/2. The analogous statement, that the complement of the above induced subgraph cannot have a large subset with a few edges can be proved similarly. It is a simple exercise that if G is not extremal, then any set U for which Va,b E U, IN(a)UN(b)1 ~ (1/2+,)n cannot contain more than (1/2-,)n vertices. Conversely, if G were extremal, it would contain a set U of size n/2 and an element a E U such that IN(a) U N(b)1 :::; (1/2 + ,)n for all but at vertices b E U. Let A C D; be any set of size 8/2. If:Ja E A such most that IN(a) U N(b) I :::; (1/2 + ,)n for most b E A then with high probability about half the vertices of W (G) would have almost the same neighborhood
,n
Tight Bounds for Embedding Bounded Degree Trees
101
as a has. But that would imply the extremality of G. Thus, with high probability, a set A C D 1 of size 8/2 will have the property that for many pairs of vertices a, b E A,
I(N(a)UN(b))
nD11
~ (1/2+,)8-0(Vn log n ) .
It follows that for most pairs of vertices, I(N(a)UN(b)) nAI ~ ,8/2. Thus A is dense. Lemma 6. Let G be a non-extremal graph, and D 1 , D 2 be as above. Then there is a perfect matching in the bipartite subgraph of G induced by D 1 and D 2 •
Proof. We will check the Konig-Hall conditions. Since every u E W has at least 8/2-0(n) neighbors in D2, every He D 1 such that IHI :::; 8/2-,28 will have a neighborhood of size at least IHI in D 2 . Assume that IHI > 8/2-,28. If D2 had a subset H of size 8/2 - ,28 such that e(H, H) = 0, then the induced bipartite subgraph on D 1 and D2 would be extremal - if we complete Hand H by adding at most ,28 new vertices to both, the number of newly added edges is not more than 2,282 « ,8 2/2. Hence every H C D 1 having size at least 8/ 2 - ,28 has a neighborhood of size at least 8/2 + ,28 in D 2. We finish by noticing that every vertex in D2 has 8/2-0(n) neighbors, therefore, if H c D 1 is larger than 8/2 + o(n) then it is neighboring with the whole D 2 . • The following corollary is used to handle a small modification of the bipartite subgraph from Lemma 6.
Corollary 7. Discard at most ,2 8 vertices from D2, replacing them with arbitrary vertices which all have at least IDd/2 - o(n) neighbors in D 1 . Then the resulting new graph has a perfect matching. Proof. The proof of Lemma 6 is based on two facts: the first is that every vertex in the bipartite graph has at least 8/2 - o(8) neighbors in the other color class, the second is that the bipartite subgraph induced by D 1 and D 2 is non-extremal. Since every vertex of G has at least 8/2 - 0(8) neighbors in D 1 , if we replace ,2 8 vertices of D 2 by any ,2 8 vertices, the first condition will remain satisfied. For the second observe, that the modified bipartite graph will be , /3-non-extremal, since we lost at most ,2 8 2 edges between any two subsets of size 8/2 when discarding ,28 vertices from D 2 • •
102
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
Lemma 8. Assume that G is non-extremal and u, v E W . Then there are at least ,n/5 vertex disjoint paths of length 3 connecting u and v.
I
Proof. Set a = N(u) n N(v)l . If a ~ n/2 - ,n/2 then, by the nonextremality of G, there are at least ,n2/2 edges in N(u) n N(v) . One can therefore find ,n/2 vertex disjoint edges in N(u) n N(v), determining ,n/2 vertex disjoint paths of length 3 between u and v. At the other extreme, if a ~ ,n/2 then there are at least ,n2 edges in N(u) induced by G, again since G is non-extremal. If v'is the endpoint of an edge in GIN(u)' then it has a neighbor in N(v). It follows that there are at least ,n2 /2 edges between N (u) and N (v), and we can easily find the vertex disjoint paths of length 3 between u and v. Assume now that ,n/2 ~ a ~ n/2 - ,n/2. Then the number of edges connecting N(u) n N(v) with N(u) U N(v) is at least a(n/2 - a) ~ ,n2/5. From these one can easily choose ,n/5 vertex disjoint edges to yield the desired vertex disjoint paths of length 3. •
2.2 . The first non-extremal case: T has a broad subtree 2.2.1. Preparations Finding distinguished leaves. Recall that neT is a broad subtree with £(Tb) c £(T), I£(n) I ~ '-y7 nand v(n) ~ n/ K 2. We choose the tip of Tb to be the root ofT, and denote it by r , As T has bounded degree, we can easily find s = n subtrees of Tb' denoted by {FI' F2, ... , Fs}, such that each F; has depth 4, and for each i, i . the dist ance between Fi and Fj is at least 4. Furthermore, for each 1 ~ i ~ s we distinguish a leaf ai E £(Fdn£(Tb) which is at depth 4. The immediate ancestor of ai is denoted by P(ai) and the root of Fi is called A(ai)' Observe that P(ai) is distance three from A(ai)' Denote the set of distinguished leaves by S = {aI, a2,' .. , as}. We will map P(al), P(a2),"" P(a s), aI, a2, ... ,as in a special way. In particular, we will map the P(ai)s to the vertices of D I , and most of the aiS to D2.
,5
,8
Embedding Ti: We start the embedding of T by that of Ti: We first map the A(ai)s into W - (D I U D2 U M) arbitrarily, and the P(ai)s into D I arbitrarily. Using Lemma 8 we find vertex disjoint paths of length 3 connecting I (A(ai)) with I ( P(ad), such that these paths avoid D2 and M , and contain vertices from DI only as an endpoint. We then finish the embedding of Ti; avoiding M U D2. Since Tb is very small and the minimum
103
Tight Bounds Eor Embedding Bounded Degree 'frees
degree is large in G\ (M U D2) , we can easily embed in a bottom-up fashion from the A(ai)s towards r and top-down from the A(ai)s towards the leaves. We delay the embedding of S until the end. Observe, that with the above we have determined I on V(n) - s.
n.
n
2.2.2. Decomposition of T Our goal is to decompose T into subtrees of constant size such that most of the vertices are in good subtrees. We call a subtree in the decomposition good if there are at most two edges which connect it to other subtrees. We make the following claims, whose proofs are left to the reader: Claim 9. Let F be a tree. The number of vertices of F having degree at most two is at least v(F)/2. Claim 10. Let F be a tree. There are at most :(~J vertices which have degree at least a . The basic building block of the decomposition algorithm is simple. Observe that given a rooted tree F with maximum degree K and an integer h ~ v(F) one can find a vertex x E F such that h ~ v(F(x)) < Kh. Decompose F by trimming off subtrees recursively as long as there are at least (K + 1)h vertices not yet part of the decomposition. When the process stops, the remaining connected component comprises the final subtree in the decomposition. We call such a decomposition of F into subtrees all having size in the range [h, (K + l)h] an h-decomposition. Construct an auxiliary tree F whose vertex set is the set of the subtrees in the decomposition of F, and for which two vertices are connected iff there ~ an edge between the corresponding subtrees. By applying Claim 9 to F, we conclude that at least v(F)/(2(K + 1)) vertices of F are in good subtrees. We want to discard those subtrees of the decomposition which have many neighbors in F. Call a subtree bad if the corresponding vertex has degree larger than 2K,-10 in F . By Claim 10 F has at most v(F)/(2K,-10-2) bad subtrees. It follows that the total number of vertices of F in bad subtrees is at most v(F )/ 2.
,lO
Set m = 3(K + 1) log,-lO and let hI > h2 > ... > hm be a sequence of integer constants, such that hI = ,-40(4K3, - IO) m, and hi/hi+! = 4K 3 , - 1O . For the full decomposition of T - Tb' we iteratively determine hi-decompositions of smaller and smaller subtrees. In the process, we define a sequence of connecting edge sets, the first of which is E I = 0. First, find
104
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
n
an hI-decomposition of T and take the union of T - Tb with E 1 . The set of subtrees in the hI-decomposition is divided into three sets - the good, the bad, and the active. Good and bad subtrees are as defined above, and the remaining subtrees are called active. Let Ez be the edges connecting the subtrees of the decomposition. For each active subtree F we find an hz-decomposition of F . We determine the hz-good subtrees of this decomposition as those which are connected to at most 2 other subtrees of F, noting that they may also be connected through edges of Ez to the larger decomposition . The bad subtrees determined by the decomposition of F are those which are connected to at least 2K ,-10 other subtrees, either within F or through E z. The rest of the subtrees are considered active for the next iteration. Having found an hz-decomposition of all of the active subtrees, define E3 to be the edges connecting all of the subtrees thus far determined - i.e. E3 is the union of Ez and the edges connecting the subtrees of the all of the hz-decompositions of the active subtrees from the previous step. . In general, after finding the hi-decomposition of every active subtree from the hi_I-decompositions and distinguishing the hi-good, the bad, and the active subtrees as before, we define E; to be the union of E i- 1 and the set of edges connecting the subtrees of the hi-decompositions. We stop after the m th iteration. We are interested in subtrees that are good in the entire decomposition . We claim that the number of vertices in such good subtrees is at least (1 - ,1O)v(T - Tb) ' Indeed in the i t h step, having decomposed an active subtree into N subtrees, at least N /2 of them are hi-good. Since E; has at most 2K,-10 edges which are adjacent to the decomposed active subtree, at most 2K,-lO of the hi-good subtrees out of N/2 are not good overall. By the definition of the hi at least N /3 subtrees will remain good, and these will contain at least hd3(K + 1) vertices of the decomposed active subtree. That is, at every step we gain a proportion of 1/ (3(K + 1)) for the new vertices in good subtrees. Since (1-1/(3(K + 1)))m::; ,10/2, in the ~nal decomposition at most ,1Ov(T - Tb) vertices are not in good subtrees, and every subtree has size between ,-40 and ,-40(4K3,-1O) "'. Certain good subtrees won't be easy to handle later. Consider a good subtree T which is connected to two other subtrees in the decomposition such that these two connecting edges have a common endpoint x in T. In order to eliminate this problem we do the following. First, delete T
105
Tight Bounds for Embedding Bounded Degree Trees
from the set of good subtrees. Let Yl, Y2, . .. ,Ys denote the neighbors of x in l' and let T(Yl) ,T(Y2),. , . ,T(ys) denote the subtrees of l' originating from Yl,Y2,."'Ys, respectively. Ifv(T(Yd) > ,-20 then T(Yi) will be a good subtree, otherwise it will be bad . Since v(T) 2 ,-40 and at most (K - 1),-20 vertices are put into the set of bad subtrees, we still have at least (1 - ,IO)v(T - n) vertices in good subtrees.
n
by 1'1,1'2, ... ,Tl. Each good subtree Denote the good subtrees of T i; has bounded size, there are at most two edges which connect the good subtrees to any other subtree in the decomposition, the endpoints of these connecting edges always differ, and the vast majority of the vertices are in the union of the good subtrees.
2.2.3. Sketch of the embedding algorithm. We map large subtrees of T - Tb one-by-one using the Main Mapping Procedure, discussed below. This procedure works smoothly until about half of T is mapped at which point we are faced with problems satisfying the key constraint of the Main Mapping Procedure, namely that the uncovered vertices of G contain a large subgraph with a non-negligible minimum degree. If the set of uncovered vertices is too sparse, then we rethink the way we mapped certain subtrees. We will rearrange the mapping of some subtrees in such a way that we use many uncovered vertices, and the new set of uncovered vertices contains a large dense bipartite graph, which we use to continue the embedding of T.
n
When at most ,IOn vertices are left out from T - Ti, we can easily finish the embedding.
2.2.4. Finishing the embedding of T. Let us assume that we have already mapped most of T, only the vertices of S and a few subtrees, Tl' T 2 " , . , Tk are left unmapped, such that I U Tjl ~ ,2 8. Set T* = T (UTjUS). We embed the Tj into D 2 , easily accomplished as D 2 is a randomly chosen subset of W, and ID2 1 = 8 ~ ,2 8. A perfect matching between D; and D2 - I(UTj) U (W - (I(T*) U D2)) is ensured by Corollary 7 and determines the rest of the embedding. Indeed , as D; is covered by the P(ad, we map ai to the vertex matched to I(P(ai)). Hence, if we can map most of T such that we avoid D 2 , we can finish the embedding of T. In the leftover of this section we will work so as to achieve this goal.
106
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemerooi
2.2.5. The Main Mapping Procedure. The method below is used to map large chunks of T into G one-by-one. We apply it throughout the embedding. Assume that we are in t~e course of the embedding. Suppose that the leftover of T has a subtree T of the following type: its root is the already mapped vertex y, y's children are Yl, Y2, . .. ,Ym (m ::; K), the children of the YiS is the set {Tl' T2, " ., Td, and there is a tree T j of constant size originating at Tj for every 1 ::; j ::; f . Denote by H a subset of those vertices of W - (M U D1 U D2) which have not yet been covered by a vertex of T. Assume that every vertex of H has at least v ('T) neighbors in H . Then we claim the following:
,-2
Lemma 11. Assume that the above conditions are satisfied. If M has at least (1-,/10)IMI vacant vertices, then I can be extended to the vertices of T such that I(Yi) E M, I(Tj - Tj) C H, and I(Tj) EM for every 1 ::; i ::; m and 1 ::; j ::; f . Proof. Let us denote the set of already covered vertices of M by X, then IXI ::; ,IMI/lO. Since M is a randomly chosen set, IN(I(y)) n(M -X)I ;::: (1/2 - ,/9) IMI. Let us define the set U = {u : u EM-X, IN(u) nHI
;::: ,2IHI}.
Again, as M is randomly chosen, every vertex of H has at least (1/2 ,/9)IMI neighbors in M - X. Simple computation shows that lUI ;::: (1/2 - ,/8)IMI . Since the induced subgraph on M is ,/2-non-extremal, there are at least ,IMI 2/5 edges in between U and N(I(y)) n (M - X) . Then we map the YiS to such vertices in N(I(y)) n (M - X) which have at least K 2 neighbors in U. If YiTk is an edge in T, then Tk will be chosen among the neighbors of I (yd . It is possible to embed the remaining small Tj subtrees in H due to the assumed minimum degree of H. •
Remark 2. We remark that when embedding such a subtree, we cover less than K 2 vertices from M . Therefore, if one embeds at least ,-12 vertices in each application of the Main Mapping Procedure, less than ,IMI/lO vertices of M will be covered throughout the embedding. Remark 3. We will apply the Main Mapping Procedure throughout the embedding. Whenever the set of vacant vertices contains a large dense subgraph, then by applying Lemmas 2 and 3 we can embed a new subtree from the leftover of T.
107
Tight Bounds for Embedding Bounded Degree Trees
2.2.6. The Second Mapping Procedure. Let Q denote the set of those vertices of W - (M U D1 U D2) which have not yet been covered by a vertex of T . In the Main Mapping Procedure we needed that every vertex in H has many neighbors in H. This time we allow Q to be very sparse, but assume that IQI > ,.,l°n. The goal is to replace some of the covered vertices of G by those in Q in such a way that we gain a dense subgraph in the new Q. Let T' c T denote the portion of T that has already been embedded. Assume that T' has a subtree T with the following properties: (i)
T as a subtree of T'
(ii)
ITI = t, where ,-20:::; t :::; hI = ,-40( 4K3,-10) 30(K +l ) log
has exactly one neighbor in T' -
T; ')'-1 ;
(iii) The number of vertices of Q with degree at least (1/2 + ,3)t into at least t 2 .
T is
If the above is satisfied, we call T a remappable subtree. Notice that if there are many edges from Q to a good subtree T such that T is connected to T' by one edge, then T is remappable.
I
Let Z = {z E Q : N( z) n I(T)I ~ (1/2 + ,3)t}, and construct the bipartite graph F = F(A , B), where A = I(T) and B c Z such that IBI = t 2 . We connect a E A and b E B by an edge if they are adjacent in G. We apply the first version of the Cleaning Lemma to find a subgraph F'(A', B') c F(A, B) such that A' c A , B' c B , every b E B' has at least (1 + ,3)t/2 neighbors in A' and every a E A' has at least t neighbors in B'. We apply Lemma 2 to find a mapping of Tonto F' such that at most t/2 vertices of the new mapping cover vertices from A = I(T) and the rest cover vertices from B. We re-embed T using vertices from M as in the Main Mapping Procedure, but we do not map a new subtree seemingly it is a loss. On the other hand, there is a leftover bipartite graph F"(A" , B") c F(A, B) , where A" c A and B" C B, IA"I ~ t/2 and IB"I ~ t 2 - t, and every vertex of B" has at least ,3t neighbors in A". This dense bipartite subgraph can then be used to map a new unmapped subgraph of T by applying the Main Mapping Procedure. As is discussed in Remark 3, by Lemma 3 we are able to use F" in order to map a subtree of size at least ,-17/2. That is, we cover overall at most 2K2 vertices of M by the two applications of the Main Mapping Procedure, but map a new subtree which is of size at least ,-17/2. The restrictions on the speed with which vertices of M are mapped are respected.
108
B. Csaba, I. Levitt, J. Nagy-Gyorgy and E. Szemetedi
Good subtrees in the decomposition of T - n may be connected to two other subtrees. Therefore we consider substituting (i) by (i')
T c T'
has exactly two neighbors in T' -
T.
We show how to remap such a subtree. First, denote the two vertices of T which have neighbors in other subtrees by x and y, recalling that x =J y . Denote the neighbors of x and y in the adjacent subtrees by Zl and Z2 , respectively. If the distance between x and y is at most three then we map the whole path connecting x and y onto vertices of M such that I(x) is adjacent to I(zt} and I(y) is adjacent to I(z2)' This is easily done since M is a randomly chosen set. Then we map the subtrees of T below the vertices of the path by the Main Mapping procedure, using at most 6K 2 vertices from M. Otherwise denote the vertices of the path P connecting Zl and Z2 by Zl, x, ... , y", y', y, Z2. We map x and the part of T which is below P by the Main Mapping procedure, except the vertices y' and y and the subtrees which are below them. We map y" to any vertex in Q. Since M is nonextremal, it is easy to find a path of length three connecting y" and Z2 such the images of y' and y belong to M. Then we map the subtrees below y' and y by the Main Mapping procedure. Again, we use at most 6K 2 vertices from M and as above we do not cover the vertices of M too quickly. 2.2.7. The Third Mapping Procedure. As in the second mapping method we assume that Q is very sparse and IQI > ,IOn. Recall that the good subtrees of the decomposition are denoted by Ii, T2' ... ,Te. Let ti = v(ID. Assume that only a few vertices in Q have many neighbors in the good subtrees, and so we cannot apply the Second Mapping Method . More precisely, for every i there are less than vertices having at least (1/2 + ,3)ti neighbors in i; We look for a weakly remappable subtree, that is, a good subtree Tj for which there are at least ,20 n vertices in Q each having at least (1/2 - ,4)tj neighbors in t; Assume that Tj is a weakly remappable subtree, and apply the second version of the Cleaning Lemma. We get a bipartite graph F'(A' , B') where A' c V(Tj), B' c B c Q, IBI = tJ, and every a E A' has at least t] neighbors in B' and every b E B' has at least (1/2 - 2,4)tj neighbors in A'. If the sizes of the color classes of Tj differ by at least ,3tj, then Tj C F' . Moreover, after embedding Tj into F' we would get a leftover dense subgraph
t;
109
Tight Bounds for Embedding Bounded Degree Trees
of F' in which every b has at least ,3tj /2 neighbors in the leftover of A' . This dense subgraph can then be used to build T further. Hence, if Tj is weakly remappable but we cannot proceed the way we described above, then the sizes of its color classes differ by at most ,3tj. Another important observation is that if Tj is weakly remappable, then we can embed most of it into P', a subtree Tj of size at most 2K,4tj will be left out. Assume that after embedding Tj - Tj into P' the leftover of B' contains at least tJ /2 vertices, each having at least ,3tj neighbors in the leftover of A' . Then we are able to embed ij into the leftover by the help of the Main Mapping Procedure. Moreover, since v(Tj) ~ 2K,4tj, we can build T further by mapping a large subtree of it of size at least ,3tj /4. From now on we assume that none of the above conditions are satisfied, that is, the color classes of the weakly remappable subtree Tj are roughly of equal size, and apart from a few vertices, the neighbors of the vertices of B' are concentrated in a subset of A' of size (1/2 - 2,4 - ,3)tj . Set q =
IQI. We show the
following:
Lemma 12. If Q does not have a subset Q' such that the induced subgraph on Q' has minimum degree at least ,20 n , then Q has at most ,IO q vertices which have more than ,IOn neighbors in Q. Proof. Applying Lemma 3, the number of edges inside Q cannot be more than q,20n. An easy calculation shows that the number of those vertices of Q which have at least ,lOn neighbors in Q cannot be larger than 2,lOq .
• We claim that most of the subtrees are weakly remappable if none of them are remappable. More precisely: Lemma 13. In the above setup if none of the good Tj subtrees are remappable then at least (1 - ,/2)n vertices are in weakly remappable good subtrees.
,5
Proof. First observe that most vertices in Q have at most n /3 neighbors which are not in the union of the i; This follows from Lemma 12 and the fact that there are at most ,IOn vertices which do not belong to good subtrees, ID 1 U D2 U MI < 3,8 n and Tb has size at most ,5 n/ K 2 . Set q" = IQ"I where Q" is the subset of Q containing those vertices having at most ,1On neighbors in Q.
110
B. Csaba , I. Levitt, J. Nagy-Gyorgy and E. Szetneredi
Assume that Tj is not a weakly remappable subtree. Then there are at most ,20n vertices in Q" which have more than (1/2-,4)tj neighbors in Tj , with the remaining q" - ,20n vertices having fewer. Similarly, as i; is not remappable, at most ,20n vertices have more than (1/2 + ,3)ti neighbors in i; On the other hand, the number of edges going between Q" and the union of the good subtrees is at least q"n(1/2 - ,5/3). Putting these together we get the following inequality:
(,20 n + (q" - ,20n ) (1/2 -'IA))e + (,20 n + (q" _ ,20n ) (1/2 + ,3) )(n - c) 2 q"n( 1/2 _,5/3), where e denotes the number of vertices in subtrees which are not weakly remappable. The dominating term on the left is -q" e, while the dominating term on the right is -q"n,5/3. Therefore e < ,n/2, which implies the statement of the lemma. _
,4
Without loss of generality let {T1,1'2,...,Tk} be the set of weakly remappable good subtrees. By the second version of the Cleaning Lemma there is a partial remapping of i: which leaves a subtree of size at most 2K,4ti unmapped. Let I4. C I(Ti ) denote the vertices in the image of i; that are not used in the remapping. Let ri = 1I4.1. Observe that ri is roughly half of ti. The plan again is to gain a large dense subgraph in Q, which we use to build T further. Let us assume that we cannot remap any of 1'1, 1'2, .. .,Tk such that a dense subgraph is left in Q. Then (I4., Q) is sparse for every i, and L:ri ~ n(1/2 - 2,/3). 2 Consider the set UI4.. It has many edges, e(UI4.) ~ / 3, since G is non-extremal. We will show that there is a pair (I4., Rj) which has many edges and with I4. and Rj roughly the same size.
,n
Lemma 14. There exists i, j such that e(I4.,Rj) 21rirj, moreoverri ~ rj
implies rn/4
~
rio
Proof. Let us assume that, on the contrary, every pair has density less than v. Then
e(UI4.) ~
,/4 L
iii
rirj +
L e(I4.). i
The sum L:i e(I4.) so we concentrate on the first sum, which is at most ,/4L:iri(n-ri) . This last expression is at most ,n2/4-o(n2 ) . This contradiction implies that we can find a dense pair. = o(n2 ) ,
111
Tight Bounds for Embedding Bounded Degree Trees
Assume now that all of the dense pairs are comprised of two sets with largely different sizes. Fix R; and consider the pairs (~, Rj) for which ri < rj - by assumption rj > 4rd, if (~, Rj) is a dense pair. The number of edges in the dense pairs containing R; is less than ,rd4 L rj ::; ,rin/8. Summing over every i we find that strictly less than 2 /3 edges are in pairs comprised of sets of largely different sizes. This proves the lemma. •
,n
We are now in a position to describe the re-mapping. If most of the subtrees are weakly remappable and none of them is remappable, then remap i; Tj for which (~, Rj) is a dense pair as in Lemma 14. Assume that ti ::; tj ' First remap most of i; a subtree of size at most 2K,4ti will be left unmapped. Since Tj is weakly remappable, we can find a bipartite graph F(A', B') according to the second version of the Cleaning Lemma. When remapping most of t; we may use vertices from B' . Notice, however, that apart from at most tJ/2 vertices, the vertices of B' have at most ,3tj neighbors in Rj . Moreover, every a E A' has at least tJ neighbors in B' . Delete those vertices from B' which are used to remap Tj together with those which have more than , 3tj neighbors in Rj . We lose at most tJ/2 + ti vertices and so B' still has at least 2tJ/5 vertices. Delete every edge going between R j and B', so that every vertex of B' has at least (1/2 - 2,3)tj neighbors in A' . We can then remap most of Tj such that a subtree of size at most 2K,3tj is left out . In addition, we do not use any vertex of Rj during the remapping. As (~ , Rj) is a dense pair, there are at least ,rirj/2 edges in between them. By Lemma 3 we can find a subgraph of this dense pair in which the minimum degree is at least,/2 r:~rj ' This is much larger than 2K,4ti or
2K,3tj, since r., rj and hence ti and tj does not differ by much. Therefore
we can map the unmapped subtrees of i; and t; and still have most of the edges of the dense pair left to map a new, so far unmapped subtree of T . As usual, we ensure that the mapping is properly connected through the use of the random subset M by the help of the Main Mapping Procedure. Observe that since the sets of dense pairs have sizes at least ,-20/2 we embed large new subtrees. 2.2.8. Description of the Embedding Algorithm. We are now ready to give the embedding method in the case where G is non-extremal and T has a broad subtree. After we are done with the mapping of the vertices of
112
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemetedi
Tb - S, we apply the decomposition method of Section 2.2.2. Then we map the good subtrees of the decomposition in a top-down fashion. Starting from the root T , we map large subtrees ofT one-by-one. During the embedding the already mapped part of T will be a tree T' c T, that is, it will be connected . We proceed in the following way. We pick a leaf x of T' such that there is a subtree Tx c T(x) of size ")'-12 < v(Tx ) < ")'3hl ' We want to extend I for T' U Tx . As before, let Q denote the set of uncovered vertices of W - (MUD 1 UD2 ) . If Q has a large dense subgraph, then T x can be mapped by the Main Mapping Procedure, recall Remark 3. If not, then we will rethink the way we mapped certain subtrees, and look for remappable subtrees. If Q is not too small there will always be a remappable subtree of size at least ")'-20 . Remapping this subtree returns a large dense bipartite subgraph to Q which can be used to map Tx . If there is no remappable subtree then most of the already embedded subtrees are weakly remappable by Lemma 13. There exist two good subtrees which, upon remapping, return a large dense pair to Q (Lemma 14). This dense pair can be used to map T x . We proceed in this way until the size of Q drops below ")'lOn. Then we apply the matching method of Section 2.2.4, and find an embedding of T into G. This finishes the proof in the first non-extremal case. _
2.3. The second non-extremal case: T has a long subtree
In this section we discuss the case of embedding T when there is a subtree 7l c T with at least ,,),5 n / K3 vertices and at most ,,?n leaves. We first give a sketch of the procedure. A line in a tree T is a path P such that every vertex on P apart from possibly the endpoints has degree 2 in T . In this case, Ti must contain several long lines. We find a set of 2")'10 n lines, each of length 1/(5,,),2). We will cut out the midpoint from each of these lines, set aside the cut-out vertex, and glue the two new endpoints together. The result is a tree Ton (1 - 2")'1O)n vertices. We prepare G for the embedding ofT, beginning with finding the vertices to be covered by the long lines by the help of a randomized procedure. The~ we apply the embedding method of the previous section for embedding T into G. Since T is smaller than G, the embedding goes easily, even with
113
Tight Bounds for Embedding Bounded Degree Trees
the restriction that the long lines of T are mapped onto the pre-determined long paths of G. Finally we address the cut-out vertices. We will extend the embedding of the long lines by finding a perfect matching in an appropriately defined bipartite graph in G. With high probability, this procedure finds an embedding of T into G. 2.3.1. Preparations for the embedding Finding random paths in G. In the first step we pick two random subsets
,B
M I , M2 C W (G). MI will have size ,lOn, while M2 will contain n vertices. Then we find the paths U, by the following randomized procedure: Set k = 2,9n.
Pick randomly and independently 2;"(2 edges from
G - MI - M2 with replacement. From these, form k sets of size 1/(20,2). We can connect the edges of each subset into a path of length by way of the paths of length three guaranteed by Lemma 8. Denote the paths by UI , U2 , ... , Ui: We discard those paths containing repeated vertices , where a vertex is repeated if either it appears twice in some U, or it is contained by u, and Uj for i i- j.
s:?-
Let v be any vertex in G. Let X; denote the number of occurrences of v in the randomly chosen edges, then EXv < This number follows a Poisson distribution,
,7.
That is, on average we expect to have less than ,13 n repeated vertices. The probability that there are more than 1O,13 n repeated vertices is by Markov's inequality at most 1/10. We call a path bad if either it contains a vertex at least twice, or it contains a vertex which appears in another path. In the latter case we call only one of those a bad path. After discarding the bad paths, the vast majority of the paths remain . With probability at least 90% we have at most < 2,lln bad paths.
logr;;n
A vertex v can be inserted into a path U, if v has two consecutive neighbors on the path. We also say that v is adjacent to Ui. Let us estimate the probability that v is not adjacent to a given path Ui. There are at least 2 edges in the neighborhood of v , since G is non-extremal. The probability
,n
114
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
that none of the 20~2 randomly chosen edges is in the neighborhood of v is at most 1 1 (1 - ,) 20')'2 ::; e- 20')' < ,20. It is easy to upper bound the number of those paths for which there are less than (1 -,l1)n adjacent vertices. By Markov's inequality, the probability that one cannot insert more than (1-,l1)n vertices into a path is Using Markov's inequality again the number of such paths is at most ,lOn with probability ~ 1- ,/3. Hence, one can find k' = n paths such that these do not contain repeated vertices, and one can insert at least (1 )n vertices into any of them.
,9.
,9
,11
Finding long lines in T. First we show that if F is a tree having only a few leaves then it contains many long lines.
Lemma 15. Let F be a tree on t vertices with ct leaves for some 0 < c « 1. Then it is possible to find s = ct vertex disjoint lines PI, . .. .p; in F such that Ipil = 1/(4c) .
Proof. Choose a root p. Substitute every maximal line in F by one edge (but we keep p as is). Then every vertex in the new tree F' will have degree 1 or at least 3 except possibly the root. Since in a tree the number of leaves is bounded by the number of vertices with degree at least 3 plus 2, we have at most 2ct + 1 vertices and 2ct edges in P' . There were t - 1 edges in P, hence an average edge of F' corresponds to a line of length a least 1/(2c) . Cut out a part of this line of length 1/(4c) and glue together the resulting two endpoints. Repeat this procedure: construct a new P' as before, and then find a long path again by an averaging argument. We can continue this way, and find many paths of length 1/(4c), as long as the leftover number of edges in F is larger than t/2. • Apply the decomposition of Section 2.2.2 for Ti and for the rest of T separately. Call a good subtree of Ti long if it has size t and has at most 2,2t/ K 3 leaves. It is easy to see that almost half of the vertices of T[ are in long good subtrees. Apply Lemma 15 to find k' lines oflength 1/(4,2). We return edges of the lines to T as necessary in order to ensure that any two are at a distance of at least three from each other and that they are exactly 1/(5,2) long. We denote the resulting lines by PI, P2,.'" Pk'. Notice, that we may use up more than 40% of a long good subtree when determining the long lines. Therefore the long subtrees we use for the long lines will not contain more than 3,7 n vertices overall.
115
Tight Bounds for Embedding Bounded Degree Trees
Let P i be a long line. Let Yi be the midpoint of P i and Xi and Zi its neighbors. Remove Yi from the path, and include the XiZi edge. This yields a new line P i and the cut-out vertex Yi. We repeat this for every 1 :::; i :::; k' , after which we arrive at a tree T which has (1 - k')n vertices. 2.3.2. Embedding T into G. Our next goal is to embed T into G. The decomposition of T carries over to one for T, comprised of good subtrees plus a small leftover. We use the embedding method of the previous case with minor modifications . In this case there is no use of D I and D 2 as their role is replaced by the random embedding of the long lines and the removal of one vertex from each line, which we embed at the end. The lines Pi are embedded first into the randomly constructed paths in G arbitrarily. The rest of the embedding of the decomposed T proceeds very similarly as before, with the exception that we begin with embedding TI, tEe long subtree, and when mapping a good subtree of T" containing the line Pi we apply the Main Mapping Procedure with the random set M 2 , i.e. connecting through M 2 , in order to connect the already embedded line to the rest of the subtree. Since overall we have , 9n such lines, and we use at most 6K 2 vertices to connect the embedded line, we do not use the vertices of M2 too quickly. After we are done with T", we put back the uncovered vertices of M2 into the set of vacant vertices of W - MI . Note that from this point the embedding procedure of the previous section is able to proceed as long as there are enough vertices in G that are uncovered. As we have retained k' » IMI I vertices to embed at the very end , this condition is always maintained. 2.3.3. Finishing the embedding. Recall that the probability that a vertex v cannot be inserted into any of the 20\2 randomly chosen edges is at most I I (1- ,)20/,2 ~ e-20/,. Since we choose the edges and then form the edge sets randomly, by CherI
noff's inequality every vertex v can be inserted to at least (1 - e- 20 /, ),9 n o(n) paths with probability 2: 1-1/n2 . After embedding T, we have the uncovered A c W(G) such that IAI = k'. If we can insert exactly one vertex of A to each of the U, paths, then we are done with the embedding of T into G. For showing that these insertions are possible we will apply the Konig-Hall marriage theorem. Construct a bipartite graph F(A, B) where A is as above and the vertices of B correspond to the randomly chosen U, paths. We connect a E A and
116
B. Csaba, I. Levitt, J. Nagy-G yorgy and E. Szem eredi
b E B if the corresponding vertex can be inserted to the the path of b. We have n vertices in A and B . Recall that we discarded those paths into which less than (1 - ,11)n vertices could be inserted. Furthermore, with high probability every vertex in A is adjacent to most of the paths, thus, the minimum degree in F is large with high probability. Hence, the KonigHall conditions are satisfied with high probability. Therefore, we can find a perfect matching in F . This finishes the proof of the second non-extremal case. _
,9
3.
THE EXTREMAL CASE
We demonstrate how to embed a tree T into an extremal graph G. G is extremal if it is very close to being either a complete bipartite graph on color classes having size n/2, or it is the union of two complete graphs on n/2 vertices each. The two cases, while very similar, are handled separately. Note that that we did not use the full strength of the minimum degree of G in the non-extremal case. Even a minimum degree of (1/2 - c)n for some small e is sufficient for the arguments in the non-extremal case. The degree condition is critical, however, in the extremal case. If T has unequal color classes and G = KLn/2J.rn/21' then T ct G. If G = K n / 2 U K n / 2 , then it is not even connected. The First Extremal Case is when G is close to KLn/2J,rn/21, the Second Extremal Case is when G is close to K n / 2 U K n / 2 . We assume that 8(G) ~ n/2 + CK log2 n, where CK is a constant depending only on K (for more we refer to Lemma 17 and Lemma 18 below). In both extremal cases, the proof relies on this minimum degree. In the last section we will show that 8(G) - n/2 = !1(logn) in order to contain every bounded degree spanning tree. We will make use of a folklore result concerning trees in both extremal cases.
Proposition 16. Let J be any tree on m vertices. Then J has a vertex x E V(J) such that it is possible to group the vertices of J - x into two forests, J 1 and h such that m/3 ::; v(Jd,v(J2 ) ( ::; 2m/3) and there is no edge connecting J1 and h in J - x . The vertex x will be called a split vertex. Observe, that Proposition 16 applies for forests as well. If J is a forest, then turn it into a tree by adding
Tight Bounds for Embedding Bounded Degree Trees
edges to it. One can apply the proposition, find x , J1 and delete the recently added edges.
117
h, and then
In one of the extreme cases we have to cut a tree into two sets of equal size such that there is only a few edges going in between the two sets. Lemma 17. Let J be a tree on n vertices for some even integer n . J can be divided into two sets of vertex disjoint subtrees -li , h ,·· . ,Jt and Jt+i,'" .L, such that the number of vertices in each sets is n/2, and 8 ::; 210g 2 n . If the maximum degree in J is D, then the number of edges between the two set of subtrees is at most 2D log2 n.
Proof. Let A and B be two empty sets. Each time we split a subforest of J, we get a smaller forest and a larger forest. We continue to split on the larger forest until it can fit into A , then repeat the process on the smaller forest from the last splitting. The process is iterated until we fill A perfectly. After O(logn) splitting steps we get that IAI = IBI = n/2. We define the ai numbers for 1 ::; i ::; O(logn), ai denotes the empty space left in A at the ith step. In particular, ao = n/2. In the first step we apply Proposition 16 and remove the vertex x, splitting J into Jin and J out such that n/3 ::; V(Jin) ::; v(Jout). We put Jin into A, and set a1 = aO-V(Jin) from which it follows that a1 ::; ao/2. Define i1 so that
Define JO = Jout, and form a sequence of forests J O, J 1, ... J S l by recursively splitting the larger forest from the previous iteration, i.e. JI is the larger forest arising from splitting JI-1. Define 81 such that V(]51) < a1 < V(J s l - 1) and let ]51- 1 = Jt; + J~~t + x, where x is the splitting vertex chosen from ]51 -1 and where v (J~~t) < V(Jis.; ). Since after two applications of splitting the size of the larger forest is less than half of that of the original, we have that 81 ::; 2i1. We put the vertices of Jis.; into A , let a2 = a1-v(Jis.;). By the above conditions a2 ::; ad2 and a2 ::; v(J~~t) . If equality holds in the latter inequality, put the vertices of J~~t into A and stop. Let J S l = J~~t. This is the first step of the process. In general, assume that we have performed k - 1 steps and that there are ak vertices left to be placed in A, where
118
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemetedi
for some positive integer ik . Let Sk-l = 81 + 82 +... 8k-l, and assume that 8t ~ 2(i t -it-I) for 2 ~ t < k. The forest J 8 k - l is to be split further, where ak < v(J8k- 1 ) < n/2 i k - 1 - 1 . Splitting on the larger subforest as above 8k have J 8 k , where Sk = Sk-l + 8k and
Define
8k J 8k- 1 = J,In8k + Jout
~ 2(ik - ik-d
times we
+x
where x is the splitting vertex chosen from J 8 k -
1
and
We put the vertices of Ji~k into A, let ak+1 = ak -v ( Ji~k) and let J 8k = J~~t. It is easy to see that ak+l ~ ak/2 and ak+l ~ v( J8 k ) . If equality holds in the latter inequality, put the vertices of J8 k into A and stop. Clearly, since at every step we halve the space left to fill in A, we need at most log2 n steps in order to get that IAI = n/2. The vertices of those forests which were not put into A are put into B. Since
s, ::; 2il +
L
2(it - it-I) = 2ik-l
l
In the other extremal case we have to find an almost proper 2-coloring of the vertices of a tree on n vertices, such that there are at most o (log n) edges which connect two vertices with the same color. Lemma 18. Let J be a tree on n vertices, n being an even integer. J can be divided into vertex disjoint subtrees J 1 , h ,... , J s plus at most 2log 2 n split vertices, such th at there is a proper 2-coloring of the vertices of the subtrees with equal sized color classes.
119
Tight Bounds for Embedding Bounded Degree Trees
Proof. As in the proof of Lemma 17 our main tool will be Proposition 16. The goal is to give an "almost proper 2-coloration" of the tree J. The color classes will be of the same size, and apart from O(logn) edges, every edge will connect vertices with different colors. For a tree F let us define the coloring discrepancy, d(F) to be the difference of the sizes of the color classes. We denote by Xi, i = 1,2 the size of color class i, so that d(F) = Xl (F) - X2(F ) If F has m vertices then d(F) < m. If we have l trees , F I , F2, ... , F[ , each having size at most m , then the forest UFi has a proper 2-coloration such that d( Ui Fi ) < m.
I
I.
We exhibit a coloring algorithm which colors every vertex of J in O(logn) steps. We assume that there is a proper 2-coloring of J in the beginning, and the algorithm re-colors the vertices such that the color classes are of equal size and at most O(log n) edges connect vertices of the same color. Let ai be the number of vertices whose color has been reassigned to the 1st color class in the ith step, and let /3i be the number that have been reassigned to the 2nd color cl~s . Let ai = n/2 - ai and /3i = n/2 - $i . Before any recoloring, ao = /30 = 0 and ao = /30 = n/2. Throughout we will assume that ai ~ /3i , swapping the two colors at the end of the i - 1st step if necessary. We let dfn = /3i - ai ~ 0, representing the coloring discrepancy of the re-colored vertices of J. At the it h step there is a forest containing those vertices which have not been re-colored, the "outside forest". We denote its coloring discrepancy by d~ut , determined by the original 2-coloring of J restricted to Note that ai + /3i = v(J~ut). If is not a tree , then one can color it in many different ways.
n: n:
n;
We will maintain the following two conditions throughout the algorithm: C1: in the ith step v( J~ut) ~ n/2 i and
These conditions ensure that dtn is decreasing fast , since dtn ~ ~ut ~ v(J~ut) ~ «r». Therefore, after O(logn) steps we can get the desired coloring of J. We demonstrate how to achieve C1 and C2 in the first step and how to maintain these conditions throughout the procedure, implying the lemma. To begin, we apply Proposition 16 twice. After the first application we get two forests , and we apply splitting once more on the larger forest. One of the split vertices are put into the 1st color class, the other to the 2nd color
120
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemetedi
class. We will have the three sub-forests J1, J2 and J3 such that v(Jd ~ n/2 for i = 1,2,3. Assume that d(J1) ~ d(h) ~ d(h), where the discrepancy is taken on the original coloring of J restricted to these sub-forests. Then we recolor J1 and J2 such that d(J1 U J2) ~ d(J3)' This is easily accomplished by swapping the colors in J1, say, so that the discrepancy of the recolored union is d(h) - d(J1) < d(h). We let dln = d(J2) - d(J1) and J~ut = h. Conditions C1 and C2 are clearly satisfied. Now assume that we have completed the ith step, v(J~ut) ~ n/2 i and dIn ~ d~ut· As before we apply Proposition 16 twice. First we split into two forests, then split the larger one, yielding the forests J1, hand J3. One of the split vertices are put into the 1st color class, the other to the 2nd color class. We have that v( Jt ) ~ n/2 i +1 for t = 1,2,3. The sizes of the color classes of Jt will be denoted by at and bt , where at ~ bt for t = 1,2,3. Observe that 2:(at + bd = ai + f3i·
r:
Claim 19.
2:199 at ~ ai·
Proof (of the claim). Suppose that
2: at > ai, then 2: b; < f3i.
Therefore,
contradicting condition C2. _ A forest Jt does not fit into the leftover, i.e., it cannot be re-colored without further splitting, if either at > ai or bt > f3i. We have just eliminated the first option . We say that Jt cannot be re-colored if bt > f3i.
Claim 20. There is at most one forest among J1, hand h which cannot be re-colored. Proof (of the claim). Assume that there are two forests which cannot be re-colored, say, J1 and h. Then b1, b2 > f3i' hence,
a contradiction. _ Assume that b1, b2, b3 ~ f3i' that is, each of the three forests can be re-colored. Further assume that d(J1) ~ d(h) ~ d(h). Then we first exchange the colors on the vertices of J1 so that the new coloring discrepancy is d(Jd - dIn easily seen to be at most d(h) + d(h). Next we exchange
I
I'
121
Tight Bounds for Embedding Bounded Degree Trees
the colors of the vertices of h, which changes the coloring discrepancy to ~:l = Id(h) - d(Jl) - dIn d(J3)' We let J~~tl = h so that v(J~~tl) ::; n/2i+l. Hence, conditions C1 and C2 are satisfied.
I
II ::;
Now assume that b3 > {3i and bl , b2 ::; (3i. We claim that in this case d(J3) > d(Jl), d(h). If this were not true, then say d(Jl) > d(J3). Clearly
and so implying that
2{3i - b3 - 2al 2:: a3 + bl
-
al·
From the assumption that d(Jl) > d(h) we get that b3 < a3 implying that This implies that b3
+ bl
-
aI,
< (3i - aI, which is a contradiction.
In short, either all the three forests can be re-colored, or the one which cannot has the largest coloring discrepancy. In the latter case we can repeat what we did in the first step by first re-coloring J l, then J2. We i+1 +1 2:: ~n+1 and v(Jout i+1 . let Jout = J3. As above, we have ~ut ) ::; n/2i+1 . Agam, conditions C1 and C2 are satisfied. In at most log2 n steps we can find the desired 2-coloring. Since at every step we apply Proposition 16 twice, the total number of split vertices is at most 2log 2 n, and this finishes the proof of the lemma. _ Remark 5. As in the previous case, one can think of the above splitting procedure as giving labels to vertices of T. If x E V(T) then ..\(x) is either A or B, that is, the label of a vertex is a set. The number of those xy edges for which ..\(x) = ..\(y) is O(logn), since in such a case either x or y has to be a split vertex.
The following embedding lemma will be applied in both type of extremal cases: Lemma 21. Let F be a tree with constant maximum degree K and color classes QF and RF. Let H = (Q H,RH) be a bipartite graph such that 1. q = IQFI = IQHI and r = IRFI = IRHI and m = q + r;
122
B. Csebe, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
2. if u E QH then deg (u) 2
(1- 3k )r;
3. if v E RH then deg(v) 2 (1-
3k )q;
4. Q C QF and R C RF are such that
IQI + IRI =
O(logm),
where Q and R denote the set of those vertices of F which are a priori restricted to be mapped onto given vertices of QH, respectively RH. Assume further that eF(Q, R) = O. Then F is a spanning tree of H ifm is sufliciently large. Proof. We will find a bijective, adjacency preserving mapping ¢ from V(F) to V(H) . Note that ¢(Q) and ¢(R) are already given. First we map the vertices of NF(Q) . If x E NF(Q) then we pick a vacant vertex v E RH-¢(R) such that if Y E NF(X) n Q then v is adjacent to ¢(y). We have at least 2r /3 - O(log m) vertices to choose from since the minimum degree is large in H and we have to map O(logm) vertices. Then we let ¢(x) = v. Let R = R U NF(Q). Clearly, IRI = O(logm) since t:.(F) is a constant. We extend the definition of ¢, beginning with a random bijective mapping ¢' : QF - Q -7 QH - ¢(Q), mapping every x E QF onto ¢'(x) E QH. Let ¢(x) = ¢'(x) for every x E QF - Q. We estimate the probability that the vertices of NF(R) are mapped onto neighbors of ¢(R). We call ¢ good for R if x E NF(R) and Y E NF(X) n R implies ¢(x)¢(y) E E(H). Let x E NF(R) and assume that Yl, Y2, .. . ,Yt E R are adjacent to x, where 1 ~ t ~ K . By the minimum degree condition of H we get that I ni N(Yi)1 2 2q/3 - O(logm), and so the probability of choosing a good ¢'(x) from the uncovered vertices in QH is at least 1/2 for every x E NF(R) . This implies that the probability that ¢ is good for R is at least 2- K1R1= 1/ poly (m), where poly (m) is some polynomial of m . We extend ¢ to an embedding of F by a matching argument. Let R~ = RF - R and R~ = RH - ¢(R). Construct the auxiliary bipartite graph L(R~, R~), connecting u E R~ to x E R~ iff u is adjacent to ¢(Yl) ,¢(Y2) , ... ,¢(YK) in H, where Yl,Y2 , ... ,YK E QF are the neighbors of x . If we can find a perfect matching in L then we have extended ¢ to an embedding of F into H . For proving the existence of the perfect matching we check the KonigHall conditions. In particular, we show that every u E R~ is adjacent to at least r /2 vertices in R~ and that every x E R~ is adjacent to at least r /2 vertices in R~ with high probability.
123
Tight Bounds for Embedding Bounded Degree Trees
Let least
U
E R'll" The probability that ux E E(L) for some x E R~ is at
((l-k~ )q)K!(q - K)! ---=-=----q!---
~
(
1)K
1 - -2K-
> 0.56,
as this is the probability that the neighbors of x are all mapped to NH(u). By Azuma 's inequality (see e.g., in [1]) we get that every u E R His adjacent to more than r /2 vertices of R~ with very high probability. In fact the probability that the degree of u in L is less than r /2 is at most 2e- cm for some c > O. Hence, the probability that ¢ is good for R and every vertex of R Hhas at least r/2 neighbors in L is ~ (1- 2e- cm ) - (1-I/poly (m)) > 1/ ( 2 poly (m)) if m is sufficiently large. Next we show that every x E R~ has at least r/2 neighbors in R H. Let the neighbors of x E RF be Yl, Y2, ... ,YK E QF. By the minimum degree condition in H we have that ¢(Yl), ¢(Y2), .. . ,¢(YK) has at least 2r/3 - O(logm) > r/2 common neighbors in R H. Indeed, this holds for every ¢. This proves the lemma. _
Sketch of the embedding algorithm. Denote by SP the induced subforest of T which contains the split vertices and those vertices of T which are at a distance at most four from the split vertices. Clearly, v(SP) ::; 2K4 log2 n. SP may contain many connected components. In both extremal cases our first goal is to embed the forest SPin such a way that those vertices of SP which are adjacent to some vertex in V(T) - V(SP) are mapped onto "large degree vertices" of G. In the first extreme case the large degree vertices are adjacent to at least n( 1/21/(4K)) vertices inside the set to which they belong (either in A or in B). In the second extreme case large degree vertices are those with at least n(1/2 -1/(4K)) neighbors in the other set. Since v(SP) = O(1ogn), after some preparations we can apply Lemma 21 in order to map the vertices of T-SP.
3.1. The First Extremal Case
,n
In this case W(G) is partitioned into 2. and e( GIA) ,e( GIB) ~ (n~2) -
A and B such that IAI
=
IBI
= n/2 ,
First we state a simple lemma on the degrees of the vertices of A and B, we leave the proof to the reader.
124
B. Csebe , 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
Lemma 22. Let 0 < n < 1/2. Then the number of vertices of A having less than n/2 - nn neighbors in A is at most ~ . The analogous for B also holds. • Preparations for the embedding - Step 1: Decomposition of T. By Lemma 17 we find a bipartition of the vertex set of T into two sets , X and Y such that IXI = WI = n/2 and e(X, Y) = O(logn) . Recall that SP is the sub-forest of T which contains the split vertices and those vertices of T that are at a distance of at most four from the split vertices. Let SPI , SP2 , ••• , SPt denote the components of SP. Since SP is an induced subgraph, there are no edges connecting SPi and SPj for i =f. j. For every 1 ~ i ~ t we pick an arbitrary split vertex belonging to SPi to be the root of SPi . Preparations for the embedding - Step 2: Switching and finding stars. We define the inner degree of v E A as Nc(v) n AI and the outer degree of v E A as Nc(v) n BI. The inner and outer degree of u E B is defined similarly.
I
I
Assume that u E A and v E B are such that
e(A - u + v) + e(B - v + u) > e(A) + e(B). Switch u to B and v to A, and look for another pair of vertices which can be switched. At every switching step the total number of edges inside A and B is increased , therefore this process will stop in a finite number of steps . Observe that if there exists u E A and v E B such that both have inner degrees of at most n/4, then it is still possible to perform a switching step. Hence, at the end of the switching procedure we have that every vertex in one of the parts, say A , has an inner degree of at least n/4. Observe, that after the switching even the sparser set will contain at least n 2 /4 - 2,n2 edges, so both sets will be 2,-extremal. There may be up to 16,n vertices in B which have at most n/4 neighbors in B (see Lemma 22). Denote the set of these vertices with low degree in B by B' . We determine IB'I vertex disjoint stars in B, each star centered on a vertex of B' connected to K vertices from B \ B'. We determine the stars greedily. For each u E B', assign K vertices from N (u) n (B \ B') as long they are not yet assigned to another vertex of B'. Call a vertex of B' marked if it is designated as the center of a K -st ar, and call a vertex in B \ B' vacant if it is not assigned to a marked vertex of B' .
125
Tight Bounds for Embedding Bounded Degree Trees
The greedy procedure stops when every unmarked vertex of B' has less than K vacant neighbors in B \ B'. If no unmarked vertex in B' has K vacant neighbors, then apart from at most 16K,n vacant vertices the rest of B - B' has no neighbor among the unmarked vertices of B'. Denote the set of unmarked vertices of B' by B~ . B has n/2 vertices, of which at most (K + 1)16,n belong to the stars and at most (K + 1)16,n vertices have a neighbor in B~. Each of the remaining at least n/2 - 32(K + l)rn vertices has at least CK logn neighbors in A. It follows that an average vertex of A has at least
CK
Iogn
n/2 - 32(K + l)rn n/2
>
K
neighbors among these vacant vertices. Hence, there is at least one w E A which has at least K vacant neighbors . We pick an arbitrary vertex v E B~, switch it with w, mark w, and assign the K vacant neighbors to w. Note that since the greedy algorithm could not assign K vacant neighbors to v, the outer degree of v before switching was large, at least n/2 -16(K + l)rn. The simple averaging argument ensures that there always will be vertex in A having K vacant neighbors, and so we can continue the process to guarantee that (1) every vertex of A has inner degree at least n/4, and either (2) the inner degree of a vertex u E B is at least n/4, or (3) u sits in the center of a K -star such that the leaves of this star have inner degree at least n/4.
Preparations for the embedding - Step 3: Embedding S P. It is easy to see that one can embed the induced sub-forest SP greedily if CK ~ 2K4 . Still, we have to be careful to ensure that certain vertices of SPare mapped onto vertices with large inner degree. Let x E V(SP), and denote its neighbors by Yl, Y2, ... , YK. If x is the vertex to be mapped and some of the YiS have already been mapped, then we must map x onto an uncovered vertex u E >.(x) such that uI(Yi) E E(G) for every mapped Yi. We begin mapping the components of SP with their roots. We obey the following rules when mapping a neighbor of an already mapped vertex: Rl. If x is mapped to a vertex with inner degree at least n/4, Yi is unmapped and >.(x) = >'(Yi) , then we map Yi onto an uncovered vertex which has inner degree ~ n(1-1/(4K)) /2.
126
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
R2. If X is mapped to the center of a star, Yi is unmapped and '\(x) = '\(Yi) then Yi is mapped to an uncovered leaf of the star. R3. If x is mapped to a leaf of a star such that the center of the star is uncovered, Yi is unmapped and '\(x) = '\(Yi), then we map Yi onto the center of the star. R4. We never cover the center of a star by a vertex x if at least one leaf of the star is already covered by a vertex Y, for which xy ~ E(T). It is easy to satisfy R2 and R3. R4 can be satisfied in the course of the embedding of SP if 8(G)-n/2 ~ 2v(SP) . For Rl observe that by Lemma 22 at most 12K 2,n vertices have inner degree less than n ( 1 - 1/(4K) ) /2, and so out of the at least n/4 - v(SP) -12K2,n > n/5 choices one can always find an uncovered vertex for Yi with sufficiently large inner degree. In this way, every vertex of S P which is at a distance of at least four from every split vertex is mapped onto a vertex of G with large inner degree.
The distance four condition in the definition of SP is needed for the following reason. Assume x is a split vertex with, say, '\(x) = A, xy E E(SP) and '\(y) = B . When mapping Y to B, it is possible that it is mapped to a leaf of a star. When we apply R3 and R2, we find that only a vertex which is of distance four from x can be mapped onto a vertex of large inner degree. The problem we may face after finishing the embedding of S P is that some of the stars may have been damaged. That is, we may have covered some leaves of certain stars such that the center vertices are still uncovered. We solve this problem by finding new leaves for such center vertices. We accomplish this using the same method applied to find the stars initially. Say that there is an uncovered vertex u E B' such that some of the leaves of its star were covered. Assuming that CK logn ~ v(SP) + 2K, every vertex will have unmapped outer degree of at least 2K even after embedding SP. Hence, either we can find K vacant uncovered neighbors in B having inner degree at least n/4, or by averaging we will find an uncovered v E A such that v has at least K vacant uncovered neighbors, all having inner degree at least n/4. In summary, SP is embedded such that every vertex which is at a distance of at least four from every split vertex is mapped onto a vertex with inner degree at least n(1-1/(4K)) /2. Moreover, if x E V(T) - V(SP), Y E V(T), and xy E E(T) then '\(x) = '\(y). That is, every subtree in the leftover is labelled to be mapped entirely to A or to B .
Tight Bounds for Embedding Bounded Degree Trees
127
Embedding T - Step 1. First we state a simple but useful lemma. Lemma 23. Let u, v E B. Then there is a U - v-path of length at most five entirely in B. The path can be found even if we discard at most n/5 vertices from B , as long as the stars of U and v remain intact. An analogous statement holds in case u ,v E A. Proof. We construct a u - v-path of length five when u, v E B'. Let UI be an arbitrary leaf of the star centered at U and let VI be a leaf of the star centered at v. Since the inner degree of UI and VI each is at least n/4, even after deleting n/5 vertices both will have at least n/20 neighbors left in B. Out of these vertices in the neighborhood of UI we can find a vertex U2 with inner degree at least n/2 - 80,n (see Lemma 22). Therefore, U2 has a neighbor V2 E NC(VI) n B. The U- v-path of length five is: u, UI, U2, v2, VI, V.
If at least one of u ,v belong to B - B', then one can find an even shorter path, as is the case when both vertices belong to A. We leave the proof of these cases to the reader. •
We find two subtrees of T , denoted by TA and TB such that V(TA) C A and V(TB) C B , and n] K 7 < V(TA),V(TB) ~ n] K 5 . We embed these subtrees into A or B by covering every vertex with inner degree at most n(l - 1/(3K)) /2 , thereby preparing G for the application of the general tree embedding lemma, Lemma 21. Recall the decomposition of T from Lemma 17. After the first splitting, the smaller forest is assigned to A. It has size at least n/3, hence its largest subtree TI is of size at least n/(3K). Then we split the leftover, and the smaller forest is assigned to B. The size of it is at least n/6, hence, its largest subtree T2 has size at least n/(6K). We find TA C TI and TB C T2 . Finding TA and TB are very similar, we discuss finding TA. Since V(TI) > n/(3K), TA will be a proper subtree of TI. Let r E V(TI) be the unique vertex in V(TI ) which has a neighbor in SP (if there were two neighbors, we would get a cycle). Beginning at r, form a maximal path r = XO,XI,X2, .. ' , Xk such that TI(xd is the largest subtree of TI rooted at a child of Xi-I and such that v( TI (Xi)) > n.]K5 for every i ~ k. Choose Z such that TI( z) is the largest subtree among the children of Xk. We let TA = TI(Z) and let z be the root of TA. Clearly, n/K7 < V(TA) ~ n/K5 . In the same way we determine TB C T2 such that n]K7 < V(TB) ~ ti] K 5 . Observe, that TI - TA has only one vertex which is adjacent to TA, and similarly for TB. Since we put T2 into B after two splittings, there may
128
B. Csaba , I. Levitt, J . Nagy-Gyorgy and E. Szetneredi
be two edges from TB to the rest of T, one connecting to T2 connecting to SP.
-
TB and one
We discuss the algorithm for embedding TA and TB. This time we give the details for TB, which is somewhat harder than the case of TA. We begin with putting the uncovered vertices of B in increasing order according to their inner degrees, writing Ul, U2 , . . . ,Ue, where n/2-v(SP) :S f < n/2. Thus we may refer to the first m vertices of B, by which we mean the set {u1, U2 , . . . ,Urn}. The goal is to cover as many vertices from the beginning of this ordered list as possible. We first map the root of TB onto an uncovered vertex which has inner degree ~ n(1-1/(4K)) /2. Since TB may have a vertex which is adjacent to S P, we are careful to map that vertex onto an uncovered vertex having inner degree ~ n(1-1/(4K)) /2 . A simple general rule will always be applied: when mapping x we map it on an uncovered vertex U such that UI(Yi) E E(G) for every mapped neighbor Yi. Apart from this obvious requirement we obey rules R2 and R3, as described during the embedding of SP. Say that in the course of the embedding the most recently mapped vertex is Xi onto Uj for some 1 :S i :S i , and that the first uncovered vertex of B according to the ordering is Ut, where i :S t. Our next goal is to cover u-. By Lemma 23 there is a path of length at most five between Uj and u-, the length of which is denoted by f. Consider the induced subtree containing unmapped vertices of TB(Xi), denoted T~(Xi), having depth f and being comprised of every vertex below Xi which is at distance at most f from Xi. This subtree has at most K 5 vertices, which we embed greedily, but in such a way that one of its leaves will cover Ut . By Lemma 23 this is possible to achieve. Then we pick the next vertex in the ordering of V(B), covering which may again embed at most K 5 vertices from TB. That is, by mapping at most K 5 vertices of the tree , we can cover at least one uncovered vertex of B' . Hence, after mapping at most K 5 1 B'I :S K 5 16')'n vertices of TB we will have no uncovered vertex left in B' . After covering every vertex of B' we will try to cover as many "small" inner degree vertices as possible. Again, we apply Lemma 23 and find that by mapping at most K 5 vertices of TB we can cover any uncovered vertex we want. An easy calculation shows that we can cover the first n/(2K 12 ) vertices of B in this way. By Lemma 22 every uncovered vertex left in B will have inner degree at least n/2 - 4K- 8n > n(1-1/(4K)) /2 .
129
Tight Bounds for Embedding Bounded Degree Trees
Observe that when mapping the vertices of TA we get at least the same bounds for the inner degrees of uncovered vertices of A. Remark 6. After this step every uncovered vertex has inner degree at least n(1 -1/{4K)) /2. We covered at most n/K5 vertices of A and of B , hence the minimum degree inside these sets is at least n(1-1/{4K)) /2 - n/K5 . Embedding T - Step 2. It is now a simple task to finish the embedding of T by the help of Lemma 21. Denote the forest induced by unmapped vertices which have to be mapped into A by i; and let T denote the forest of unmapped vertices which have to be mapped into B .
i:
Take an arbitrary proper two coloring of letting Q and R denote the color classes, and set q = IQI and r = IRI. Divide the uncovered vertices of A randomly into two sets, QA and RA, where IQAI = q and IRAI = r . Using Azuma 's inequality and Remark 6 every u E QA will be adjacent to at least r( 1-1/{3K)) vertices in RA, and every vERA will be adjacent to at least q( 1 - 1/{3K)) vertices in QA. There are at most v{SP) + 1 vertices which are a priori restricted to be mapped onto given vertices of A - the vertices of SP and the unique vertex in T; adjacent to TA. Since the require~nts of Lemma 21 are satisfied, we conclude that f can be embedded . T is embedded similarly. Hence, we conclude that in the first extremal case T c G. • Remark 7. Note that case.
CK
= 4K4 is sufficiently large in the first extremal
3.2. The Second Extremal Case In this case G is close to K n / 2 ,n / 2 ' This case is in fact very similar to the previous one, so the emphasis will be on the differences. We discuss the switching procedure in detail, and give an outline of the rest of the embedding method.
,n
We assume that W{G) is partitioned into two vertex classes of size n/2, 2 . Observe that by the minimum A and B, such that e{A) + e{B) ::; degree condition, every vertex will have at least CK log n neighbors in both vertex classes. We need a very similar statement to Lemma 22:
130
B. Csaba, 1. Levitt, J. Negy-Gyiitgy and E. Szetueredi
Lemma 24. Let 0 < TJ < 1/2. Then the number of vertices of A having less than n/2 - TJn neighbors in B is at most~. The analogous statement is true for B. •
Preparations for the embedding - Step 1: Decomposition of T. We start by finding a decomposition of the tree T by Lemma 18 into a set of subtrees T I , T2 ," " T; with the following properties: (1) s = O(logn) , (2) there is a proper red-blue coloring of these subtrees such that overall we color n/2 vertices red and n/2 vertices blue and (3) there are at most O(logn) edges of T inside the color classes, each of which is incident to a split vertex. As before, if x E V(T) then A(X) = A or B indicates into which set we map x. It is easy to see that the largest subtree of this decomposition, TI has at least n/(3K) vertices. Given the decomposition ofT, we define the forest SP as in the previous extremal case as the induced sub-forest of T containing every vertex being at a distance at most four from a split vertex. By the definition of SP, there are no two components of SP with an edge connecting them.
Preparations for the embedding - Step 2: Switching and finding stars. We repeatedly perform a switching procedure whenever it is possible. If we identify a vertex v E A and a vertex u E B such that e(A , B) < e(A - v + u, B - u + v), then we let A = A - v + u and B = B - u + v. Since the number of edges in between A and B increases at every step of the switching , this is a finite process. Note also that when we are finished with the switching , one cannot find a pair of vertices v E A , u E B such that N(v) n n/4 and N(u) n n/4. Therefore, in one of the vertex classes, say A , we find only vertices which have at least n/4 neighbors in the other vertex class, B . We will use the notion of the inner and outer degree, as defined in the previous extremal case.
I
BI ::;
I
AI ::;
We pay special attention to those vertices of B which have very small outer degree. Observe that we may have at most 8, n vertices in Beach having outer degree less than n/4. Denote their set by B'. As before, we find IB'I vertex disjoint stars on K + 1 vertices. The leaves of these stars come from A , and the center vertices are either from A or from B . We determine such stars as follows. Let A v be the set of vacant vertices, and set A v = A and A' = 0 at the outset. One-by-one we look for K vacant neighbors for every u E B'. We have the following cases.
131
Tight Bounds Eor Embedding Bounded Degree Trees
Case 1: If u is adjacent to Vl , V2, .. . , VK E A v , then the new star will have center u and leaves Vl, V2 , ... , v K. We let A v = Av - {Vl, V2, .. . , v K }, and A' = A' + {Vl, V2, . . • , V K }. Case 2: If u does not have K vacant neighbors, but there is a star with center v E A v and leaves Vl, V2 , • . . , VK E A v , then we switch u with v. The new star will have center v and leaves Vl ,V2, .. . ,VK . We let A v = A v + u - {Vl , V2, ... , V K} and A' = A' + {Vl' V2, ... , V K } .
Lemma 25. Assume that there exists a u E B ' such that it does not have K vacant neighbors. Then A v contains a star on K + 1 vertices. Proof. Suppose we have found t stars. Clearly, t > log., by the minimum degree condition on G. Let us assume to the contrary that A v does not contain a star on K + 1 vertices. If u does not have K neighbors in A v then u has at most K t + t + K - 1 neighbors in A after the first switching procedure is concluded. At most K t of these neighbors are from A', at most K - 1 are from A v and we apply the switching of Case 2 at most t times. Since t > K, we have that Kt + t + K - 1 ::; (K + 2)t. The following claim is easy to prove:
Claim 26. If at the end of the first switching procedure B has a vertex with outer degree d, then no vertex of A has inner degree larger than 2d.
• This implies that the vertices of A' have inner degree at most 2(K + 2)t. Assuming A v has no star on K + 1 vertices, we have the following lower bound on the number of edges in between A and B :
e(A , B) ~
n2
"4 -
2K(K + 2)t2
n
-
(K -1)2"'
We also have the following upper bound on e(A, B) by inspecting the outer degrees of the vertices of B:
e(A, B) ::;
t~ +
(i - t) ;.
From these we get the inequality 2
0::; 2K(K + 2)t -
n 4n t + (K -1)2"'
This inequality is not satisfied for t E [2K, S,n] . •
132
B. Csaba, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
Hence, if we fail to apply the method of Case 1 then Case 2 can always be applied , and the stars can be determined.
Preparations for the embedding - Step 3: Embedding SP. Embedding S P is very similar to the previous case. Our goal is to map x onto an uncovered vertex U E ..\(x) such that if xy E E(T) and we have already mapped Y then uI(y) E E(G) . We begin mapping a component of SP by its root . As in the previous extremal case, we have four rules concerning the embedding of SP . Rl/ , If x is mapped to a vertex with outer degree at least n/4, Yi is unmapped and ..\(x) =I=- ..\(yd , then we map Yi onto an uncovered vertex which has outer degree 2:: n(1-1/(4K)) /2.
R2/. If x is mapped to the center of a star, Yi is unmapped and ..\(x) then we map Yi to an uncovered leaf of the star.
=I=-
..\(Yi)
R3/. If x is mapped to a leaf of a star such that the center of the star is uncovered, Yi is unmapped and ..\(x) =I=- "\(Yi) , then we map Yi onto the center of the star. R4/. We never cover a center of a star by a vertex x if at least one leaf of the star is already covered by a vertex Y for which xy tt E(T) . As before, it is easy to satisfy the above rules, and as before we may face the problem that after finishing the embedding of SP, some ofthe stars may have been damaged. That is, we may have covered some leaves of certain stars without covering their centers. We solve this problem by finding new leaves for such center vertices. Suppose that there is an uncovered vertex u E B' such that some of the leaves of its star were covered. Assuming that CK logn 2:: v(SP) +2K, every vertex will have an uncovered outer degree of at least 2K even after embedding S P. Hence, either we can find K vacant uncovered neighbors in B having outer degree at least n/4, or by averaging we will find an uncovered v E A such that v has at least K vacant uncovered neighbors, all having outer degree at least n/4, by Lemma 25. In this way we find the missing leaves for the damaged stars. In summary, after embedding SP every vertex which is of distance at least four from every split vertex is mapped onto a vertex which has outer degree at least n( 1-1/(4K)) /2. Moreover, if x E V(T)- V(SP), Y E V(T), and xy E E(T), then ..\(x) =I=- ..\(y). That is, ..\ represents a proper 2-coloring for every subtree in the leftover.
Tight Bounds for Embedding Bounded Degree Trees
133
Embedding T - Step 1. First we state a simple but useful lemma whose proof is very similar to the proof of Lemma 23. Lemma 27. Let u, v E B . Then there is au - v-path of length at most six, with vertices alternately belonging to B and A. The path can be found even after discarding at most n/5 vertices, as long as the stars of u and v remain intact. The analogous statement holds in case u, v E A. _ As in the previous extremal case, we find a subtree of T, denoted by T' such that n]K7 < v{T') ::; n] K 5. As in the previous extremal case, when embedding this subtree we cover every vertex with outer degree at most n(l- 1/{3K)) /2 , thereby preparing G for the application of the general tree embedding lemma , Lemma 21. Recall that the largest subtree in the decomposition, T I , has at least n/{3K) vertices. Again, we order the uncovered vertices of W(G) according to increasing outer degree and continue the embedding of T by that of T' . In order to cover the low outer degree vertices we will repeatedly apply Lemma 27, achieving at the end that we cover the first n/{2K I3 ) vertices in the list. We omit the details as they are very similar to the one discussed in the first extremal case. By Lemma 24 every uncovered vertex left in W(G) has outer degree at least n/2 - 4K-7n > n(1-1/{4K)) /2 .
Remark 8. After this step every uncovered vertex has outer degree at least n(1-1/{4K)) /2. We covered at most n/K5 vertices of W{G), and so the minimum degree in the leftover is at least n(1-1/{4K)) /2 - n/K5 . Embedding T - Step 2. In order to finish the embedding of T we observe that the conditions of Lemma 21 are satisfied for the leftover forest T, and so T can be embedded. Hence, we conclude the second extremal case. _ Remark 9. Notice, that as well.
CK
= 4K4 is sufficiently large in this extremal case
4. LOWER BOUND FOR THE MINIMUM DEGREE IN G In this section we show that 8{G) -n/2 = n(1ogn) for both extremal cases. First we need a definition.
134
B. Csebe, 1. Levitt, J. Nagy-Gyorgy and E. Szemeredi
Definition 2. A balanced cut of a graph is a partitioning of its vertex sets into two subsets, such that their sizes differ by at most one. The size of a cut is the number of edges going between the two partition sets. As we will see, the minimum size of a balanced cut of T provides a lower bound when embedding it in the first extremal case. while, the maximum size cut provides a lower bound for the second extremal case. In both cases T is a complete ternary tree on n vertices, and the root r of T is the only vertex having degree three, all other vertices have degree 4 or 1. We define the height h(x) of x as the number of edges on an x - y path, where y is the closest leaf to x.
4.1. The First Extremal Case
Lemma 28. Let T be a complete ternary tree of height h. Then the size of any balanced cut of T is at least lh/2J. Proof. Let A and B be the partition sets of a minimum balanced cut of T , we assume that IAI 2: IBI. Let X : V(T) -+ {-1, 1} be a coloring function . We initialize the coloring X(x) = 1 for every x in V(T), then apply a color-swapping process such that at the end of the process A = X- 1 (1) and B = X- 1 (- 1). The Color-swapping Process: Initially the color of every vertex is 1. Traverse T by a depthfirst search. If there is a vertex x such that x and its ancestor are not in the same partition set then multiply the colors of the vertices of T(x) by -1. We call this operation the color-swap of T(x). At the end of the process we get the desired coloring X such that B = X- 1 (- 1). It is clear that this process will always yield a coloring which corresponds to the cut, and that the number of color-swaps performed is the size of the cut. For any coloring X, label every vertex x by the signed difference of the size of the color classes of T(x). More precisely, for every x let L(x) = 2: y E :l' (x ) X(y). In the procedure described, the labels are updated whenever a color-swap operation is performed. When we swap the colors of T(x), the label of a vertex y on the r - x path changes by adding -2L(x) and the labels of the vertices of T(x) are A
= X- 1 (1) and
135
Tight Bounds for Embedding Bounded Degree Trees
multiplied by -1. It is useful to represent the labels in a modified ternary numeral system in which the digits are -1, 0, 1. Such a representation will be subscripted by a "3". For example, 101(-lh = 33 + 31 - 1 = 29. Every integer can be represented this way and this representation is unique. Let f.k = 11 . .. 13 where the subscript k refers to the number of Is. The following facts hold: We introduce the notation Iiall for an integer a, defined to be the number of non-zero digits in the modified ternary representation of a. It is easy to see (by induction on the number of digits of a) that if Ibl ::; lal then Iia ± bll ::; lIall + IIbll· We refer to Iiall as the norm of a. 1. Initially the label of any x E T is L(x) Hence, initially II L(x)11 = h(x) + 1.
= £k where k = h(x) + 1.
2. At the end of the process II L(r)11 ::; 1. 3. After a color-swap of T( x) the labels of the vertices on the r - x path increase or decrease by 100... O(-1 h. If x(x) = 1, then the labels
decrease, otherwise increase. Here the number of Os is h(x) . Initially II L(r)11 = h(r) + 1, and at every color-swap L(r) increases or decreases by a number which has norm two. If the size of the minimum balanced cut is m, then there are m color-swaps. Since one color-swap can decrease II L(r)l/ by at most two, at least lh/2J color-swaps are needed in 1 at the end. The lemma follows. • order for L(r)
I
I ::;
We define the extremal graph G = (W, Ea). Set h = log3 n, nl = n/2 - h/16 + 1 and n2 = h/16 - 1. The vertex set of G is decomposed into four disjoint subsets, W = Xl U X 2 U Yl U Y2, where Xl and X 2 are both nl-cliques. Let Yl and Y2 each be sets on n2 vertices and let Y = Yl U Y2 be an independent set. Finally, we form the complete bipartite graphs between (XI, Y) and (X2, Y). It is easy to see that 8(G) = nl -1 + 2n2 = n/2 + h/16 - 2. Assume there is an embedding I : V -t W of the complete ternary tree T into G. In order to apply Lemma 28, let A = I-l(Xl U Yl) and B = I- l(X2UY2). We have IAI = IBI = n/2, and therefore eT(A, B) ~ h/2. Since ea(XI, X 2 ) = 0, one endpoint of every edge going in between A and B is mapped to a vertex in Y . The maximum degree of T is 4, hence there are at most 41Y1 edges of T with one endpoint mapped onto some vertex in Y. Since 4/Y/ < h/2 we have arrived at a contradiction: T et G.
136
B. Csaba, I. Levitt, J. Nagy-Gyorgy and E. Szemeredi
4.2. The Second Extremal Case
Lemma 29. Let T be a complete ternary tree with height h. The size of any balanced cut of T is at most e(T) - lh/2J. Proof. Let A and B, IAI > IBI, be the vertex sets of a balanced maximum cut of T . We show that the number of those edges which have both endpoints belonging to the same set is at least lh/2Jin a manner similar to the previous case. We apply a color-swapping process similarly to the previous case, but with two modifications. First, the coloring function X : V(T) --+ {-2, 2} is initialized as a proper 2-coloring of T with X(r) = 2. Second, we multiply the vertices of T( x) by -1 when x and its ancestor are in the same partition set . After applying the Color-swapping Process, we have the following: 1. The labels of the vertices of T depend on their height and the height
of the tree: (a) If h(r) and h(x) are even, then L(x) = 1(-1)
(-lh .
= 11 13, (c) If h(r) is odd and h(x) is even, then L(x) = (-1)11 ... 13, (d) If h(r) and h(x) are odd, then L(x) = (-1)(-1) ... (-lh. (b) If h(r) is even and h(x) is odd, then L(x)
In each case the number of digits of L(x) depends on the parity of h(x). If h(x) is even, then the number of digits is h(x) + 2, otherwise it is h(x) + 1. 2. At the end of the process L(r) of h.
= 0 or 1(-1 h, depending on the parity
3. After the color-swap of T(x) the labels of the vertices on the r - x path increase or decrease. If h(x) is even, then the absolute value of the change is 10 ... 013, where the number of zeros is h(x). If h(x) is odd, then the labels change by 10 ... O( -lh, here the number of zeros is h(x). The above facts can be proved easily by induction. Application of the same reasoning as before implies the statement of the lemma. _
137
Tight Bounds for Embedding Bounded Degree Trees
This time the extremal graph G = (W, Ea) is defined as follows. First, set h = log3 n, nl = n/2 - h/16 + 1 and n2 = h/16 - 1. The vertex set of G is decomposed into four disjoint subsets: W = Xl U X2 UYl U Y2 , where Xl and X 2 are two independent sets of size nl, and GIXIUX2 is isomorphic to Kn1 ,nl' Let Yl and Y2 be two sets on n2 vertices , and let Y = Yl UY2 be an independent set. Finally, let Glx1uy and Glx2uy be isomorphic to K n 1 ,2n 2 ' It is easy to see that 8(G) = nl + 2n2 = n/2 + h/16 - 1. As before, let I : V -t W denote the embedding of the complete ternary tree T into G. We apply Lemma 29 to the cut defined by A = I-I (Xl UYl ) and B = I- l(X2 U Y2). Obviously, IAI = IBI = n/2, and therefore eT(A, A) + eT(B, B) 2: h/2. Assume, that eT(A, A) 2: eT(B, B). By construction, one vertex of every edge of T mapped into A is mapped to a vertex of Yl . The maximum degree of T is 4, and so there are at most 41Yl l edges of T with one endpoint mapped onto some vertex in Yl . Since 4!Yl ! < h/4 we have arrived at a contradiction: T G.
ct
REFERENCES
[IJ N. Alon and J . Spencer , The Probabilistic Method, John Wiley & Sons, Hoboken, New Jersey (2008). [2J
B. Bollobas, Extremal Graph Theory , Academic Press , London (1978).
[3]
J. Komlos, G. N. Sarkozy and E. Szemeredi, Proof of a packing conjecture of Bollobas, Combinatorics, Probability and Computing, 4 (1995), 241-255.
[4J
J. Komlos, G. N. Sarkozy and E. Szemeredi, Spanning trees in dense graphs, Combinatorics, Probability and Computing, 10 (2001), 397-416.
Bela Csaba
Ian Levitt
Department of Mathematics Western Kentucky University
Department of Mathematics Rutgers University
e-mail:
e-mail:
bela.csaba~wku.edu
ianl~ath.rutgers.edu
Judit Nagy-Gyorgy
Endre Szemeredi
Bolyai Institute University of Szeged
Department of Computer Sciences Rutgers University and Renyi Institute Budapest and lAS, Princeton
e-mail: nagy-gyorgy~ath.u-szeged.hu
e-mail:
szemered~cs.rutgers.edu
Fete of Combinatorics, pp. 139-149.
BOlYAI SOCIETY MATHEMATICAL STUDIES, 20
BETTI NUMBERS ARE TESTABLE*
GABORELEK
We prove that the Betti numbers of simplicial complexes of bounded vertex degrees are testable in constant time.
1.
INTRODUCTION
Property testing in bounded degree graphs was introduced in the paper of Goldreich and Ron [4]. In this paper we study property testing for bounded degree simplicial complexes in higher dimensions. Let d 2:: 2 be a natural number and consider finite simplicial complexes where each vertex (zero dimensional simplex) is contained in at most d edges (I-dimensional simplex). Of course, such a complex can be at most d-dimensional. What does it mean to test the p-th Betti number of such a simplicial complex? First fix a positive real number E > O. A tester takes a simplicial complex K as an input and pick C(E) random vertices. Then it looks at the C(E)neighborhoods of the chosen vertices. Based on this information the tester gives us a guess bP(K) for the p-th Betti number lJP(K) of the simplicial complex such a way that:
Prob
(
IbP(K) -lJP(K)1 IV(K)I >
) E
< E,
where V(K) is the set of vertices in K . In other words, we can estimate the p-th Betti number very effectively with high probability knowing only "Research sponsored by aTKA Grant K 69062 and 49841.
140
G. Elek
a small (random) part of the simplicial complex. The goal of this paper is to show the existence of such a tester for any c > O. That is to prove the following theorem:
Theorem 1. Betti-numbers are testable for bounded degree simplicial complexes. For graphs the O-th Betti number is just the number of components and the first Betti number can be computed via the O-th Betti number and the Euler-characteristic, hence it is not hard to see that such tester exists. For connected surfaces one can also calculate the first Betti number using just the number of vertices, edges and triangles. However in higher dimensions there is no such formula even for triangulated manifolds. Note that this paper was not solely motivated by the paper of Goldreich and Ron, but also by the solution of the Kazhdan-Gromov Conjecture by Wolfgang Luck [5]. The workhorse lemma of our paper is basically extracted from his paper using a slightly different language. It is very important to note that our proof works only for Betti numbers of real coefficients and we do not claim anything for the Betti numbers of mod-p coefficients.
2.
THE CONVERGENCE OF SIMPLICIAL COMPLEXES
Let ~d be the set of finite simplicial complexes K of vertex degree bound d that is any O-dimensional simplex is contained in at most d l-dimensional simplices . We denote by K, the set of i-simplices in K and by GK the 1skeleton of K , that is V (G K) = K 0, E (G K) = K I. A rooted r- ball of degree bound d is a simplex L E ~d with a distinguished vertex x such that for any y E V(GL) , d(x, y) ~ r, where d(x, y) is the shortest path distance of x and y in the graph GL. We denote by zr,d the rooted isomorphism classes of rooted r-balls. If K E ~d and P E V(K) then let Gr(p) be the rooted r -ball in the J-skeleton GK and Br(p) is the set of simplices a such that all vertices of a are in Gr(p). Then Br(p) is a rooted r-ball of vertex degree bound d. For a E zr,d we denote by T(K, a) the set of vertices p such that Br(p) ~ a . We set
._ IT(K,a)1
PK (a ) .-
IKol
.
We say that {Kn}~=1 C ~d is convergent (see [1] for the graph case) if
141
Betti Numbers are Testable
• IKol-+ 00 • limn -+oo P«; (a) exists for any r ~ 1 and a E It is easy to see that any sequence {Ln}~=l contains a convergent subsequence.
zr,d.
c Ed such that ILol -+ 00
Let aI, a2, a3,' . . be an enumeration of all the r-balls, r have the pseudo-metric 00
ds(K,L) :=
~
1. Then we
1
L 2i IpK(ai) - pdai)l· i=l
Clearly, if {K n } ~=l be an increasing sequence of simplicial complexes they are Cauchy if and only if they are convergent. By an oriented d-complex Q we mean an element of Ed equipped with a fixed orientation for each of its simplex. Note that we do not assume that the orientations are compatible in any sense. We denote by d the set of all finite oriented d-complexes. We also define oriented r-balls, the set zr,d of all oriented r-ball isomorphism classes and the probabilities pQ(f3) accordingly. Naturally we can define the convergence of oriented d-complexes as well.
t
Proposition 2.1. Let {K n } ~=l C Ed be a convergent sequence of dcomplexes. Then one has an oriented copy Qn for each K" such that {Qn }~=l C d is convergent as well.
t
Proof. Consider LLd. random variables O(x) distributed uniformly on [0,1]. Let (ao, al, . . . , ai) E Ki be a positive orientation if
t
Then the resulting sequence {Qn} ~=l C d is convergent with probability 1. For details of the simple argument see ([3], Proposition 2.2). • Finally, we need a technical definition that we use in the subsequent sections. Let us consider the set Qi of i-simplices in an oriented d-complex Q. If a, T E Qi we say that a and T are adjacent if they have at least one joint vertex . This way we can define the shortest path distance di(u, T) (where di(u, T) = 00 is possible). The ball B:(u) is the set of i-simplices T such Ard that d; (u, T) ::; r. As above, we can define the classes Zi' and the sampling probabilities PQi (f3). Note that if a, f3 E ZT,d we say that a is isomorphic to j3 if they are isomorphic as simplicial complexes not only as metric spaces.
142
G. Elek
That is PQi ((3) defined the following way. Let (3 E ZT,d. Denote by T(Qi, (3) the number ofi-simplices T such that the simplicial complex B~(J') is isomorphic to (3, where the isomorphism preserves the root-simplex. Then
Ad
Ar d
Clearly, if {Qn}~= l C E is a convergent sequence then for any (3 E Zi' , limn -+ oo PQi ((3) exists .
3.
BETTI NUMBERS AND COMBINATORIAL LAPLACIANS
t
Let Q E d be an oriented simplicial complex . Let Oi(Q) denote the euclidean space of real functions on the l-simplices of Q. Let us consider the cochain-complex
OO(Q) ~ Ol(Q) ~ . . . Recall that if
f
E
oq(Q) then
df(ao, al , ' " ,aq+l) = f(aI, a2 ,· . . , aq) - f(ao , a2 , · .. , aq+l) + '"
+ (_l)q+l f(ao, al , . .. , aq). Then bi(Q) = dimKer di - dim 1m di-l are the Betti numbers of Q. Note that they do not depend on the choice of the orientation of Q only the underlying simplicial complex . The combinatorial Laplacians (see e.g. [2]) ~~ : Oi(Q) -t Oi(Q) are defined as D.~ := di-ld;_l + d;di . The operators ~~ are positive and self-adjoint. Also, dimKer D.~ = bi(Q) . Let us remark that by Lemma 2.5 of [2] we have the following information on the combinatorial Laplacians:
• ~~((J, T)
=f=.
0 only if (J = Tor
• ~~((J, T) is always an integer.
(J
and T are adj acent.
143
Betti Numbers are Testable
4. WEAK CONVERGENCE OF PROBABILITY MEASURES First recall the notion of weak convergence of probability measures. Let {J.Ln} ~=1 be probability measures on the interval [0, K]. Then {J.Ln} ~=1 weakly converges to J.L if for any continuous function f E 0[0, K]
For an example , let J.Ln(*) = 1, then the measures J.Ln converge to the measure concentrated at the zero. Note that in this case limn -+oo J.Ln(O) =1= J.L(O) . Now let
The following theorem can be extracted from [5], nevertheless we provide a proof using only the language of real analysis , avoiding any reference to operators.
Theorem 2. Suppose that {J.Ln} ~=1 weakly converges to J.L and for any n;::: 1, c(J.Ln) ;::: O. Then limn -+oo J.Ln(O) = J.L(O). Proof. First we need some notations. For a monotone function I,
For the measures J.Ln let ern be their distribution function that is
Also, let t(.-\)
= J.L( [O,.-\n . Note that er;i = ern . Let 0'(.-\) := limsupern ( .-\) n-+oo
and
Q:(.-\)
:= lim inf ern (A) . n-+oo
The following lemma trivially follows from the definitions .
144
G. Elek
Lemma 4.1. Let j be a continuous function such that
X[O ,Aj(X) ~ j(x) ~ X[O,A+iJ(x) for any 0 ~ x
~
1
+k
K, then
Proposition 4.1. <1(A)
~
t(A) = Q:+(A) = <1+(A) .
Proof. By this lemma,
~ t(A) ~ <1 (A + ~) + ~ .
<1(A)
Hence <1(A) ~ t(A) = Q:+(A) ~ <1+(A) . Since t(A) is monotone, we have that <1(A+c) ~ t(A+c) and <1+ (A) ~ t+(A) = t(A). Thus our proposition follows.
•
The following elementary analysis lemma is proved in [6]. Lemma 4.2. Let j be a continuously differentiable function on the positive reels and Jl be a probability measure on the [0, K] interval. Suppose that F is the distribution function of u, that is Jl[O , A] = F(A) . Then for any 0< e ~ K :
l
K
-l
K
j(A) dJl =
j'(A)F(A) dA + j(K)F(K) - j(c)F(c).
Assume that K ? 1, then by the previous lemma
Since
145
Betti Numbers are Testable
we have that
That is
(1) Observe that
l
K
Q:(-\) - 0'(0) -\
<
d-\ _
e
l
K
lim infn-+oo (O"n(-\) - O"n(O)) -\ d-\.
e
By Fatou's Lemma,
(2)
l
c:
K
l
lim inf n-+oo (:n(-\) - O"n(O)) d-\:::; liminf n-+oo c:
K
O"n(-\)
~ O"n(O) d-\.
Since the right hand side of (2) is less than log K, we obtain the following inequality:
l
K
Q:(-\) ~ t(O)
o. : :; log K.
Therefore, lim>.-+o Q:(-\) = 0'(0). That is by Proposition 4.1 (3)
0'(0) = t(O) .
Since one can apply (3) for any subsequence of {O"n} ~=1 we obtain that lim O"n(O) n-+oo
= t(O).
•
146 5.
G. Elek
SPECTRAL CONVERGENCE
The goal of this section is to prove the main technical proposition of our paper. Note this is based again on the ideas in [5]. Let P : jRn --* jRn be a positive, self-adjoint operator and J1p be its normalized spectral measure that is J1p(A) := the multiplicity of A as an eigenvalue. n Note that if
IIPII :s; K
then J1p is concentrated on the interval [0, K].
t
Proposition 5.1. Let {Qn}~=l c d be a convergent sequence of oriented simplicial complexes. Then there exists K > 0 such that a) For any i ~ 1 and n ~ 1, 11~~n II :s; K . b) The normalized spectral measures of {~~n} ~=1' {J1~}~=1 weakly converge.
c) c(J1~) ~ 0 for any i, n ~ 1. Proof. To show (a) it is enough to prove the following lemma. Lemma 5.1. Let L, M > 0 be positive integers. Then if A is a n x n-matrix
of real coefficients (that is a linear operator on
jRn)
such that
• each row and column of A contains at most L non-zero elements • for each entry A ,j, then
IAi,j I ::; M
IIAII :s; 2LM.
Proof. For unit-vectors i, 9 E
I(A(f) ,g)
I =1 L
jRn
A,jf(i)9(j)I:S;M
l~i ,j~n
That is I(A(j) ,g)l~
L
If(i)g(j)I ·
l~ i,j~n
I:
(J(i)2+ g(j)2).
l~i ,j~n
Note that the number of occurrences of each f(i)2 or g(j)2 is at most L hence I(A(f) ,g) 2LM. •
I::;
147
Betti Numbers are Testable
Now let us turn to part (b) . The convergence of {J.l~}:'=1 means that
Jor P(t) dJ.l~(t) K
lim
n-+oo
exists for any real polynomial P. That is one needs to prove that
exists where {At} denotes the spectrum of the i-th Laplacian of Qn . Hence it is enough to prove that the limit of normalized traces
(4) exists. The value of bobn(o, 0-) depends only on the r-neighboorhood of 0 , therefore the convergence of the complexes {Qn} ~=1 immediately implies the existence of the limit in (4). Part (c) follows from the simple fact: If Q is a symmetric integer matrix then the product of its non-negative eigenvalues is an integer as well. Indeed, let AI, A2, . .. , Aq the list of the non-zero eigenvalues of Q with multiplicities. Let p(t) = det (tI - Q) be the characteristic polynomial of Q. Then p(t) = tSq(t), where q(O) =I O. Obviously, q is an integer polynomial, A and Iq(O)1 =
ITI?=l ql· •
6.
THE PROOF OF THEOREM
1
We need to prove the following lemma.
Lemma 6.1. Let {Kn}~=l
exists for any i
~
1.
c r;d
be simplicial complexes, then
148
G. Elek
Indeed , by Lemma 6.1 we can immediately see that for any c exists <5 > 0 such that if ds(K, L) < <5 for some K, L E ~d, then
> 0 there
(5) for any i 2: 1. By the definition of the metric d; there exists some r 2: 1 and p > 0 such that if IpM(a) - PNa)1 ~ p for any r' ~ r and a E zr' ,d then ds(M, N) < <5 for any M , N E ~d . Now let L 1 , L 2 , ••• ,Lm be a finite set of simplicial complexes such that for any finite simplicial complex K there exists 1 ~ j ~ m such that
(6) for any r' ~ r and a E zr' ,d, where r, p are the constants above. The existence of such finite system is clear from compactness. By the classical Chernoff's inequality there exists N, > 0 such that the following holds: Let M E ~d be an arbitrary simplicial complex. Pick N, random vertices of M and for any r' ~ r and a E zr',d let Q(M, a) be the number of picked vertices x such that Br,(x) ~ a . Then (7)
Prob
{I Q(~: a) -
I
PM(a) >
~ for at least one
a} <
c
Thus we have the following testing algorithm. Take the simplicial complex M as an input. Pick N, random vertices and calculate Q(M, a) for all r' ~ r, a E zr,d, where r is the constant above. Check the list £1, £2, . .. , Lm. By (7), with probability more than (I-c) we find an [) such that Q(M, a) PLj(a)1 < ~ for any a. Let bi(Lj ) be our guess. Then by (5) with probability more than 1 - c
I
So, let us prove Lemma 6.1. By Proposition 5.1 .
dim Ker ~
kn
11m -----,------,,....--'-''-n-+oo
IKil
exists . Also, by the definition of the convergence of simplicial complexes limn -+oo IJ~l)1 exists , hence the lemma, and thus our Theorem follows. •
Betti Numbers are Testable
149
REFERENCES [lJ I. Benjamini and O. Schramm , Recurrence of distributional limits of finite planar graphs, Electron. J. Probab., 6 (2001), no. 23, 13 pp. (electronic). [2J
G. Elek, Combinatorial Heat Kernels and Index Theorems , Journal of Functional Analysis, 129 (1995) no. 1, 64-79.
[3J
G. Elek, A Regularity Lemma for Bounded Degree Graphs and Its Applications: Parameter Testing and Infinite Volume Limits (preprint), URL: http://arxiv.org/pdf/0711.2800v2.
[4J
O. Goldreich and D. Ron, Property Testing in Bounded Degree Graphs, Algorithmica, 32 (2002), 302-343 .
[5J W. Liick, Approximating L 2-invariants by their finite-dimensional analogues, Geom. Funct. Anal. , 4 (1994), no. 4, 455-481. [6J W. Liick, L 2-torsion and 3-manifolds, Low-dimensional topology (Knoxville, TN, 1992), 75-107. Conf. Proc . Lecture Notes Geom. Topology, III , Internat. Press (Cambridge, MA, 1994).
Gabor Elek Alfred Renyi Institute H-1053 Redltcnoda u. 13-15. Budapest Hungary a-mail :
elek~renyi .hu
BOlYAI SOCIETY MATHEMATICAL STUDIES, 20
Fete of Combinatorics, pp. 151-172.
RIGID AND GLOBALLY RIGID GRAPHS WITH PINNED VERTICES
TIBOR JORDAN*
We consider rigid and globally rigid bar-and-joint frameworks (resp. graphs) in which some joints (resp . vertices) are pinned down and hence their positions are fixed. We give an overview of some old and new results of this branch of combinatorial rigidity with an emphasis on the related optimization problems. In one of these problems the goal is to find a set P of vertices of minimum total cost for which the positions of all vertices become uniquely determined when P is pinned down. For this problem, which is motivated by the localization problem in wireless sensor networks , we give a constant factor approximation algorithm.
1. INTRODUCTION A bar-and-joint framework (or simply framework) (G, p) in d-space is a graph G = (V, E) and a map p : V -+ ]Rd. We also say that (G,p) is a ddimensional realization of G. We can think of the edges and vertices of Gin the framework as rigid (fixed length) bars and universal joints, respectively. An infinitesimal motion is a map x : V -+ ]Rd satisfying
for all edges ViVj E E . The initial velocities obtained by differentiating a smooth motion of the (vertices of the) framework which preserves the edge lengths give rise to an infinitesimal motion of (G,p). The rigidity matrix "This work was supported by the Mobile Innovation Centre, funded by the Hungarian National Office for Research and Technology.
152
T. Jordan
of the framework (G,p) is the matrix R(G,p) of size lEI x dlVl, where, for each edge e = ViVj E E, in the row corresponding to e, the entries in the two columns corresponding to vertices i and j contain the d coordinates of (p( Vi) - p( Vj)) and (p( Vj) - p( Vi)) , respectively, and the remaining entries are zeros. Example. The rigidity matrix of the framework of Figure 1 is as follows. The rows correspond to edges ab, be, ca, cd, in this order, and consecutive pairs of columns correspond to vertices a, b, c, d.
Thus x (viewed as a vector in ]RdlVl) is an infinitesimal motion if and only if R(G,p)x = O. Each translation and rotation of ]Rd gives rise to a smooth motion of (G, p) and hence to an infinitesimal motion of (G, p). These rigid motions of]Rd give rise to a subspace of dimension (d!l) in the null-space of R( G, p). Hence Lemma 1.1 [31, Lemma 11.1.3J. Let (G,p) be a framework in
(1)
]Rd. Then
rankR(G,p)::=; S(n,d),
I
where n = V(G)I and nd- ( d +2
1)
if
n~d+2
S(n,d) =
n) (2
if n::=;d+l.
We say that a framework (G, p) is infinitesimally rigid in ]Rd if the rank of its rigidity matrix R(G,p) is maximum, i.e. if equality holds in (1). A framework is rigid if it has no non-trivial smooth motions. Thus infinitesimal rigidity is a sufficient condition for rigidity. It is known that for "generic" frameworks the two notions are the same. We refer the reader to [10,31,32] for more details on the theory of rigid frameworks.
153
Rigid and Globally Rigid Graphs with Pinned Vertices
b d
a
(a)
d
d
(b)
(c)
Fig. 1. A framework in ~2 on four vertices (left) . The coordinates of the vertices are as
follows: p(a) = (0,0) , p(b) = (0,1), p(c) = (1,1), p(d) = (2,0) . Since rankR(G,p) = 4, to fix the framework one needs tracks of co-dimension four in total, which can be achieved by two one-dimensional tracks and a pin (middle) or two pins (right) .
2\VI -
2.
RIGID FRAMEWORKS WITH PINNED VERTICES
Let G = (V, E) be a graph and consider a d-dimensional realization (G, p) of G. We may fix (G,p) in jRd by restricting the infinitesimal motions of its vertices to given subspaces of jRd. Suppose that for all vertices v E V we are given a subspace U(v) S;;; jRd , generated by a subset of the standard basis of jRd . We call U (v) the track of v and we say that (G, p) is fix ed by the given set of tracks if the only infinitesimal motion x of (G,p) satisfying x( v ) E U(v) for all v E V is the zero vector x = O. In most cases we shall be interested in the special case when each track is either zero- or ddimensional. We say that P S;;; V is a pinning set if (G ,p) is fixed by the tracks U(v) = {O} if v E P , U(v) = jRd if v rt. P. We also say that the vertices in P are pinned down, or that each vertex of P is a pin. The following lemma establishes the connection between tracks (pins) that fix a framework and its rigidity matrix (see also [26, Statement 8.2.1]). Note that each track U(v) of dimension k, 0 ::; k ::; d, corresponds naturally to a subset of size k of the d columns of the rigidity matrix which belong to v. Lemma 2.1. Let (G,p) be a framework in jRd , let U = (U(v) : v E V) be a family of tracks, and let Ru be the matrix consisting of all columns of R( G, p) which correspond to the tracks U(v) , v E V. Then
(i) U fixes (G ,p) if and only if the columns of Ru are linearly independent, (ii) P is a pinning set if and only if the dlV -PI columns of R(G,p) indexed by V - P are linearly independent.
154
T. Jordan
One may ask for an optimal family of tracks that fixes a given framework by using the least possible total restriction, i.e. an assignment U = (U (v), v E V) for which U fixes (G,p) and
L (d - dim U(v)) vEV
is mmimum. By Lemma 2.1(i) an optimal family of tracks is easy to find by using a greedy algorithm to identify a maximum size independent set of columns in R(G,p). Furthermore, the optimum is unchanged if we restrict the matrix to a maximum size set of independent rows (or if we consider the corresponding subgraph of G). It is also clear that min {
L
(d - dimU(v)) : U fixes (G,p)} =
dlVl- rankR(G,p).
vEV
We obtain a much more difficult problem if we impose restrictions on the dimension of the tracks. This is the case, for example, when we consider pinning sets. The pinning number, pind(G,p), of (G,p) is defined to be the size of a smallest pinning set for (G,p) . For d = 2 Lemma 2.1(ii) implies that the smallest pinning set problem can be formulated as a matroid matching problem in a linearly represented matroid and hence pin, ( G, p) can be computed in polynomial time by using the algorithm of Lovasz [21]. A combinatorial formula for pin2(G,p) was also given by Lovasz [22]. Mansfield [25] proved that the problem of computing pin, (G, p) for a framework (G,p) is NP-hard. On the other hand, a recent result of Szabo [30] shows that there exist tractable cases even in dimensions larger than two. Theorem 2.2 [30]. The following problem is polynomial time solvable. Given a framework (G,p) in ~3 and a partition V = VI U V2 , find a family U = (U (v) : v E V) of tracks minimizing 2:vEV ( d - dim U (v)) such that U fixes (G,p) and (i) dimU(v) E {O, 1,3} for v E VI, and (ii) dim U(v) E {O, 2, 3} for v E V2 . The algorithm in [30] also uses Lovasz' matroid matching algorithm as a subroutine. If we are also given a cost function on the vertices, we may look for a pinning set of minimum total cost. Baudis et al [2] proposed an approximation
Rigid and Globally Rigid Graphs with Pinned Vertices
155
algorithm for this more general problem. For d-dimensional frameworks the approximation guarantee is 1 + ~ + + ... + ~ . Their algorithm is based on a general result about minimum cost spanning sets in d-polymatroids, see also Section 8.
!
3. RIGID GRAPHS WITH PINNED VERTICES The rigidity matrix of a d-dimensional framework (G, p) defines the rigidity matroid of (G,p) on the ground set E where a set of edges F ~ E is independent if and only if the rows of the rigidity matrix indexed by Fare linearly independent. A framework (G, p) is generic if the set of coordinates of the points p(v), v E V , is algebraically independent over the rationals. Thus, since the entries of the rigidity matrix are polynomial functions with integer coefficients, any two generic d-dimensional frameworks (G, p) and (G, q) have the same rigidity matroid. We call this the d-dimensional rigidity matroid 1?d(G) of the graph G. We denote the rank of 1?d(G) by rd(G). We say that a graph G = (V, E) is generically infinitesimally rigid, or simply rigid, in ]Rd if rd(G) = S(n, d). We say that a graph G = (V, E) is independent in ]Rd if E is independent in 1?d(G). It is not difficult to see that 1?1 (G) is the cycle matroid of G. It remains an open problem to find good characterizations for independence or, more generally, the rank function in the d-dimensional rigidity matroid of a graph when d 2': 3. Similarly, any two generic d-dimensional frameworks on G have the same pinning number. Thus we may define the pinning number of G, pind(G), as the pinning number of (G,p) of any generic framework (G,p) in ]Rd. It is easy to see that pind(G) :::; pind(G,p) for all frameworks (G,p) . The next lemma implies that computing the pinning number of G is the same as finding a smallest complete graph whose addition to G makes it rigid . For a set P ~ V (G) let G + K (P) denote the graph obtained from G by joining all pairs of non-adjacent vertices of P .
Lemma 3.1. Let G = (V, E) be a graph and P ~ V with !PI 2': d. Let (G, p) be a generic realization of G in ]Rd . Then P is a pinning set for (G, p) if and only if G + K(P) is rigid in ]Rd. Proof. Let G' = G + K(P). First suppose that G' is rigid and consider the rigidity matrix R(G',p). Since G' is rigid, the only solutions u to the equation R(G', p)u = 0 are from rigid congruences of IRd • Thus, since (G', p)
156
T. Jordan
is generic, each non-zero solution leaves at most (d - 1) vertices fixed i.e, has at most (d -1) zero entries. Suppose R (G[V - P], p) has linearly dependent columns. Then we can find a non-zero solution u' to R( G[V - P], p) u' = O. By extending u' to u by putting 0 in the components corresponding to P we obtain a non-zero solution to R(G', p)u = 0 with at least IPI ~ d zeros, a contradiction. Thus P is a pinning set by Lemma 2.1(ii) . Now suppose that P is a pinning set and order the columns of R =
R(G',p) so that the columns of P come first and the rows of E" = E(G'[p]) come first. (Then the upper right quarter is 0.) Hence r(R) ~ r( R[P,E"]) + P, E - E"]) = dlPI - (d!l) + dlV - PI = dlVl - (d!l) (by using Lemma 2.1(ii) and that G'[P] is rigid and IPI ~ d). Thus G' is rigid. •
r( R[V -
Next we show that in the pinning problem we may assume that G is independent.
Lemma 3.2. Let F ~ E be a maximal edge set of G = (V, E) for which H = (Y; F) is independent in Rd. Then (i) each pinning set of G is a pinning set of H,
(ii) pind(H) = pind(G). Proof. To prove (i) suppose, for a contradiction, that there exists a pinning set P of G for which H + K{P} is not rigid. Since G + K{P} is rigid , we have rd( G + K(P)) > Td(H + K(P)) , which implies that there is an edge e E E+E( K(P)) -(F+E( K(P))) = E-F for which F+e is independent, contradicting the maximality of F . This proves (i), from which (ii) follows immediately. • It follows from the observations above that the pinning problem in graphs (or in generic frameworks) can be attacked by purely combinatorial methods provided good characterizations for independent and rigid graphs are available. This is the case when d = 2 and we shall discuss this approach in the 2-dimensional case in the forthcoming sections.
Mansfield [25] proved that the problem of computing pin3 (G) for a graph G is NP-hard (see also [7] for a different proof), so the pinning problem in higher dimensions seems untractable. The following related result, however, might be useful in a different context as it points to a connection between high connectivity and rigidity in 3-space. It may be consider