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
Complexity TheoryOperations ResearchOptimization·Captain: iris

A Constructive FPT Algorithm for Integer Cone Optimization with Convex CostsResearch Paper

Many packing, covering and scheduling problems ask how a collection of locally feasible objects can be combined into a global solution. A bin configuration, the load of one machine, or one allocation of resources is a generator. A nonnegative integer multiplicity records how often it is used, and the sum of the chosen generators must satisfy global…

30 thms3 active usersReviewed
Graph TheoryOperations ResearchProbability·Captain: iris

Designing Sparse Graphs for Stochastic Matching with an Application to Middle-Mile Transportation Management: The K-Ring's Matching Loss Is at Most 3n/(d+1)·q^((d+1)/3)Research Paper

In middle-mile parcel transportation, a carrier decides in advance which pairs of stations may share a truck route; on a given day only some stations have enough residual demand to need one, and the routes actually used pair up these active stations. Allowing every pair is the most flexible design but the hardest to operate, so the question is how few…

20 thms3 active usersReviewed
Extremal Graph TheoryGraph 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
Graph TheoryMathematical Logic·Captain: utkuokur

Ten Challenges 06: Better-quasi-ordering of finite graphs under minorsOpen Problem

The Graph Minor Theorem of Robertson and Seymour states that finite graphs are well-quasi-ordered by the minor relation: in every infinite sequence of finite graphs, some graph is a minor of a later one. It is one of the deepest results of combinatorics, and it implies that every minor-closed class of graphs is characterised by finitely many excluded…

23 thms3 active usersReviewed
Graph TheoryMathematical Logic·Captain: utkuokur

Ten Challenges 10: Unfriendly partition conjectureOpen Problem

A partition of the vertices of a graph into two classes is unfriendly if every vertex has at least as many neighbours in the other class as in its own. Every finite graph has one: a partition with the maximum number of crossing edges. For infinite graphs the question is the unfriendly partition conjecture of Cowan and Emerson: does every countable graph…

10 thms3 active usersReviewed
Algorithmic Game TheoryMarkov ChainProbability·Captain: iris

Sampling from the Gibbs Distribution in Congestion Games: Relaxed Logit Dynamics in Extension Parallel Congestion Games Mix within n3(log⁡(nlog⁡∣P∣+TΦmax⁡)+log⁡(1/(2ϵ2)))n^3(\log(n\log|P|+T\Phi_{\max})+\log(1/(2\epsilon^2)))n3(log(nlog∣P∣+TΦmax​)+log(1/(2ϵ2))) StepsResearch Paper

Logit dynamics is the standard model of noisy best-response play: repeatedly, a uniformly random player revises their strategy, choosing each option with probability proportional to e−T⋅coste^{-T\cdot\text{cost}}e−T⋅cost, where the temperature T≥0T\ge0T≥0 measures rationality. In a potential game the dynamics is a reversible Markov chain whose stationary law is the Gibbs…

41 thms3 active usersReviewed
Graph TheoryOperations ResearchOptimization·Captain: iris

A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length: Max-Level Paths Contain a Bridge, Bases Are Unique and Blossoms Are Laminar at Every Eligible TenacityResearch Paper

A matching in a graph is a set of edges no two of which share a vertex. Maximum-cardinality matching is one of the basic problems of combinatorial optimization, and the fastest known algorithm for it in general graphs is the Micali–Vazirani (MV) algorithm (Micali–Vazirani, FOCS 1980), which runs in O(mn)O(m\sqrt n)O(mn​) time. It follows the phase structure of…

54 thms3 active usersReviewed
Convex OptimizationLinear OptimizationOptimization·Captain: iris

On Polyhedral Approximations of the Positive Semidefinite Cone: Every Polytope Between (1−ε)(D − A) and D − A Has Extension Complexity at Least exp(c√n)Research Paper

Linear programs are the workhorse of optimization, and a recurring question is which convex sets can be described, or approximated, by a linear program of small size. The relevant measure is the extension complexity xc⁡(P)\operatorname{xc}(P)xc(P) of a polytope PPP: the smallest number of facets of a polytope that projects linearly onto PPP. If xc⁡(P)=N\operatorname{xc}(P)=Nxc(P)=N,…

26 thms3 active usersReviewed
Operations ResearchOptimization·Captain: iris

A Test Score-Based Approach to Stochastic Submodular Optimization: Selecting the Top k Items by Replication Test Score Gives a (1 − 1/e)/(5 − 1/e)-Approximation Under Extended Diminishing ReturnsResearch Paper

Many selection problems ask for a team of kkk items out of nnn candidates whose individual performances are random and whose joint value is not additive: a team of contributors where only the best submission counts, a slate of content topics where a user clicks if at least one topic appeals, a portfolio of research projects where the strongest result dominates.…

21 thms3 active usersReviewed
Operations ResearchOptimization·Captain: iris

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps: The de Klerk–Sotirov SDP Has Integrality Gap at Least z for Every z ∈ ℕResearch Paper

The metric traveling salesman problem (TSP) asks for a shortest tour through nnn cities whose pairwise costs are symmetric and satisfy the triangle inequality. The best-known guarantees for it come from relaxations: Christofides' 3/23/23/2-approximation is analysed against the subtour-elimination linear program (Held–Karp), and the integrality gap of that LP is…

37 thms3 active usersReviewed
Operations ResearchOptimization·Captain: iris

Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems: Discrete Gradient Descent Finds the Best Dock Allocation at Every Dock-Move DistanceResearch Paper

Bike-sharing systems such as New York's Citi Bike place bikes in docks at fixed stations. Over a day, demand pushes bikes away from some stations and toward others, and customers who find no bike, or no empty dock to return one, leave dissatisfied. Operators rebalance bikes by truck overnight, but the number of docks at each station is a strategic decision…

32 thms3 active usersReviewed
Graph TheoryOperations Research·Captain: Shuze Chen

Labelling algorithms for paired-domination problems in block and interval graphs: Linear-time minimum paired domination in interval graphsResearch Paper

A dominating set chooses locations that collectively cover a network: every location outside the chosen set must be adjacent to a chosen location. Paired domination adds a backup requirement. The chosen locations must be partitionable into adjacent pairs, so every selected location has a designated partner. Minimizing the number of selected locations…

12 thms3 active usersReviewed
Algorithmic Game TheoryLinear Optimization·Captain: iris

Popularity, Mixed Matchings, and Self-duality: every bipartite instance with strict preferences has a max-utility popular mixed matching {(M0,1/2),(M1,1/2)}, pure if a stable matching is perfectResearch Paper

In a two-sided matching market, applicants and jobs rank their acceptable partners, and a planner wants an assignment that is both acceptable to the participants and good for some external objective, such as total value. Stability (no applicant–job pair prefers each other to their assignments) is the classical acceptability notion, but it is restrictive:…

24 thms3 active usersReviewed
Complexity Theory·Captain: Shuze Chen

Tatamibari Is NP-Complete: NP-completeness of TatamibariResearch Paper

Tatamibari asks a player to divide a grid into rectangles subject to clues about their shapes. Its rules concern individual rectangles and the corners where rectangles meet, but deciding whether an arbitrary board can be solved is a computational complexity question. Adler, Bosboom, Demaine, Demaine, Liu, and Lynch establish NP-completeness in Tatamibari Is…

23 thms3 active usersReviewed
Complexity Theory·Captain: Shuze Chen

Solving Mahjong Solitaire boards with peeking: NP-completeness for isolated three-tile stacksResearch Paper

Mahjong Solitaire asks a player to remove a layout of tiles by choosing matching pairs. The visible choices depend on which tiles have already been removed. Allowing peeking, meaning that all tile labels are known from the start, removes uncertainty about hidden information but leaves the constraints on legal removal. This distinction matters when studying…

7 thms3 active usersReviewed
Mathematical PhysicsQuantum InformationRepresentation Theory·Captain: mikedeng1

Extendibility of Werner States: Two-Sided Extendibility of Werner States Is Decided by a Minimum over Pairs of Young DiagramsResearch Paper

A bipartite quantum state ρ\rhoρ shared by Alice and Bob is (nA,nB)(n_A,n_B)(nA​,nB​)-extendible if there is a state on nAn_AnA​ copies of Alice's system and nBn_BnB​ copies of Bob's system whose reduced state on every pair (one Alice copy, one Bob copy) is ρ\rhoρ. Extendibility (also called shareability) measures how much the correlations of ρ\rhoρ can be shared among many parties. Only…

17 thms3 active usersReviewed
Linear OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Improved Guarantees for the A Priori TSP: Random Sampling with Probability 1 − (1 − p)^0.663 and a 3/2-Approximate Master Tour Has Approximation Guarantee Below 3.1 on Instances with a DepotResearch Paper

In the a priori traveling salesman problem with independent activation, a tour through all customers must be fixed before it is known which customers need a visit; each customer is active independently with a known probability, and the fixed tour is afterwards cut short to the active ones. The model, introduced by Jaillet and by Bertsimas as the…

19 thms3 active usersReviewed
Linear OptimizationOperations Research·Captain: mikedeng1

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra: Min-Max Theorem for Separable Discrete Convex Functions over Integral Points of a Box-TDI PolyhedronResearch Paper

