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

DOI10.1002/jgt.23073arXiv2206.06218MaRDI QIDQ6201033

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

stabilitymatchingmatching number

Mathematics Subject Classification ID

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

Cites Work

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

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