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

DOI10.1002/JGT.23073arXiv2206.06218MaRDI QIDQ6201033FDOQ6201033

Authors: Hongliang Lu, Xuechun Zhang 

Publication date: 25 March 2024

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

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.

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

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

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)

Cites Work

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

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)