2000 character limit reached
New results of Bollobás-type theorem for affine subspaces and projective subspaces
Published 16 Jan 2025 in math.CO | (2501.09215v1)
Abstract: Bollob\'{a}s-type theorem has received a lot of attention due to its application in graph theory. In 2015, G\'{a}bor Heged{\"u}s gave an upper bound of bollob\'{a}s-type affine subspace families for , and constructed an almost sharp affine subspaces pair families. In this note, we prove a new upper bound for bollob\'{a}s-type affine subspaces without the requirement of , 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\'{a}s-type projective subspaces, and prove that the Heged{\"u}s's conjecture holds when .
Paper Prompts
Sign up for free to create and run prompts on this paper.