Sign inSign in

Bounded-degree graph kernel bound

When all vertex degrees are bounded by k and the vertex cover size is at most k, the total number of edges is bounded by k squared.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Graph degrees1Vertex cover1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.