V. Taranchuk

activity

20162026

most citedA New Lower Bound for van der Waerden Numbers

8 citations · 9 across the 18 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

$K_{2, t + 1}$ -free graphs containing an optimal number of $K_{t, t}$ 's

Vladislav Taranchuk

The generalized Turán number $e x (n, K_{t, t}, K_{2, t + 1})$ is the maximum number of copies of $K_{t, t}$ that a $K_{2, t + 1}$ -free graph on $n$ vertices can contain. Recently, Pohoa…

cs.IT2026

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions

Philipp Heering, Christian Kaspers, Vladislav Taranchuk

A function $F : F_{2}^{n} \to F_{2}^{m}$ is called $k$ th-order sum-free if the sum of its values over any $k$ -dimensional affine subspace of $F_{2}^{n}$ is non-…

math.CO2026

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

Philipp Heering, Klaus Metsch, Vladislav Taranchuk +1

Let $D = (P, B)$ be a symmetric $(v, k, λ)$ -design and let $(X, Y)$ be an equinumerous incidence-free pair, with $X \subseteq P$ and $Y \subseteq B$ …

cs.IT2026

Recovery Models for Linear Batch Codes

Baran Düzgün, Henk D. L. Hollmann, Ago-Erik Riet +2

Various types of recovery algorithms for batch codes have been considered previously, including asynchronous recovery and recovery algorithms arising from Almost Affinely Disjoint…

math.CO2026

Chromatic Number of Grassmann Graphs and MRD codes

Jozefien D'haeseleer, Francesco Pavese, Paolo Santonastaso +1

In this paper we investigate the chromatic number of the Grassmann graphs and of their powers, denoted $J_{q} (n, m, t)$ . In this graph, the vertices correspond to the $m$ -dimensional s…

K2,t+1​-free graphs containing an optimal number of Kt,t​'s

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

Recovery Models for Linear Batch Codes

Chromatic Number of Grassmann Graphs and MRD codes

$K_{2, t + 1}$ -free graphs containing an optimal number of $K_{t, t}$ 's