A proof of Frankl-Kupavskii's conjecture on edge-union condition

preprint2023arXivOpen access

Abstract

A 3-graph F\mathcal{F} is \emph{U(s,2s+1)U(s, 2s+1)} if for any ss edges e1,...,es∈E(F)e_1,...,e_s\in E(\mathcal{F}), ∣e1∪...∪es∣≤2s+1|e_1\cup...\cup e_s|\leq 2s+1. Frankl and Kupavskii (2020) proposed the following conjecture: For any 33-graph F\mathcal{F} with nn vertices, if F\mathcal{F} is U(s,2s+1)U(s, 2s+1), then e(F)≤max⁡{(n−12),(n−s−1)(s+12)+(s+13),(2s+13)}.e(\mathcal{F})\leq \max\left\{{n-1\choose 2}, (n-s-1){s+1\choose 2}+{s+1\choose 3}, {2s+1\choose 3}\right\}. In this paper, we confirm Frankl and Kupavskii's conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.