A note on generalized chromatic number and generalized girth (Q1970697): Difference between revisions

\textit{P. Erdős} [Graph theory and probability, Can. J. Math. 11, 34-38 (1959; Zbl 0084.39602)] proved that there are graphs with arbitrarily large girth and chromatic number. The paper under review proves a similar result for a generalized chromatic number and generalized girth. For a given graph \(H\), the \(H\)-chromatic number of \(G\) is the minimum size of a partition of \(V(G)\) into classes that induce subgraphs of \(G\) not containing \(H\) as a subgraph, the \(H\)-girth of \(G\) is somewhat more complicated.