 
Summary: Approximating the maximum clique minor and
some subgraph homeomorphism problems
Noga Alon1
, Andrzej Lingas2
, and Martin Wahlen2
1
Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv. nogaa@tau.ac.il
2
Department of Computer Science, Lund University, 22100 Lund.
Andrzej.Lingas@cs.lth.se, martin@cs.lth.se, Fax +46 46 13 10 21
Abstract. We consider the "minor" and "homeomorphic" analogues
of the maximum clique problem, i.e., the problems of determining the
largest h such that the input graph (on n vertices) has a minor isomorphic
to Kh or a subgraph homeomorphic to Kh, respectively, as well as the
problem of finding the corresponding subgraphs. We term them as the
maximum clique minor problem and the maximum homeomorphic clique
problem, respectively. We observe that a known result of Kostochka and
Thomason supplies an O(
n) bound on the approximation factor for
