Hongliang Lu, Xuechun Zhang

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

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

AbstractA 3‐graph is if for any edges , . Frankl and Kupavskii proposed the following conjecture: For any 3‐graph with vertices, if is , then In this paper, we confirm Frankl and Kupavskii's conjecture.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive