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

DOI10.1002/JGT.23073MaRDI QIDQ6201033zbMATH OpenFDO

Authors Hongliang Lu, Xuechun Zhang

Publication date 25 March 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.06218

zbMATH Keywords

matchingstabilitymatching number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Abstract: A 3-graph $mathcalF$ is emph{$U(s,2s+1)$} if for any $s$ edges $e_1,\mathrm{...},e_{s}inE(mathcalF)$, $|e_{1}cup\mathrm{...}cup{e}_s|leq2s+1$. Frankl and Kupavskii (2020) proposed the following conjecture: For any $3$-graph $mathcalF$ with $n$ vertices, if $mathcalF$ is $U(s,2s+1)$, then ${\displaystyle }$e(mathcal{F})leq maxleft{{n-1choose 2}, (n-s-1){s+1choose 2}+{s+1choose 3}, {2s+1choose 3} ight}.${\displaystyle }$ In this paper, we confirm Frankl and Kupavskii's conjecture.

Recommendations

• A short proof of Erdős' conjecture for triple systems
• A stability result on matchings in 3-uniform hypergraphs
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• scientific article; zbMATH DE number 6178762
• On the maximum number of edges in a triple system not containing a disjoint family of a given size

Cites work

• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Beyond the Erdős matching conjecture
• Erdös–Ko–Rado Theorem—22 Years Later
• Families of finite sets satisfying a union condition
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Multiply-intersecting families
• On the size of graphs with complete-factors
• Simple juntas for shifted families
• The Erdős matching conjecture and concentration inequalities
• The exact bound in the Erdős-Ko-Rado theorem

This page was built for publication: A proof of Frankl–Kupavskii's conjecture on edge‐union condition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201033)