Minimizing a separable convex function over the integral points of a polyhedron is a recurring problem in combinatorial optimization: resource allocation, minimum-cost flows with convex costs, and the "fair" or "decreasingly minimal" integral elements studied by Frank and Murota all have this form. When the polyhedron is described by a totally unimodular…

17 thms3 active usersReviewed
Operations ResearchOptimization·Captain: Shuze Chen

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties: Polynomial approximation for monotone submodular maximizationResearch Paper

Selecting a valuable subset subject to several simultaneous restrictions is a common combinatorial optimization problem. A facility may contribute less after nearby facilities have already been selected; a collection of observations may provide overlapping information. Such diminishing returns are captured by submodular objectives. Matroid constraints…

16 thms3 active usersReviewed
Quantum InformationRepresentation Theory·Captain: mikedeng1

Optimal Quantum Purity Amplification: Removing the Bottom Box of the Last Column of Each Schur-Sampled Young Diagram Gives the Optimal Choi Matrix for Purifying n Depolarized QuditsResearch Paper

Quantum devices rarely prepare the state they are asked for. A procedure meant to output a pure state ∣ψ⟩|\psi\rangle∣ψ⟩ on ddd levels often outputs a mixed state ρ\rhoρ, the result of noise during preparation. If the procedure can be run nnn times, the copies ρ⊗n\rho^{\otimes n}ρ⊗n can be processed jointly into a single output closer to ∣ψ⟩|\psi\rangle∣ψ⟩. This task is quantum…

15 thms3 active usersReviewed
AlgebraRepresentation Theory·Captain: mikedeng1

Representations of Temperley–Lieb Algebras: Closed Product Formula for the Gram Determinants of the Cell ModulesResearch Paper

The Temperley–Lieb algebra is a family of algebras built from generators that satisfy local relations. It appears in diagrammatic representation theory and provides a tractable setting in which to study cellular bases and Gram determinants. A Gram determinant tests whether the bilinear form on a module is degenerate after specializing its parameter. Thus an…

18 thms3 active usersReviewed
Linear OptimizationOperations Research·Captain: mikedeng1

Regular Matroids Have Polynomial Extension Complexity: The Independence Polytope of Every Regular Matroid on n Elements Has Extension Complexity O(n⁶)Research Paper

Many combinatorial optimization problems are linear programs over a polytope with exponentially many facets, and one way to solve them by a polynomial-size linear program is to write the polytope as the projection of a higher-dimensional polytope with few facets. The minimum number of facets needed is the extension complexity of the polytope. It is now…

20 thms3 active usersReviewed
AlgebraDiscrete Geometry·Captain: mikedeng1

A Large Family of Maximum Scattered Linear Sets of PG(1, q^n) and Their Associated MRD Codes 1: For q Odd, t ≥ 3, h ∉ 𝔽_{q^t} and h^(q^t+1) = −1, ψ_{h,t} Is Scattered over 𝔽_{q^{2t}}Research Paper

A linear set of a projective space over a finite field is the set of points spanned by the nonzero vectors of a subspace over a subfield. They have been used to construct and characterize semifields, rank-metric codes, translation spreads, translation ovoids, two-intersection sets and the blocking sets for which Lunardon introduced them (Polverino 2010;…

13 thms3 active usersReviewed
Graph Theory·Captain: mikedeng1

A Solution to the 1-2-3 Conjecture: Every Finite Graph Without a K2 Component Has an Edge-Weighting from {1,2,3} Whose Weighted Degrees Properly Color the VerticesResearch Paper

Many graph-colouring questions ask whether a proper colouring can be produced indirectly, from local data, instead of being assigned vertex by vertex. In the 1-2-3 Conjecture, the colours are produced by weighting the edges of a graph and colouring each vertex with the sum of the weights at it. Karoński, Łuczak and Thomason asked in 2004 whether weights…

14 thms3 active usersReviewed
Graph Theory·Captain: mikedeng1

Generalized Turán Problems for Even Cycles 6: The Maximum Number of (2l+1)-Cycles in a Graph with No Cycle of Length 3, …, 2l or 2k+1 Is Ω(n^{1+1/(2k+2)}) and O(n²)Research Paper

Generalized Turán problems ask for the maximum number of copies of a fixed graph HHH in an nnn-vertex graph that avoids a family F\mathcal FF of forbidden subgraphs. The ordinary Turán number counts edges (H=K2H = K_2H=K2​); Alon and Shikhelman (arXiv:1506.03397) started the systematic study of the general function ex(n,H,F)\mathrm{ex}(n, H, \mathcal F)ex(n,H,F), building on earlier…

7 thms3 active usersReviewed
PreviousPage 8 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