Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Extremal Graph Theory

1 missions · 0 completed

Missions

Open1Completed0All1
CombinatoricsGraph Theory·Captain: utkuokur

Ten Challenges 04: Sidorenko's conjecture for bipartite graphs with bounded sidesOpen Problem

How many copies of a fixed graph HHH must a graph GGG of given edge density contain? For bipartite HHH, Sidorenko's conjecture gives the cleanest possible answer: the random graph of the same density contains the fewest, so the homomorphism density of HHH in GGG is at least the edge density of GGG raised to the number of edges of HHH. The statement was conjectured…

9 thms3 active usersReviewed

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me