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

doi:10.1002/jgt.23073

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

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

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

More from our Archive

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

Modified Two-Parameter Liu Estimator for Addressing Multicollinearity in the Poisson Regression Model

Special Issue “Optimisation Models and Applications”

A Note on the Time-Fractional Navier–Stokes Equation and the Double Sumudu-Generalized Laplace Transform Decomposition Method

Specific Features of Polynomials in Several Examples

Results of Third-Order Strong Differential Subordinations

Introduction in third-order fuzzy differential subordination

A numerical approach for a dynamical system of fractional infectious disease problem

Construction of a new generalization for n-polynomial convexity with their certain inequalities

Reduced-Order Modeling for Heston Stochastic Volatility Model