Approximations to the Kruskal-Katona theorem
Andrew Frohmader
TL;DR
This paper presents simplified, approximate versions of the Kruskal-Katona theorem that are easier to compute, providing practical tools despite being less precise than the original theorem.
Contribution
It introduces new approximate formulas for the Kruskal-Katona theorem that are simpler to use in numerical applications.
Findings
Approximations are proven to be valid.
Simpler formulas facilitate practical computations.
Approximate bounds are established.
Abstract
Approximations to the Kruskal-Katona theorem are stated and proven. These approximations are weaker than the theorem, but much easier to work with numerically.
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 · Random Matrices and Applications · Markov Chains and Monte Carlo Methods