Finding Large Clique Minors is Hard
David Eppstein
TL;DR
This paper proves that determining whether a graph contains a large clique minor is an NP-complete problem, highlighting its computational difficulty.
Contribution
It establishes the NP-completeness of finding large clique minors in graphs, a fundamental problem in graph theory and algorithms.
Findings
Proves NP-completeness of detecting large clique minors
Highlights computational hardness of the problem
Provides theoretical foundation for future research
Abstract
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph K_h as a minor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory