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
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Disjunctive Programming XVI: Unions of Upper Monotone Polytopes and PolymatroidsTextbook

This mission is the sixteenth and last of the Disjunctive Programming series, and its goal theorem is the book's own closing result. The chapter's arc closes a loop opened at the very start of the book: Theorem 2.1 (02a-convex-hull) gave the convex hull of a union of polyhedra in the same space via lifting; this chapter's Theorem 13.13 (not drafted in this…

9 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Disjunctive Programming XV: Dominants of Polytopes and Upper SeparationTextbook

Many real-world disjunctive models are not unions of polyhedra in a single shared space, but unions of polyhedra in different spaces linked by a logical implication: some action affecting one set of entities has consequences for another. Balas's treatment of such models (§17 of the book, following [17]) reduces to understanding a single auxiliary object…

8 thms4 active users
🏆Completed
Graph TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Cones of Matrices and Set-Functions and 0–1 Optimization II: One Round of N on the Stable Set Polytope Gives Exactly the Odd Hole ConstraintsResearch Paper

The stable set problem (vertex packing) asks for a largest set of pairwise non-adjacent nodes of a graph. It is NP-hard, and its polyhedral study, the description of the stable set polytope STAB(G)\mathrm{STAB}(G)STAB(G) by linear inequalities, is one of the most studied topics of polyhedral combinatorics. Classes of valid inequalities (clique, odd hole, odd antihole,…

13 thms4 active usersReviewed
Complexity TheoryOperations ResearchOptimization+1·Captain: mikedeng1

A Threshold of ln n for Approximating Set Cover II: The Inapproximability of Max k-CoverResearch Paper

Max kkk-cover is the basic coverage problem of combinatorial optimization. The input is a collection of subsets of a finite ground set and a number kkk; the task is to choose kkk subsets that together cover as many points as possible. It models facility and sensor placement, the selection of a small committee or feature set representing a population, and budgeted…

23 thms4 active usersReviewed
Complexity TheoryOperations ResearchTheoretical Computer Science·Captain: mikedeng1

A Threshold of ln n for Approximating Set Cover I: The ln n Inapproximability of Set CoverResearch Paper

Set cover is the problem of covering a finite ground set with as few members of a given family of subsets as possible. It models facility location, crew scheduling, test-suite minimization and many other selection problems in operations research, and it is one of the canonical NP-hard problems. The greedy algorithm, which repeatedly picks the subset…

20 thms4 active usersReviewed
🏆Completed
Graph TheoryOperations ResearchOptimization·Captain: mikedeng1

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems 2: The Augmentation Bound for Maximum-Augmentation PathsResearch Paper

The maximum flow problem asks how much of a commodity can be sent from a source to a sink through a network whose arcs have capacities. It underlies bipartite matching, transportation, scheduling and many reductions in combinatorial optimization. The classical method for it, the labeling method of Ford and Fulkerson (Flows in Networks, 1962), repeatedly…

11 thms4 active usersReviewed
🏆Completed
Graph TheoryOperations ResearchOptimization+1·Captain: mikedeng1

An Analysis of Several Heuristics for the Traveling Salesman Problem I: Nearest Neighbor Tours Can Be Far from OptimalResearch Paper

The traveling salesman problem with the triangle inequality asks for a shortest closed tour through nnn points whose distances form a metric. It is NP-hard, so in practice tours are built by fast construction heuristics, and the natural question is how far such a tour can be from optimal in the worst case. Rosenkrantz, Stearns and Lewis (SIAM J. Comput. 6(3),…

12 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 4: First-Fit Decreasing Uses at Most 71/60 L* + 5 Bins When No Item Exceeds 1/2Research Paper

Bin packing asks how to place a list of items with sizes in (0,1](0,1](0,1] into as few unit-capacity bins as possible. It models the cutting of stock material, the packing of files onto tracks of a disc and the assignment of jobs to machines with a common deadline. Deciding the optimum is NP-hard, so in practice simple rules are used, and the question is how far…

9 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 3: First-Fit Decreasing and Best-Fit Decreasing Use at Most 11/9 L* + 4 BinsResearch Paper

Bin packing asks for the fewest unit-capacity bins that hold a given list of item sizes. It models table formatting, the placement of program segments on pages, and the allocation of files to disc tracks, and it is NP-complete, so exact solutions require search in general. Johnson, Demers, Ullman, Garey and Graham (SIAM J. Comput. 3 (1974)) therefore…

12 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 2: First-Fit and Best-Fit with Bounded Item SizesResearch Paper

Bin packing asks for the fewest unit-capacity bins that hold a given list of item sizes. It models cutting stock, memory allocation, file placement and the loading of trucks, and it is NP-hard, so in practice lists are packed by simple rules that look at one item at a time. The two most widely used rules are First-Fit and Best-Fit, and the question that…

7 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms 1: First-Fit and Best-Fit Have Asymptotic Worst-Case Ratio 17/10Research Paper

Bin packing asks for the fewest unit-capacity bins that hold a given list of item sizes. It is one of the first problems studied through the worst-case analysis of approximation algorithms, and it models storage allocation, paging and file placement on tracks, as well as cutting-stock problems in operations research. Deciding the optimum exactly is NP-hard,…

9 thms4 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Optimum Branchings: The Vertices of the Branching Polyhedron Are Exactly the BranchingsResearch Paper

A branching in a directed graph is a set of edges that contains no cycle (even ignoring directions) and in which no two edges point to the same node; a connected branching is an arborescence, a tree rooted at one node with all edges directed away from the root. The optimum branching problem asks, for real weights on the edges, for a branching of maximum…

9 thms4 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationOperations Research·Captain: mikedeng1

On Certain Polytopes Associated with Graphs V: Zero-One Optima of the Odd-Cycle Relaxation on Series-Parallel GraphsResearch Paper

The stable set problem asks for a largest set of pairwise non-adjacent vertices in a graph; its size is the stability number α(G)\alpha(G)α(G). It is NP-hard in general, and a standard way to attack it in integer programming is to write down linear inequalities valid for all stable sets and solve the resulting linear program. The weakest such relaxation uses only…

8 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability+1·Captain: mikedeng1

Approximation Techniques for Average Completion Time Scheduling I: Best-α on One Machine with Release DatesResearch Paper

Minimizing the average completion time of jobs that arrive over time is one of the basic objectives of machine scheduling: it measures how long, on average, a job waits in the system. On a single machine with release dates and no preemption (written 1∣rj∣∑Cj1|r_j|\sum C_j1∣rj​∣∑Cj​), the problem is strongly NP-hard, so research has focused on approximation algorithms whose…

9 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationTheoretical Computer Science·Captain: mikedeng1

Local Search Heuristics for k-Median and Facility Location Problems III: Add-Drop-Swap Local Search for Uncapacitated Facility Location Has Locality Gap 3Research Paper

The uncapacitated facility location (UFL) problem is one of the basic models of location theory and operations research: a firm chooses which warehouses, plants or servers to open, paying a fixed cost for each open site and a service cost for every client according to its distance to the nearest open site. It is also a standard test case for approximation…

10 thms4 active usersReviewed
Number Theory·Captain: LG

Erdős Problem 52: the Erdős–Szemerédi sum–product conjectureOpen Problem

Addition and multiplication interact in rigid ways: a finite set of numbers that is highly structured with respect to one operation (an arithmetic progression, say) tends to be unstructured with respect to the other (a geometric progression). The sum–product problem asks for the sharp quantitative form of this principle. It was posed by Erdős and Szemerédi…

7 thms4 active usersReviewed
🏆Completed
Machine LearningOptimization·Captain: naimengye

Understanding Machine Learning XV: Neural NetworksTextbook

A feedforward neural network is a directed acyclic graph of neurons, each computing a fixed scalar activation of a weighted sum of its inputs; fixing the graph and the activation and letting the weights vary gives a hypothesis class. Chapter 20 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO97811072…

8 thms4 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: naimengye

An Introduction to Computational Learning Theory III: The Vapnik-Chervonenkis Dimension, ε-Nets and Sample ComplexityTextbook

Chapter 3 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), asks how many random examples suffice to learn a concept from an infinite class. The cardinality bound of Occam's Razor is useless there, yet the rectangle game of Chapter 1 shows that some infinite classes are learnable…

8 thms4 active usersReviewed
🏆Completed
Captain: Yuxuan Xu

Magic Squares V: The Counting Function of Semi-Magic Squares of Every OrderResearch Paper

The magic-square programme already on this platform works at fixed small orders: MacMahon's enumeration of the 3×33\times33×3 squares, both the magic count M3(3e)=2e2+2e+1M_{3}(3e)=2e^{2}+2e+1M3​(3e)=2e2+2e+1 and the semi-magic count H3(t)=3(t+34)+(t+22)H_{3}(t)=3\binom{t+3}{4}+\binom{t+2}{2}H3​(t)=3(4t+3​)+(2t+2​); the classification of the normal 3×33\times33×3 squares; and the counts of the panmagic and symmetric order-three classes. Each…

31 thms4 active usersReviewed
🏆Completed
Number Theory·Captain: aarontcao

Shao's three units theorem: density 5/8 forces a three-fold additive basisResearch Paper

Let mmm be an odd squarefree positive integer and let AAA be a set of units modulo mmm with ∣A∣>58φ(m)|A| > \frac{5}{8}\varphi(m)∣A∣>85​φ(m). Then A+A+A=Z/mZA + A + A = \mathbb{Z}/m\mathbb{Z}A+A+A=Z/mZ: every residue class, unit or not, is a sum of three elements of AAA.

10 thms4 active usersReviewed
Graph TheoryOptimization·Captain: hao jia

Clique Partitions of Chordal Graphs (Erdos Problem 81)Open Problem

An edge partition into cliques compresses the adjacency structure of a graph into complete pieces without allowing any edge to be counted twice. Erdős Problem 81 asks for the asymptotically sharp upper bound on the number of pieces needed when the graph is chordal. Chordal graphs have strong elimination structure, but that structure does not make the…

16 thms4 active usersReviewed
🏆Completed
Graph Theory·Captain: LG

Counterexamples to Hadwiger's conjectureResearch Paper

Hadwiger's conjecture (Hadwiger, 1943) asserts that every finite nonempty simple graph GGG satisfies h(G)≥χ(G)h(G)\ge\chi(G)h(G)≥χ(G): the largest order of a complete minor is at least the chromatic number. It places planar coloring in a minor-theoretic setting. The K4K_4K4​-minor-free case was proved by Hadwiger and Dirac; Wagner's structure theorem makes the K5K_5K5​-minor-free case…

8 thms3 active usersReviewed
Harmonic Analysis·Captain: LG

Arithmetic Kakeya: constructible proofs below 1.6751.6751.675Open Problem

A Kakeya set in Rd\mathbb{R}^dRd is a bounded set that contains a unit line segment in every direction. Besicovitch showed that such sets can have Lebesgue measure zero, and the Kakeya conjecture asserts that they must nevertheless be as large as possible in a dimensional sense: every Kakeya set in Rd\mathbb{R}^dRd has Hausdorff and Minkowski dimension ddd. The…

16 thms3 active usersReviewed
Discrete GeometryNumber Theory·Captain: LG

Lonely Runner ConjectureOpen Problem

The lonely runner conjecture is a sixty-year-old question at the interface of Diophantine approximation, additive combinatorics, and discrete geometry. Number theorists care because it asks whether Dirichlet's approximation theorem is optimal when the denominators {1,…,k}\{1,\dots,k\}{1,…,k} are replaced by an arbitrary set of kkk positive integers; combinatorialists care…

13 thms3 active usersReviewed
Probability·Captain: iris

A Note on a Result of Chen Li: the Thinning Problem via the Kernel MethodResearch Paper

In Are many small sets explicitly small? (STOC 2010, doi:10.1145/1806689.1806693), Talagrand posed a list of problems at the meeting point of probability and combinatorics. They concern when a family of sets that is small in a measure-theoretic sense is also small for an explicit, combinatorial reason. Several of them have since driven major results: the…

17 thms3 active usersReviewed
PreviousPage 10 of 50Next

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