June 9, 2024Open Access

Almost t-intersecting families for vector spaces

Key Points

Key points are not available for this paper at this time.

Abstract

Let V be a finite dimensional vector space over a finite field. A family F consisting of k-subspcaes of V is called almost t-intersecting if for each F F there is at most one F^ F with (F F^) t-1. In this paper, we determine the maximum value and the extremal structure of almost t-intersecting families. We also solve the same problems for almost t-intersecting families but not t-intersecting.

Read Full Paperexternally

Ask AI

Helpful

Bookmark

View Full Paper

Cite This Study

Liu et al. (Sun,) studied this question.

synapsesocial.com/papers/68e65872b6db6435875e7813 https://doi.org/https://doi.org/10.48550/arxiv.2406.05840

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A complete $t$-intersection theorem for families of spanning trees2025
2Stabilities for Non-Uniform $t$-Intersecting Families2024 · 5 citations
3On set systems with strongly restricted intersections2024
4$\mathcal{L}$-intersecting or Configuration Forbidden Families on Set Systems and Vector Spaces over Finite Fields2024
5On cover-free families of finite vector spaces2024

Ask AI

Helpful

Bookmark

View Full Paper