Abstract
We prove that the Hadwiger number of an n-vertex graph G (the maximum size of a clique minor in G) cannot be computed in time no(n), unless the Exponential Time Hypothesis (ETH) fails. This resolves a well-known open question in the area of exact exponential algorithms. The technique developed for resolving the Hadwiger number problem has a wider applicability. We use it to rule out the existence of no(n)-time algorithms (up to the ETH) for a large class of computational problems concerning edge contractions in graphs.
- Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale. 2020. Path contraction faster than 2. SIAM J. Discret. Math. 34, 2 (2020), 1302--1325.Google Scholar
Digital Library
- Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. 2017. Split contraction: The untold story. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.Google Scholar
- Andreas Björklund. 2014. Determinant sums for undirected hamiltonicity. SIAM J. Comput. 43, 1 (2014), 280--299.Google Scholar
Digital Library
- Andreas Björklund, Thore Husfeldt, and Mikko Koivisto. 2009. Set partitioning via inclusion–exclusion. SIAM J. Comput. 39, 2 (2009), 546--563.Google Scholar
Digital Library
- B. Bollobás, P. A. Catlin, and P. Erdős. 1980. Hadwiger’s conjecture is true for almost every graph. European J. Combin. 1, 3 (1980), 195--199. DOI:https://doi.org/10.1016/S0195-6698(80)80001-1Google Scholar
Cross Ref
- Jianer Chen, Benny Chor, Michael R. Fellows, Xiuzhen Huang, David Juedes, Iyad A. Kanj, and Ge Xia. 2005. Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201, 2 (2005), 216--231. DOI:https://doi.org/10.1016/j.ic.2005.05.001Google Scholar
Digital Library
- Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, and Arkadiusz Socala. 2017. Tight lower bounds on graph embedding problems. J. ACM 64, 3 (2017), 18:1–18:22. DOI:https://doi.org/10.1145/3051094Google Scholar
Digital Library
- Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, New York.Google Scholar
Digital Library
- Fedor V. Fomin and Dieter Kratsch. 2010. Exact Exponential Algorithms. Springer. An EATCS Series: Texts in Theoretical Computer Science.Google Scholar
Digital Library
- Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, and Meirav Zehavi. 2020. Computation of Hadwiger number and related contraction problems: Tight lower bounds. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP’20) (Virtual Conference). 49:1–49:18.Google Scholar
- Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs. North-Holland Publishing Co., Amsterdam, The Netherlands.Google Scholar
Digital Library
- Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, and Paul Wollan. 2011. Finding topological subgraphs is fixed-parameter tractable. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). 479--488.Google Scholar
Digital Library
- Russell Impagliazzo and Ramamohan Paturi. 1999. Complexity of k-SAT. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity. 237--240.Google Scholar
Cross Ref
- Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. 2001. Which problems have strongly exponential complexity?J. Comput. Syst. Sci. 63, 4 (2001), 512--530.Google Scholar
Digital Library
- Eugene L. Lawler. 1976. A note on the complexity of the chromatic number problem. Inform. Process. Lett. 5, 3 (1976), 66--67.Google Scholar
Cross Ref
- Andrzej Lingas and Martin Wahlen. 2009. An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms 7, 4 (2009), 464--468. DOI:https://doi.org/10.1016/j.jda.2008.10.003Google Scholar
Digital Library
- Neil Robertson and Paul D. Seymour. 1995. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63, 1 (1995), 65--110.Google Scholar
Digital Library
- Patrick Traxler. 2008. The time complexity of constraint satisfaction. In Parameterized and Exact Computation. Springer, 190--201.Google Scholar
Index Terms
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
Recommendations
A note on Hadwiger’s conjecture for W 5-free graphs with independence number two
AbstractThe Hadwiger number of a graph G, denoted h ( G ), is the largest integer t such that G contains K t as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph G, h ( G ) ≥ χ ( G ), where χ ( G ) denotes the ...
Hadwiger Number of Graphs with Small Chordality
The Hadwiger number of a graph $G$ is the largest integer $h$ such that $G$ has the complete graph $K_h$ as a minor. We show that the problem of determining the Hadwiger number of a graph is \sf NP-hard on co-bipartite graphs but can be solved in ...
Hadwiger Number and the Cartesian Product of Graphs
The Hadwiger number η(G) of a graph G is the largest integer n for which the complete graph K n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, η(G) ≥ χ(G), where χ(G) is the chromatic number of G. In this paper, we study the ...






Comments