Personal research

Non-isomorphic graphs have distinct vertex-Ramsey classes

Article items and their immediate prerequisites, ordered by dependency level.

Dependency graph of article pages

Arrows run from prerequisite pages to dependent ones.

Article items · 01 — The complete graph on an $n$ -element vertex set has $(\binom{n}{2})$ edges
Article items · 02 — A finite set with $n$ elements has exactly $(\binom{n}{2})$ two-element subsets, and $2 (\binom{n}{2}) = n (n - 1)$
Article items · 03 — Order, size, complement and independence number
Article items · 04 — High-girth hypergraphs for Construction 1