Book

Nati Linial, “Discrete mathematics”

graph TD

0---1
0---4
0---5
1---2
1---6
2---3
2---7
3---4
3---8
4---9
6---8
6---9
5---7
5---8
7---9

Existence of a simple path lemma

Spanning subgraph definition

Observation

Each connected component is an induced subgraph

graph LR

1---2
2---3
3---4
4---5

graph LR

1---2
2---3
3---4
4---5
5---1

Kneser graph has vertices and is a regular graph with degree of each vertex being

If then is an empty graph

Maximal clique in is Maximal independent set in is of size

How can one measure the size of a set?

Zero

Zero here is assumed to be included in

WARNING

Not every total order gives us a bijective function or a function at all!