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
-
Updated
Jul 27, 2024 - C++
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
Competitive Programming Training
All problems solutions From Codeforces.com Website
Classification of combinatorial objects
Tool for Solving Problems in Combinatorics and Computational Mathematics
Template metaprogramming library originally spun off from CppOrderBook project.
A C++ program to find all reduced words representing a permutation
A GPU algorithm for enumerating weak pseudomanifolds
A single-file C++ library for visiting revolving door combinations.
Algorithm Design, Data Structures, ACM-ICPC, and IOI
Custom implementation of some algorithms in C++
A collection of Codes written by Sajjad Hossain Talukder which implements basic Data_Structure and Algorithms .
A subset of my solutions to the CSES competitve programming problemset (https://cses.fi/problemset/list/), mainly focused on combinatorics and graphs.
LattE integrale, software for counting lattice points and integration over convex polytopes
All possible registration plates in B&H (C++, exe, txt)
My solutions to selected Project Euler questions.
MohMahKho's Competitive Programming Library
A collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Add a description, image, and links to the combinatorics topic page so that developers can more easily learn about it.
To associate your repository with the combinatorics topic, visit your repo's landing page and select "manage topics."