Ritesh Goenka

activity

20192026

most citedContact Tracing Enhances the Efficiency of COVID-19 Group Testing

21 citations · 25 across the 13 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2026

The extensible no-four-on-a-circle problem

Anubhab Ghosal, Ritesh Goenka

We show that there exists a set $S \subset Z^{2}$ containing no four points on a circle or a line such that $∣ S \cap [n]^{2} ∣ = Ω (n)$ as $n \to \infty$ . Since any no-f…

math.CO2026

No- $(k + 1)$ -in-line problem for $k ⩾ 3$

Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3

What is the maximum number of points one can place in an $n \times n$ grid such that every Euclidean line contains at most $k$ points? For $k = 2$ , this is the notorious no-three-i…

math.CO2026

Congruent copies of finite patterns in planar point sets

Shubhrajit Bhattacharya, Ritesh Goenka

Given a finite nonempty planar point set $S$ , what is the maximum number of congruent copies of $S$ contained in a set of $n$ points in the Euclidean plane? Building on OpenAI's re…

math.CO2026

Point sets avoiding near-integer distances

Ritesh Goenka, Kenneth Moore

Let $d \in N$ , $δ \in (0, 1/2)$ , and $X > 0$ . Denote by $N_{d} (X, δ)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $R^{d}$ su…

math.CO2025

On subsets of lattice cubes avoiding affine and spherical degeneracies

Anubhab Ghosal, Ritesh Goenka, Peter Keevash

For integers $1 < k < d - 1$ and $r \geq k + 2$ , we establish new lower bounds on the maximum number of points in $[n]^{d}$ such that no $r$ lie in a $k$ -dimensional affine (or linear) su…

math.CO2025

The maximum number of triangles in $K_{1, s, t}$ -free graphs

Asier Calbet, Ritesh Goenka

We consider the following generalized Turán problem: For $2 \leq s \leq t$ , what is the maximum number of triangles in a $K_{1, s, t}$ -free graph on $n$ vertices? The previously best k…

math.CO2023★ 2 cited

An exponential bound for simultaneous embeddings of planar graphs

Ritesh Goenka, Pardis Semnani, Chi Hoi Yip

We show that there are $O (n \cdot 4^{n /11})$ planar graphs on $n$ vertices which do not admit a simultaneous straight-line embedding on any $n$ -point set in the plane. In particula…

math.CO2023

Improved estimates on the number of unit perimeter triangles

Ritesh Goenka, Kenneth Moore, Ethan Patrick White

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point…

The extensible no-four-on-a-circle problem

No-(k+1)-in-line problem for k⩾3

Congruent copies of finite patterns in planar point sets

Point sets avoiding near-integer distances

On subsets of lattice cubes avoiding affine and spherical degeneracies

The maximum number of triangles in K1,s,t​-free graphs

An exponential bound for simultaneous embeddings of planar graphs

Improved estimates on the number of unit perimeter triangles

No- $(k + 1)$ -in-line problem for $k ⩾ 3$

The maximum number of triangles in $K_{1, s, t}$ -free graphs