Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Combinatorics

1,238 missions · 706 completed

The mathematics of finite and discrete structures — counting the arrangements of a set, deciding when a configuration meeting prescribed constraints can exist, and characterizing the patterns such structures are forced to contain. It encompasses enumerative and extremal combinatorics, graph theory, design theory, and additive combinatorics, with deep ties to algebra, probability, and computer science.

Missions

Open532Completed706All1238
Number Theory·Captain: LG

Erdős Problem 30: Sidon sets in {1,…,N} have size √N + O(N^ε)Open Problem

A set of integers is a Sidon set if all of its pairwise sums a+ba+ba+b (a≤ba\le ba≤b) are different. Sidon, in connection with Fourier analysis, asked how dense such sets can be, and the question became one of the standard problems of additive combinatorics. Let

9 thms5 active usersReviewed
Captain: LG

Erdős Problem 20: The Sunflower ConjectureOpen Problem

A sunflower (also called a Δ\DeltaΔ-system) with kkk petals is a family of kkk sets whose pairwise intersections are all equal to one common set, the kernel. In 1960 Erdős and Rado proved the sunflower lemma: every sufficiently large family of nnn-element sets contains a sunflower with kkk petals, and they asked how large "sufficiently large" must be (Erdős–Rado 1960)…

16 thms5 active usersReviewed
Number Theory·Captain: Zexuan Liu

Erdős Problem 142: Asymptotics for Sets Free of k-Term Arithmetic ProgressionsOpen Problem

Erdős asked, repeatedly and with a rising price tag, for an asymptotic formula for the largest subset of {1,…,N}\{1,\dots,N\}{1,…,N} that contains no arithmetic progression of a given length. He offered 1000 dollars for it in [Er97c] and 10000 dollars in [Er81, p.4], where he called the question "probably enormously difficult"; elsewhere he described it as "probably…

47 thms5 active usersReviewed
Graph Theory·Captain: hao jia

P3-Partitions of Cubic 3-Connected Graphs (OPG-46613)Open Problem

A P3P_3P3​-packing in a graph is a collection of pairwise vertex-disjoint paths on three vertices. Determining the largest such packing is NP-hard even in restricted graph classes, so structural hypotheses that force an optimal packing are of independent interest in graph factor theory. The present question asks whether 3-vertex-connectivity and cubicity force…

16 thms5 active usersReviewed
Linear Optimization·Captain: Shuze Chen

The Polynomial Hirsch ConjectureOpen Problem

The simplex method walks along edges of a polytope from vertex to vertex. Whether any pivot rule could ever make that walk short in the worst case is governed by a prior, purely geometric question: how far apart, in the edge graph, can two vertices of a polytope be? Warren Hirsch conjectured in 1957 that the diameter of a ddd-dimensional polytope with nnn facets…

82 thms5 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: Shuze Chen

Faster Dynamic Maximal Independent Set against Adaptive AdversariesResearch Paper

A maximal independent set (MIS) of a graph is a set MMM of vertices, no two adjacent, such that every vertex outside MMM has a neighbour in MMM. It is the basic symmetry-breaking object of parallel and distributed computing. In the fully dynamic setting the graph changes by edge insertions and deletions, and an algorithm must keep an MIS of the current graph…

12 thms4 active usersReviewed
Computational ComplexityGraph TheoryTheoretical Computer Science·Captain: Shuze Chen

Finding full immersions is fixed-parameter tractable in labeled tour graphsResearch Paper

Testing whether a small graph HHH is contained in a large nnn-vertex graph GGG is a central algorithmic question for every notion of containment. For graph minors the answer has been fixed-parameter tractable since Robertson and Seymour's disjoint-paths algorithm (Graph Minors XIII), and for topological minors and immersions since Grohe, Kawarabayashi, Marx and…

22 thms4 active usersReviewed
Algorithmic Game TheoryComputational Complexity·Captain: Shuze Chen

Necklace Splitting with Ten Beads per Colour is PPAD-HardResearch Paper

A necklace is a sequence of beads, each of one of nnn colours, where colour ccc occurs 2bc2b_c2bc​ times. Two thieves want to share it fairly: cut it at some positions, hand the pieces out alternately, and each thief must receive exactly bcb_cbc​ beads of every colour. Goldberg–West and Alon–West proved that nnn cuts always suffice, by a topological argument, and the search…

