Abstract
We consider the problem of two-coloring n-uniform hypergraphs. It is known that any such hypergraph with at most \(\frac{1}{10}\sqrt{\frac{n}{\ln n}} 2^n\) hyperedges can be two-colored [7]. In fact, there is an efficient (requiring polynomial time in the size of the input) randomized algorithm that produces such a coloring. As stated [7], this algorithm requires random access to the hyperedge set of the input hypergraph. In this paper, we show that a variant of this algorithm can be implemented in the streaming model (with just one pass over the input), using space O(|V|B), where V is the vertex set of the hypergraph and each vertex is represented by B bits. (Note that the number of hyperedges in the hypergraph can be superpolynomial in |V|, and it is not feasible to store the entire hypergraph in memory.)
We also consider the question of the minimum number of hyperedges in non-two-colorable n-uniform hypergraphs. Erdős showed that there exist non-2-colorable n-uniform hypegraphs with O(n 2 2n) hyperedges and Θ(n 2) vertices. We show that the choice Θ(n 2) for the number of vertices in Erdös’s construction is crucial: any hypergraph with at most \(\frac{2 n^2}{t}\) vertices and \(2^n\exp(\frac{t}{8})\) hyperedges is 2-colorable. (We present a simple randomized streaming algorithm to construct the two-coloring.) Thus, for example, if the number of vertices is at most n 1.5, then any non-2-colorable hypergraph must have at least \(2^n \exp(\frac{\sqrt{n}}{8}) \gg n^22^n\) hyperedges. We observe that the exponential dependence on t in our result is optimal up to constant factors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 20–29 (1996)
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series. John Wiley and Sons, Inc., New York (1992)
Beck, J.: On 3-chromatic hypergraphs. Discrete Mathematics 24, 127–137 (1978)
Erdős, P.: On a combinatorial problem. Nordisk Mat. Tidsskr 11, 5–10 (1963)
Erdős, P.: On a combinatorial problem, II. Acta Mathematica of the Academy of Sciences 15, 445–447 (1964)
Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. Janos Bolyai 10, 609–627
Radhakrishnan, J., Srinivasan, A.: Improved bounds and algorithms for hypergraph 2-coloring. Random Structures Algorithms 16(1), 4–32 (2000); (also in FOCS 1998)
Karp, R.M., Papadimitriou, C.H., Shenker, S.: A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems 28, 51–55 (2003)
Kostochka, A.: Coloring uniform hypergraphs with few colors. Random Structures Algorithms 24(1), 1–10 (2004)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Moser, R.A., Tardos, G.: A constructive proof of the general Lovász local lemma. Journal of the ACM 57(2), 1–15 (2010)
Yuster, R.: Equitable coloring of k-uniform hypergraphs. SIAM Journal on Discrete Mathematics 16(4), 524–532 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radhakrishnan, J., Shannigrahi, S. (2011). Streaming Algorithms for 2-Coloring Uniform Hypergraphs. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-22300-6_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22299-3
Online ISBN: 978-3-642-22300-6
eBook Packages: Computer ScienceComputer Science (R0)