Abstract
The Probabilistic Method ([AS]) is a lasting legacy of the late Paul Erdős. We give two examples – both problems first formulated by Erdős in the 1960s with new results in the last decade and both with substantial open questions. Further in both examples we take a Computer Science vantagepoint, creating a probabilistic algorithm to create the object (coloring, packing, respectively) and showing that with positive probability the created object has the desired properties.
-
Given m sets each of size n (with an arbitrary intersection pattern) we want to color the underlying vertices Red and Blue so that no set is monochromatic. Erdős showed this may always be done if m< 2n − 1 (proof: color randomly!). We give an argument of Srinivasan and Radhakrishnan ([RS]) that extends this to \(m<c2^n\sqrt{n/\ln n}\). One first colors randomly and then recolors the blemishes with a clever random sequential algorithm.
-
In a universe of size N we have a family of sets, each of size k, such that each vertex is in D sets and any two vertices have only o(D) common sets. Asymptotics are for fixed k with N,D→∞. We want an asymptotic packing, a subfamily of ~ N/k disjoint sets.
Erdős and Hanani conjectured such a packing exists (in an important special case of asymptotic designs) and this conjecture was shown by Rödl. We give a simple proof of the author ([S]) that analyzes the random greedy algorithm.
Paul Erdős was a unique figure, an inspirational figure to countless mathematicians, including the author. Why did his view of mathematics resonate so powerfully? What was it that drew so many of us into his circle? Why do we love to tell Erdős stories? What was the magic of the man we all knew as Uncle Paul?
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Chichester (2000)
Radhakrishnan, J., Srinivasan, A.: Improved bounds and algorithms for hypergraph two-coloring. Random Structures and Algorithms 16, 4–32 (2000)
Spencer, J.: Asymptotic Packing via A Branching Process. Random Structures and Algorithms 7, 167–172 (1995); Sarukkai, S., Sen, S. (eds.): FSTTCS 2005. LNCS, vol. 3821. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spencer, J. (2005). Erdős Magic. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_7
Download citation
DOI: https://doi.org/10.1007/11590156_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)