25 thms4 active usersReviewed
cryptographyHarmonic AnalysisInformation Theory+1·Captain: Shuze Chen

Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial IntersectionResearch Paper

In Shamir secret sharing over a prime field Fp\mathbb F_pFp​, a secret sss is shared among nnn parties by a uniformly random polynomial PPP of degree at most kkk with P(0)=sP(0)=sP(0)=s; party iii receives P(αi)P(\alpha_i)P(αi​) for distinct nonzero evaluation points αi\alpha_iαi​. Any k+1k+1k+1 parties recover the secret and any kkk learn nothing about it. Local leakage resilience (LLR) asks for more: if…

24 thms4 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: Shuze Chen

(1+ϵ)(1+\epsilon)(1+ϵ)-Distortion Spanning Tree Covers of Minor-Free Graphs with Size O(log⁡log⁡n)O(\log \log n)O(loglogn)Research Paper

A tree cover of a weighted graph approximates all of its shortest-path distances by a small number of trees: for every pair of vertices, some tree in the collection keeps their distance within a factor α\alphaα, the distortion, and no tree shortens any distance. Tree covers are a standard device for transferring tree algorithms to general graphs, with…

25 thms4 active usersReviewed
Optimization·Captain: mikedeng1

Greedy Region Growing: Improved Approximations for Cutwidth, Pathwidth, Flow-Expander Decomposition, and MoreResearch Paper

Many problems on graphs ask for a linear arrangement of the vertices that keeps some "frontier" small. In Cutwidth, the frontier of a prefix of the arrangement is the set of edges leaving it; in Pathwidth (equivalently, vertex separation, by Kinnersley 1992), it is the set of prefix vertices that still have a neighbour outside the prefix. Both are classical…

48 thms4 active usersReviewed
ProbabilityStatistical MechanicsTheoretical Computer Science·Captain: Shuze Chen

Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking ThresholdResearch Paper

The hardcore model weights the independent sets of a graph: a set III of pairwise non-adjacent vertices gets weight λ∣I∣\lambda^{|I|}λ∣I∣, and the partition function ZG,fug(λ)=∑Iλ∣I∣Z_{G,\mathrm{fug}}(\lambda)=\sum_I\lambda^{|I|}ZG,fug​(λ)=∑I​λ∣I∣ is the independence polynomial of GGG. Since Lee and Yang (1952), phase transitions of a spin system are located through the complex zeros of its partition…

93 thms4 active usersReviewed
Computational ComplexityTheoretical Computer Science·Captain: Shuze Chen

The Complexity of UnpredictabilityResearch Paper

Catalytic logspace (CL) was introduced by Buhrman, Cleve, Koucký, Loff and Speelman (BCK+14): a logarithmic-space machine is given, in addition, a polynomially long read-write catalytic tape that starts with an arbitrary string chosen by an adversary and must hold exactly that string again when the machine halts. They showed that CL contains TC1\mathsf{TC}^1TC1,…

23 thms4 active usersReviewed
Algorithmic Game TheoryInformation Theory·Captain: mikedeng1

Switching and Entropy Bounds for Stable MatchingsResearch Paper

A market can have several stable outcomes even when every participant has a strict preference list. Finding one outcome answers a different question from counting all of them. The extremal stable-matching count asks how many stable outcomes one market can admit in the worst case. It measures the possible size of the entire solution set, without selecting an…

34 thms4 active usersReviewed
Complexity TheoryDynamic Programming·Captain: mikedeng1

Get Permanent Results Faster by Counting StarsResearch Paper

The permanent combines the entries of a square matrix by summing one product for each permutation of its columns. For a matrix containing only zeros and ones, it counts perfect matchings in the corresponding bipartite graph. Over other commutative rings, the same expression is an algebraic computation problem. Its arithmetic cost measures how many additions…

22 thms4 active usersReviewed
Information TheoryProbabilityTheoretical Computer Science·Captain: mikedeng1

List Decoding, Linear Hashing, and Furstenberg over Fq\mathbb{F}_qFq​Research Paper

A linear code is a subspace C≤FqnC\le\mathbb F_q^nC≤Fqn​. It is (p,L)(p,L)(p,L)-list decodable if every Hamming ball of radius pnpnpn contains at most LLL codewords: a receiver that sees a word with at most a ppp fraction of corrupted symbols can narrow the sent codeword down to a list of at most LLL candidates. The list decoding capacity theorem says that codes of rate …

26 thms4 active usersReviewed
Graph Theory·Captain: mikedeng1

