7 citations · 30 across the 25 of their papers we have counts for
5 papers · 1 filter
Incidence-free sets and edge domination in incidence graphs
Sam Spiro, Sam Adriaensen, Sam Mattheus
A set of edges of a graph is an edge dominating set if every edge of intersects at least one edge of , and the edge domination number is the smallest size o…
Cones from maximum -scattered linear sets and a stability result
Sam Adriaensen, Jonathan Mannaert, Paolo Santonastaso +1
This paper mainly focuses on cones whose basis is a maximum -scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we a…
On additive MDS codes with linear projections
Sam Adriaensen, Simeon Ball
We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let be an -linear $(n,q^{hk},n-k+1)…
Blocking subspaces with points and hyperplanes
Sam Adriaensen, Maarten De Boeck, Lins Denaux
In this paper, we characterise the smallest sets consisting of points and hyperplanes in , such that each -space is incident with at least one element of …
Stability of Erdős-Ko-Rado Theorems in Circle Geometries
Sam Adriaensen
Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in 3-dimensional space. In a previous paper, the author character…