Hajós Number

The Hajós number of a graph is the maximum such that contains a subdivision of the complete graph .

Explore with Wolfram|Alpha

More things to try:

graph properties
1275 to Greek numerals
det {{a, b, c}, {d, e, f}, {g, h, j}}

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

Hajós Number

See also

Explore with Wolfram|Alpha

References

Referenced on Wolfram|Alpha

Cite this as:

Subject classifications