$3$-cluster-free families of subspaces
Combinatorics
2024-03-11 v1
Abstract
Three -dimensional subspaces , , and of an -dimensional vector space over a finite field are called a -cluster if and yet . A special kind of -cluster, which we call a covering triple, consists of subspaces such that . We prove that, for , the largest size of a covering triple-free family of -dimensional subspaces is the same as the size of the largest such star (a family of subspaces all containing a designated non-zero vector). Moreover, we show that if , then stars are the only families achieving this largest size. This in turn implies the same result for -clusters, which gives the vector space-analogue of a theorem of Mubayi for set systems.
Cite
@article{arxiv.2403.04895,
title = {$3$-cluster-free families of subspaces},
author = {Gabriel Currier and Shahriar Shahriari},
journal= {arXiv preprint arXiv:2403.04895},
year = {2024}
}
Comments
11 pages, 2 figures, comments welcome!