Anurag Bishnoi

activity

20162025

most citedSome non-existence results for distance-

j

ovoids in small generalized polygons

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2025

The generalized trifference problem

Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4

We study the problem of finding the largest number $T (n, m)$ of ternary vectors of length $n$ such that for any three distinct vectors there are at least $m$ coordinates where they…

math.CO2019

A construction for clique-free pseudorandom graphs

Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe

A construction of Alon and Krivelevich gives highly pseudorandom $K_{k}$ -free graphs on $n$ vertices with edge density equal to $Θ (n^{- 1/ (k - 2)})$ . In this short note we improve thei…

math.CO2016★ 2 cited

Some non-existence results for distance- $j$ ovoids in small generalized polygons

Anurag Bishnoi, Ferdinand Ihringer

We give a computer-based proof for the non-existence of distance- $2$ ovoids in the dual split Cayley hexagon $H (4)^{D}$ . Furthermore, we give upper bounds on partial distanc…

The generalized trifference problem

A construction for clique-free pseudorandom graphs

Some non-existence results for distance-j ovoids in small generalized polygons

Some non-existence results for distance- $j$ ovoids in small generalized polygons