Skip to content

Anurag's Math Blog

Mostly mathematical.

  • By Anurag Bishnoi
  • Based in Netherlands
  • Roughly five posts per year
  • First post on

Posts per year

Data for this chart is available in the table below
Posts per year
Year starting Posts
2021 2
2022 1
2023 8
2024 5

Any gaps could be due to errors when fetching the blog’s feed.

Most recent posts

Constructing blocking sets using expander graphs and hypergraphs
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 …
On , by Anurag Bishnoi, 732 words
The Rank-Ramsey problem
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 …
On , by Anurag Bishnoi, 735 words
Daisies and hypercubes
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 …
On , by Anurag Bishnoi, 762 words