GitHub - hydroo/ramsey-number-5: Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s

hydroo / ramsey-number-5 Public

Notifications You must be signed in to change notification settings
Fork 0
Star 5

Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s

5 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 354 Commits
test-1-brute-force-straight-forward		test-1-brute-force-straight-forward
test-2-more-compile-time-and-bitmasks		test-2-more-compile-time-and-bitmasks
test-3-no-compile-time-coloring-enumeration-tree-pruning		test-3-no-compile-time-coloring-enumeration-tree-pruning
test-4-counting-automorphism-groups		test-4-counting-automorphism-groups
test-5		test-5
test-6		test-6
test-7		test-7
test-8		test-8
.clang-format		.clang-format
.gitignore		.gitignore
.vimrc		.vimrc

About

Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s

mathematics graph-theory combinatorics ramsey-numbers

Activity

5 stars

2 watching

0 forks

Report repository