Document Open Access Logo

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors

Authors Venkatesan Guruswami, Sai Sandeep



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2020.62.pdf
  • Filesize: 474 kB
  • 12 pages

Document Identifiers

Author Details

Venkatesan Guruswami
  • Carnegie Mellon University, Pittsburgh, PA, USA
Sai Sandeep
  • Carnegie Mellon University, Pittsburgh, PA, USA

Cite AsGet BibTex

Venkatesan Guruswami and Sai Sandeep. d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 62:1-62:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ICALP.2020.62

Abstract

The d-to-1 conjecture of Khot asserts that it is NP-hard to satisfy an ε fraction of constraints of a satisfiable d-to-1 Label Cover instance, for arbitrarily small ε > 0. We prove that the d-to-1 conjecture for any fixed d implies the hardness of coloring a 3-colorable graph with C colors for arbitrarily large integers C. Earlier, the hardness of O(1)-coloring a 4-colorable graphs is known under the 2-to-1 conjecture, which is the strongest in the family of d-to-1 conjectures, and the hardness for 3-colorable graphs is known under a certain "fish-shaped" variant of the 2-to-1 conjecture.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational complexity and cryptography
Keywords
  • graph coloring
  • hardness of approximation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998. URL: https://doi.org/10.1145/278298.278306.
  2. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998. URL: https://doi.org/10.1145/273865.273901.
  3. Jakub Bulín, Andrei Krokhin, and Jakub Opršal. Algebraic approach to promise constraint satisfaction. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pages 602-613, 2019. Google Scholar
  4. J Csima and B.N Datta. The DAD theorem for symmetric non-negative matrices. Journal of Combinatorial Theory, Series A, 12(1):147-152, 1972. Google Scholar
  5. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. On non-optimally expanding sets in grassmann graphs. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 940-951, 2018. Google Scholar
  6. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. Towards a proof of the 2-to-1 games conjecture? In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 376-389, 2018. Google Scholar
  7. Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. SIAM J. Comput., 39(3):843-873, 2009. Google Scholar
  8. Irit Dinur and Samuel Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162(1):439-485, 2005. Google Scholar
  9. Ken-Ichi Kawarabayashi and Mikkel Thorup. Coloring 3-colorable graphs with less than n^1/5 colors. J. ACM, 64(1), March 2017. Google Scholar
  10. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pages 767-775, 2002. URL: https://doi.org/10.1145/509907.510017.
  11. Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37(1):319-357, 2007. URL: https://doi.org/10.1137/S0097539705447372.
  12. Subhash Khot, Dor Minzer, and Muli Safra. On independent sets, 2-to-2 games, and Grassmann graphs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 576-589, 2017. Google Scholar
  13. Subhash Khot, Dor Minzer, and Muli Safra. Pseudorandom sets in Grassmann graph have near-perfect expansion. In 59th IEEE Annual Symposium on Foundations of Computer Science, pages 592-601, 2018. Google Scholar
  14. Andrei Krokhin, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. Topology and adjunction in promise constraint satisfaction, 2020. URL: http://arxiv.org/abs/2003.11351.
  15. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. Annals of Mathematics, 171(1):295-341, 2010. URL: https://doi.org/10.4007/annals.2010.171.295.
  16. Ryan O'Donnell and Yi Wu. Conditional hardness for satisfiable 3-CSPs. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pages 493-502, 2009. Google Scholar
  17. S. Poljak and V. Rödl. On the arc-chromatic number of a digraph. Journal of Combinatorial Theory, Series B, 31(2):190-198, 1981. URL: https://doi.org/10.1016/S0095-8956(81)80024-X.
  18. Ran Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803, 1998. Google Scholar
  19. Richard Sinkhorn and Paul Knopp. Concerning nonnegative matrices and doubly stochastic matrices. Pacific Journal of Mathematics, 21(2):343-348, 1967. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail