From the 1 of 12 linked papers with an AI index.
12 papers
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
The paper provides an elementary proof of a perfect matching in the incidence graph of a symmetric design, links the chromatic number of Kneser graphs on projective‑plane chambers…
-free graphs containing an optimal number of 's
Vladislav Taranchuk
The generalized Turán number is the maximum number of copies of that a -free graph on vertices can contain. Recently, Poho…
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
Philipp Heering, Christian Kaspers, Vladislav Taranchuk
A function is called th-order sum-free if the sum of its values over any -dimensional affine subspace of is non-…
Recovery Algorithms 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 investigated, such as asynchronous recovery or recovery as afforded by batch codes obtained from Almost Affinely Disj…
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 . In this graph, the vertices correspond to the -dimensional s…
Large line-free sets and their applications
Jakob Führer, Vladislav Taranchuk
In this paper, we construct explicit families of polynomials with large root sets which have restricted intersections with affine lines. We use…