8 citations · 9 across the 18 of their papers we have counts for
4 papers · 1 filter
Line-parallelisms of PG from Preparata-like codes
Philipp Heering, Vladislav Taranchuk
Partitions of the binary linear Hamming code into Preparata-like codes are known to induce line-parallelisms of PG. In this paper, we show that if is any Preparata-like…
Examples of diameter-2 graphs with no triangle or
Sean Eberhard, Vladislav Taranchuk, Craig Timmons
For each let denote the class of graphs other than stars that have diameter and contain neither a triangle nor a . The famous Hoffman--Singleton Theore…
On the Chromatic Number of Grassmann Graphs
Jozefien D'haeseleer, Vladislav Taranchuk
In this paper we study the chromatic number of the Grassmann graphs . We show that , which is analogous to the…
New constructions of unbalanced -free bipartite graphs
Baran Düzgün, Ago-Erik Riet, Vladislav Taranchuk
In 1979, Erdős conjectured that if , then . This conjecture was disproven by several papers and the current best-known bounds for th…