razborov_flag_algebras
CommunityDerive subgraph bounds with flag algebras.
Education & Research#lean4#flag-algebras#graph-density#ramsey-multiplicity#extremal-combinatorics#graphons#semi-definite-programming
Authorbneb
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Flag algebras convert finite subgraph counting into density-based inequalities that yield asymptotic bounds for Ramsey multiplicity and related extremal questions.
Core Features & Use Cases
- SDP-backed density certificates for graph limits
- Lean 4 certificate generation and verification
- Asymptotic bounds for Ramsey-type problems using flag algebra framework
- Works with graphon densities t(F;W) and SOS-type certificates
Quick Start
Run the guided workflow to produce a formal Lean certificate for your target density bound.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: razborov_flag_algebras Download link: https://github.com/bneb/perqed/archive/main.zip#razborov-flag-algebras Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.