On Hadwiger's number---A problem of the Nordhaus-Gaddum type
For a graph \(G\), \(\overline G\) denotes its complement and \(h(G)\) is the maximum order of a clique to which \(G\) can be contracted. Let \(F(n,k)\) denote \(\max h(\overline G)\) for all graphs \(G\) with order \(n\) and \(h(G)=k\). Analogously \(f(n,k)\) is \(\min h(\overline G)\). The values of \(F(n,k)\) for all \(n\) and \(k\) and a lower bound of \(f(n,k)\) for \(2\leq k\leq 3\) are given among others.
scientific article; zbMATH DE number 89911
scientific article