TOPICS
Search

Hajós Number

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

See also

Complete Graph

Explore with Wolfram|Alpha

References

Erdős, P. and Fajtlowicz, S. "On the Conjecture of Hajós." Combinatorica 1, 141-143, 1981.Gutin, G.; Kostochka, A. V.; and Toft, B. "On the Hajós Number of Graphs." Discr. Math. 213, 153-161, 2000.

Referenced on Wolfram|Alpha

Hajós Number

Cite this as:

Weisstein, Eric W. "Hajós Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/HajosNumber.html

Subject classifications