Solution of Hypergraph Turan problem
Vladimir Blinovsky
TL;DR
This paper introduces the Symmetrical Smoothing Method to solve the hypergraph Turan problem for (3,k)-hypergraphs, providing a new approach to a longstanding combinatorial optimization challenge.
Contribution
The paper presents the first application of the Symmetrical Smoothing Method to solve the (3,k)-hypergraph Turan problem, advancing combinatorial optimization techniques.
Findings
Solved the (3,k)-hypergraph Turan problem
Introduced the Symmetrical Smoothing Method
Provided exact solutions for specific hypergraph configurations
Abstract
Using original {\it Symmetrical Smoothing Method} we solve - hypergraph Turan problem
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Computational Geometry and Mesh Generation