Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Hajnal-Szemerédi Theorem

    Definition

    Every graph with n vertices and maximum vertex degree Δ(G)<=k is (k + 1)-colorable with all color classes of size ⌊n/(k + 1)⌋ or ⌈n/(k + 1)⌉, where ⌊x⌋ is the floor function and ⌈x⌉ is the ceiling function.

    Related term

    Seymour conjecture

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.