A Low-Diameter Nash-Williams–Tutte TheoremResearch Paper

A spanning tree connects all vertices of a graph without a cycle. Its unique paths provide routes between every pair of vertices. If several spanning trees share no edges, each tree supplies a separate route and failures of one edge cannot affect two of these routes. The classical Nash-Williams–Tutte theorem characterizes exactly when a finite graph…

37 thms4 active usersReviewed
Complexity TheoryLinear algebraTheoretical Computer Science·Captain: Shuze Chen

Counting Exact-One Hitting Sets in Subexponential TimeResearch Paper

Exact-One Hitting Set asks for a set of elements that meets every member of a given family exactly once. It is one of Karp's 21 NP-complete problems (Karp 1972, Problem 15), and in the language of satisfiability it is monotone exact satisfiability (XSAT): every set imposes the constraint "exactly one of these variables is true". Positive one-in-three…

17 thms4 active usersReviewed
Information TheoryProbabilityTheoretical Computer Science·Captain: Shuze Chen

Exponentially Larger Deletion-Correcting Codes and Constant-List-Decodable Insertion–Deletion CodesResearch Paper

Insertions and deletions arise when a communication or storage system loses symbol synchronization: timing errors in digital transmission, and length-changing errors in the synthesis and sequencing of DNA used for storage. Unlike a substitution, a deletion shifts every later symbol, so codes for this channel cannot rely on position-wise comparison. A…

19 thms4 active usersReviewed
Algorithmic Game TheoryOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

A Sub-3n3^n3n Upper Bound on the Number of Stable MatchingsResearch Paper

A stable matching instance has nnn men and nnn women, and each person strictly ranks every member of the other side. A perfect matching is stable if no man and woman both prefer each other to their partners. Gale and Shapley showed that a stable matching always exists (GS62). An instance can have many stable matchings, however, and Knuth asked how many it can…

29 thms4 active usersReviewed
Complexity TheoryMarkov ChainProbability·Captain: Shuze Chen

Single-Variable Connectivity in Random kkk-SATResearch Paper

Random kkk-SAT is the standard testbed for the geometry of solution spaces of random constraint satisfaction problems. Statistical-physics predictions describe a sequence of transitions as the clause density α=m/n\alpha = m/nα=m/n grows: below a clustering (reconstruction) threshold almost all solutions are expected to form one well-connected piece, above it the…

32 thms4 active usersReviewed
Complexity TheoryComputational Geometry·Captain: Shuze Chen

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares: 2×2 square packing is NP-hard for orthogonally convex grid polygonsResearch Paper

Packing problems ask how many copies of a shape fit, without overlap, into a container. One of the simplest is to decide whether kkk axis-aligned unit squares can be placed in a given polygon; scaling by two gives the equivalent problem 2 × 2-Square-Packing: given a polygon PPP and an integer kkk, decide whether PPP has room for kkk axis-aligned 2×22 \times 22×2 squares.…

23 thms4 active usersReviewed
Markov ChainProbability·Captain: mikedeng1

Glauber Dynamics for Sampling Colorings: Rapid Mixing above (1+1/e)Δ(1+1/\mathrm{e})\Delta(1+1/e)Δ via Hidden Hard-Core ModelsResearch Paper

Sampling a uniformly random proper qqq-coloring of a graph is a basic task in theoretical computer science, discrete mathematics and statistical physics, and the Glauber dynamics is the simplest sampler for it: repeatedly pick a uniformly random vertex and recolor it with a uniformly random color absent from its neighborhood. A conjecture going back to Jerrum…

31 thms4 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's AlgorithmResearch Paper

An unknown Boolean formula can be observed through examples that satisfy it. The question here is how many such examples suffice to describe approximately the same distribution of solutions. This matters in learning structured distributions: the requested hypothesis is an explicit formula whose uniformly sampled solutions resemble the observations'…

29 thms4 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: iris

Abelian Cayley High-Dimensional Expanders with Polylogarithmic DegreeResearch Paper

High-dimensional expanders (HDXs) are simplicial complexes, with triangles and higher faces as well as edges, whose local neighbourhoods are expander graphs. Random walks on their faces mix rapidly, and they underlie sparse agreement tests, new PCPs, locally testable codes and quantum LDPC codes (Mao, arXiv:2609.08937, Section 1). The notion behind…

53 thms4 active usersReviewed
PreviousPage 2 of 22Next

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