http://openproblemgarden.org/op/number_of_cliques_in_minor_closed_classes Comments for "Number of Cliques in Minor-Closed Classes" en http://openproblemgarden.org/op/number_of_cliques_in_minor_closed_classes <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/wood_david_r">Wood</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Question</b>&nbsp;&nbsp; Is there a constant <img class="teximage" src="/files/tex/dccee841f3f498c2c58fa6ae1c1403c5a88c5b8d.png" alt="$ c $" /> such that every <img class="teximage" src="/files/tex/ec63d7020a64c039d5f6703b8fa3ab7393358b5b.png" alt="$ n $" />-vertex <img class="teximage" src="/files/tex/7a86d3ef1cad6ecf4b2ce1338d254d4b623a47d1.png" alt="$ K_t $" />-minor-free graph has at most <img class="teximage" src="/files/tex/8ec4fa87f4377d2cbdd88cb8baab37d6198085d1.png" alt="$ c^tn $" /> cliques? </div> </tr></td> </table> </td> </tr> </table> Wood, David R. clique graph minor Graph Theory http://openproblemgarden.org/op/number_of_cliques_in_minor_closed_classes#comment Mon, 12 Oct 2009 23:59:45 +0200 David Wood 37081 at http://openproblemgarden.org