Finding Large Clique Minors is Hard
Discrete Mathematics
2009-08-28 v2
Authors:
David Eppstein
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.
Cite
@article{arxiv.0807.0007,
title = {Finding Large Clique Minors is Hard},
author = {David Eppstein},
journal= {arXiv preprint arXiv:0807.0007},
year = {2009}
}
Comments
5 pages, 1 figure
Related papers
View all related →
Combinatorics · Mathematics
The complexity of the vertex-minor problem
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
2019-06-14
Data Structures and Algorithms · Computer Science
Hadwiger number of graphs with small chordality
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014-06-17
Combinatorics · Mathematics
Bipartite clique minors in graphs of large Hadwiger number
Matthew Wales
2021-07-15
Data Structures and Algorithms · Computer Science
Turning Cliques into Paths to Achieve Planarity
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein +4
2018-08-29
Combinatorics · Mathematics
On the Complexity of Planar Covering of Small Graphs
Ondřej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer +1
2011-08-20
Combinatorics · Mathematics
Clique minors in graphs with a forbidden subgraph
M. Bucić, J. Fox, B. Sudakov
2021-02-09
Combinatorics · Mathematics
Minors in expanding graphs
Michael Krivelevich, Benny Sudakov
2007-07-03
Combinatorics · Mathematics
Complete Minors, Independent Sets, and Chordal Graphs
Jozsef Balogh, John Lenz, Hehui Wu
2011-10-14
Combinatorics · Mathematics
Large complete minors in random subgraphs
Joshua Erde, Mihyun Kang, Michael Krivelevich
2021-07-01
Discrete Mathematics · Computer Science
Induced Minor Free Graphs: Isomorphism and Clique-width
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
2016-05-30
Combinatorics · Mathematics
On Clique Convergences of Graphs
S. M. Hegde, V. V. P. R. V. B. Suresh Dara
2015-08-18
Data Structures and Algorithms · Computer Science
Dichotomies for Tree Minor Containment with Structural Parameters
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada +1
2024-12-06
Combinatorics · Mathematics
On Detecting $H$-Induced Minors for Small $H$
Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Nicolas Trotignon
2026-04-28
Discrete Mathematics · Computer Science
On retracts, absolute retracts, and folds in cographs
Ton Kloks, Yue-Li Wang
2013-03-26
Discrete Mathematics · Computer Science
NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
2014-04-10
Combinatorics · Mathematics
Complete and almost complete minors in double-critical 8-chromatic graphs
Anders Sune Pedersen
2010-08-02
Combinatorics · Mathematics
Computing pivot-minors
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté +3
2023-11-09
Combinatorics · Mathematics
Complete Minors of Self-Complementary Graphs
Andrei Pavelescu, Elena Pavelescu
2018-09-27
Condensed Matter · Physics
A Novel Approach Applied to the Largest Clique Problem
Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov
2007-05-23
Discrete Mathematics · Computer Science
On upper bounds for parameters related to construction of special maximum matchings
Artur Khojabaghyan, Vahan V. Mkrtchyan
2011-11-17
Discrete Mathematics · Computer Science
On the complete width and edge clique cover problems
Van Bang Le, Sheng-Lung Peng
2016-12-28
Discrete Mathematics · Computer Science
A note on the clique number of complete $k$-partite graphs
Boris Brimkov
2015-07-08
Combinatorics · Mathematics
Finding Matching Cuts in $H$-Free Graphs
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022-07-15
Discrete Mathematics · Computer Science
Contracting Bipartite Graphs to Paths and Cycles
Konrad K. Dabrowski, Daniël Paulusma
2017-06-13
Combinatorics · Mathematics
Hadwiger numbers of self-complementary graphs
Andrei Pavelescu, Elena Pavelescu
2018-04-13