Abstract
In this note we consider the problem of deciding whether a given r-uniform hypergraph H with minimum vertex degree at least \(c\binom{|V(H)|-1}{r-1}\), has a vertex 2-coloring and a strong vertex k-coloring. Motivated by an old result of Edwards for graphs, we summarize what can be deduced from his method about the complexity of these problems for hypergraphs. We obtain the first optimal dichotomy results for 2-colorings of 3- and 4-uniform hypergraphs according to the value of c. In addition, we determine the computational complexity of strong k-colorings of 3-uniform hypergraphs for some c, leaving a gap which vanishes as k→ ∞.
This is a preview of subscription content, log in via an institution to check access.
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
Agnarsson, G., Halldorssón, M.: Strong colorings of hypergraphs. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 253–266. Springer, Heidelberg (2005)
Bollobás, B.: Extremal Graph Theory. Academic Press, London (1978)
Erdős, P., Simonovits, M.: Supersaturated graphs and hypergraphs. Combinatorica 3(2), 181–192 (1983)
De Caen, D., Füredi, Z.: The maximum size of 3-uniform hypergraphs not containing a Fano plane. J. Combinatorial Theory B 78, 274–276 (2000)
Chen, H., Frieze, A.: Coloring Bipartite Hypergraphs. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 345–358. Springer, Heidelberg (1996)
Edwards, K.: The complexity of colouring problems on dense graphs. Theoretical Computer Science 43, 337–343 (1986)
Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4), 691–703 (1976)
Karpiński, M., Ruciński, A., Szymańska, E.: The Complexity of Perfect Matching Problems on Dense Hypergraphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 626–636. Springer, Heidelberg (2009)
Karpiński, M., Ruciński, A., Szymańska, E.: Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 663–674. Springer, Heidelberg (2010)
Lovász, L.: Coverings and coloring of hypergraphs. In: Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory, and Computing, (Florida Atlantic Univ., Boca Raton, Fla., 1973), p. 312 (1973)
Person, Y., Schacht, M.: An expected polynomial time algorithm for coloring 2-colorable 3-graphs. In: Proceedings of EuroComb 2009. Electronic Notes In Discrete Mathematics, vol. 34, pp. 465–469 (2009)
Pikhurko, O.: Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree. Graphs Combin. 24(4), 391–404 (2008)
Rödl, V., Ruciński, A., Szemerédi, E.: Diracs theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15(1-2), 229–251 (2006)
Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory, Ser. A 116, 613–636 (2009)
Szymańska, E.: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 438–449. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szymańska, E. (2010). The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)