9 citations · 10 across the 8 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
Generalized ovals, 2.5-dimensional additive codes, and multispreads
Denis S. Krotov, Sascha Kurz
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of…
math.CO2025
The spectral Turán problem: Characterizing spectral-consistent graphs
Longfei Fang, Sergey Goryainov, Denis Krotov +2
Let and denote the families of -free graphs of order with maximum size and maximum spectral radius, respectively. A graph is called spe…
math.CO2025
Maximum Size -Intersecting Families and Anticodes
Xuan Wang, Tuvi Etzion, Denis Krotov +1
The maximum size of -intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erdős-Ko-Rado theorem. Such intersecting families,…