New results of Bollob\'as-type theorem for affine subspaces and projective subspaces

Abstract

Bollob\'as-type theorem has received a lot of attention due to its application in graph theory. In 2015, G\'abor Heged\"us gave an upper bound of bollob\'as-type affine subspace families for q≠ 2, and constructed an almost sharp affine subspaces pair families. In this note, we prove a new upper bound for bollob\'as-type affine subspaces without the requirement of q≠ 2, and construct a pair of families of affine subspaces, which shows that our upper bound is sharp. We also give an upper bound for bollob\'as-type projective subspaces, and prove that the Heged\"us's conjecture holds when q=2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…