Anurag Bishnoi

activity

20172026

most citedOn regular induced subgraphs of generalized polygons

7 citations · 10 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2026

Multicolor vector space Ramsey numbers over the binary field

Anurag Bishnoi, Gaurav Kucheriya

For every fixed integer $t \geq 2$ , we give an upper bound on the multicolor vector space Ramsey number $R_{2} (t; k)$ that is a tower function of height independent of $k$ . For $t \g…

math.CO2026

Hat guessing with proper colorings

Sam Adriaensen, Peter Bentley, Anurag Bishnoi +6

We initiate the study of the hat guessing number of a graph where the adversary is only allowed to provide a proper coloring of the graph. This is the largest number $q$ for which…

math.CO2025

The chromatic number of finite projective spaces

Anurag Bishnoi, Wouter Cames van Batenburg, Ananthakrishnan Ravi

The chromatic number of the finite projective space $PG (n - 1, q)$ , denoted $χ_{q} (n)$ , is the minimum number of colors needed to color its points so that no line is monochroma…

math.CO2024

New bounds and constructions for large partial $m$ -ovoids and related structures

John Bamberg, Anurag Bishnoi, Ferdinand Ihringer +1

We use $p$ -rank bounds on partial ovoids and the classical bounds on Ramsey numbers to obtain upper bounds on the size of partial $m$ -ovoids in finite classical polar spaces. These…

math.CO2022

A new upper bound on the minimum degree of minimal Ramsey graphs

Anurag Bishnoi, Thomas Lesgourgues

We prove that $s_{r} (K_{k + 1}) = O (k^{3} r^{3} lo g^{3} k)$ , where $s_{r} (K_{k})$ is the Ramsey parameter introduced by Burr, Erdős and Lovász in 1976, which is defined as the smallest minimum…

math.CO2021

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens +3

A graph $G$ is said to be $q$ -Ramsey for a $q$ -tuple of graphs $(H_{1}, \dots, H_{q})$ , denoted by $G \to_{q} (H_{1}, \dots, H_{q})$ , if every $q$ -edge-coloring of $G$ contains a monochromatic c…

math.CO2020★ 3 cited

The minimum degree of minimal Ramsey graphs for cliques

John Bamberg, Anurag Bishnoi, Thomas Lesgourgues

We prove that $s_{r} (K_{k}) = O (k^{5} r^{5/2})$ , where $s_{r} (K_{k})$ is the Ramsey parameter introduced by Burr, Erdős and Lovász in 1976, which is defined as the smallest minimum degree of…

math.CO2017★ 7 cited

On regular induced subgraphs of generalized polygons

John Bamberg, Anurag Bishnoi, Gordon F. Royle

The cage problem asks for the smallest number $c (k, g)$ of vertices in a $k$ -regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to ex…