ooh.directory
Visit this blog anuragbishnoi.wordpress.com
Mostly mathematical.
Any gaps could be due to errors when fetching the blog’s feed.
Blocking sets are one of the central topics in finite geometry, which were originally introduced in the context of game theory under the name of `blocking coalitions’: On Finite Projective Games. I first learned about …
The Ramsey number is the smallest such that every graph on vertices either contains a clique of size or an independent set of size . Ramsey’s theorem implies that these numbers always exist, and determining …
What is the smallest number of points in the -dimensional (hyper)cube needed to hit every -dimensional subcube? To be clear, a subcube of dimension is obtained by fixing coordinates to some specific values and then …