Compute lower bounds on subgraph densities using Razborov's flag algebra method.
npx skills add https://github.com/bneb/perqed --skill razborov-flag-algebras
Please help me install this Agent Skill. Skill: razborov_flag_algebras Source: https://github.com/bneb/perqed/tree/main/.agents/skills/razborov_flag_algebras Command: npx skills add https://github.com/bneb/perqed --skill razborov-flag-algebras
Flag algebras convert finite subgraph counting into density-based inequalities that yield asymptotic bounds for Ramsey multiplicity and related extremal questions.
Run the guided workflow to produce a formal Lean certificate for your target density bound.
High-intent search queries and answers about installing and using this skill.
You compute asymptotic density bounds by converting finite subgraph counts into density inequalities, then verifying them with an SDP-based PSD matrix approach and a Lean 4 certificate workflow. This method targets extremal combinatorics problems where finite search stalls.
The best way to prove limits for Ramsey multiplicity is applying flag algebra frameworks that yield asymptotic bounds. This method generates SOS-type certificates for graphon densities t(F;W) to resolve Ramsey-type problems when finite graph enumeration stalls.
Yes, you need Lean 4 to verify semi-definite programming density certificates for graphons. The workflow requires a Lean 4 certificate generation and verification step to formally validate the SDP-backed PSD matrix approach for your target density bound.
Yes, you can use flag algebras with type sigma flags and finite graph enumeration to solve graph density problems. The framework processes t(F;W) densities and finite subgraph counts to derive asymptotic bounds for extremal combinatorics questions.
Finite graph search stalls when deriving Ramsey multiplicity bounds because exhaustive enumeration cannot scale to asymptotic limits. Flag algebras help by converting finite subgraph counting into density-based inequalities solved via semi-definite programming.
bnebConstruct diagonal elements to prove non-enumerability in Lean 4.
fmhallConvert runtime bounds checks to proven bounds in Lean 4 code.
bnebNLP-based grammar and style correction for your writing, available as a VS Code extension and/or standalone Python library.
0bserver07Prove combinatorial identities using double counting or bijection techniques.
