Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Graph Theory

699 missions · 311 completed

Missions

Open388Completed311All699
CombinatoricsTheoretical Computer Science·Captain: iris

Canonical Graph Decompositions via Local SeparationsResearch Paper

Tree-decompositions describe the global, tree-like connectivity of a graph: the Robertson–Seymour tree-of-tangles theorem gives, for every graph, a canonical tree-decomposition that efficiently distinguishes all its tangles. Many graphs, though, are tree-like only locally: road networks, Cayley graphs of finite groups, locally chordal graphs. Their…

23 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

Dynamic Edge Orientation on Low-Arboricity Graphs: Breaking the log n BarrierResearch Paper

Many dynamic graph algorithms (maximal and approximate matching, colouring, densest subgraph, spanners, adjacency queries) run on graphs that stay sparse while edges are inserted and deleted. Their common subroutine is dynamic edge orientation: keep every edge directed so that each vertex has few out-edges, and redirect ("flip") as few edges as possible…

17 thms2 active usersReviewed
Markov ChainProbabilityTheoretical Computer Science·Captain: iris

Local-to-Global Theorems Based on Cones with Applications to Graph ColoringResearch Paper

A proper list coloring of a graph assigns to every vertex a color from its own list so that adjacent vertices get different colors. Sampling a uniformly random proper coloring is a benchmark problem for Markov chain Monte Carlo, for approximate counting, and for the statistical physics of the antiferromagnetic Potts model. The standard sampler is the Glauber…

30 thms2 active usersReviewed
Combinatorics·Captain: utkuokur

Ten Challenges 03: Caccetta–Häggkvist conjectureOpen Problem

In a finite directed graph in which every vertex has an out-neighbour, following arcs must eventually return to a visited vertex, so a directed cycle exists; but it may be long. The Caccetta–Häggkvist conjecture quantifies how large minimum out-degree forces short directed cycles: out-degree at least rrr on nnn vertices should force a directed cycle of length…

9 thms2 active usersReviewed
Combinatorics·Captain: utkuokur

Ten Challenges 05: Erdős–Hajnal conjecture for pathsOpen Problem

Ramsey's theorem guarantees that every graph on nnn vertices has a clique or an independent set of size about 12log⁡2n\tfrac12\log_2 n21​log2​n, and random graphs show that this is best possible. The Erdős–Hajnal conjecture says that forbidding any single induced subgraph HHH changes the picture completely: HHH-free graphs should contain cliques or independent sets of polynomial…

6 thms2 active usersReviewed
Combinatorics·Captain: utkuokur

Ten Challenges 08: Ryser's hypergraph conjectureOpen Problem

For bipartite graphs, Kőnig's theorem says that the minimum number of vertices needed to meet every edge equals the maximum number of pairwise disjoint edges: τ=ν\tau=\nuτ=ν. For hypergraphs whose edges have rrr vertices, the ratio τ/ν\tau/\nuτ/ν can be as large as rrr in general, and the bound τ≤rν\tau\le r\nuτ≤rν is trivial. Ryser's conjecture asserts that for rrr-partite rrr-uniform…

6 thms2 active usersReviewed
Operations ResearchProbability·Captain: iris

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs: a 0.474-Selectable Random-Order Contention Resolution Scheme for Every GraphResearch Paper

Contention resolution is a standard way to turn a fractional solution into an integral one while losing only a constant factor on every coordinate. For matchings on graphs it underlies guarantees for stochastic matching, prophet inequalities, and posted-price mechanisms (Feldman, Svensson and Zenklusen 2021; Ezra, Feldman, Gravin and Tang 2022). A scheme…

24 thms2 active usersReviewed
CombinatoricsOperations Research·Captain: iris

Fair Integral Network Flows: The Integral Feasible Flows That Are Decreasingly Minimal on F Are Exactly the Integral Flows of a Box Narrow on FResearch Paper

Many allocation problems ask for a feasible vector whose components are spread as evenly as possible: loads on links, shipments on routes, work assigned to servers. One way to make "evenly" precise is decreasing minimality: the largest component is as small as possible, within this the second largest, and so on. For maximum flows this question goes back to…

23 thms2 active usersReviewed
Bandit AlgorithmsMachine LearningProbability·Captain: iris

Small-Loss Bounds for Online Learning with Partial Information: Double-Threshold Freezing has ϵ\epsilonϵ-approximate regret ≤300α(A(d,T)+3log⁡d+2δ)/ϵ2\le 300\alpha(A(d,T)+3\log\frac{d+2}{\delta})/\epsilon^2≤300α(A(d,T)+3logδd+2​)/ϵ2 w.p. 1−δ1-\delta1−δResearch Paper

In adversarial online learning a learner chooses one of ddd actions (arms) in each of TTT rounds and suffers a loss in [0,1][0,1][0,1]. Classical regret bounds grow with the horizon, O(Tlog⁡d)O(\sqrt{T\log d})O(Tlogd​). A small-loss bound replaces TTT by the loss L⋆L^\starL⋆ of the best arm, which matters whenever good actions exist: routing traffic, choosing treatments, recommending items.…

12 thms2 active usersReviewed
CombinatoricsOperations Research·Captain: iris

Submodular Functions and Perfect Graphs: Bounded-Degree (C4, Prism)-Free Perfect Graphs Have Even Set Separators Constructible in Cubic TimeResearch Paper

Maximum weight independent set (MWIS) asks for a set of pairwise non-adjacent vertices of largest total weight. On perfect graphs, graphs in which every induced subgraph HHH has chromatic number equal to its clique number, MWIS is solvable in polynomial time by the ellipsoid method of Grötschel, Lovász and Schrijver (Combinatorica 1981). No combinatorial polyn…

24 thms2 active usersReviewed
Algorithmic Game TheoryMarkov ChainOperations Research·Captain: iris

On a Network Centrality Maximization Game: Best Responses Do Not Depend on the Intrinsic Centrality and Link Only Within Incoming Distance did_idi​Research Paper

PageRank centrality (Brin–Page 1998) scores the nodes of a directed graph by the long-run frequency with which a random surfer visits them. In citation networks, the Web and social networks, each node controls where its own out-links point and has an interest in being visible. Earlier work asked how adding a link changes PageRank (Avrachenkov–Litvak 2006)…

25 thms2 active usersReviewed
CombinatoricsLinear OptimizationOperations Research·Captain: iris

Steiner Cut Dominants: For Each τ\tauτ, All Non-Trivial Facets with at Most τ\tauτ Terminals Arise by Subdivision and Gluing from Finitely Many Irreducible Steiner GraphsResearch Paper

The minimum cut of a graph and the minimum sss-ttt cut are among the oldest problems of combinatorial optimization, and both are polynomial. Between them lies the minimum TTT-Steiner cut: given a graph GGG, nonnegative edge weights and a set TTT of terminals, find a cheapest cut that separates at least two terminals. The polyhedral picture is much less even than the…

48 thms2 active usersReviewed
CombinatoricsProbability·Captain: iris

Uniqueness and Universality of the Brownian Map: uniform random q-angulations with n faces (q = 3 or q even), graph distances scaled by c_q n^(-1/4), converge in distribution to the Brownian mapResearch Paper

A planar map is a finite connected graph embedded in the sphere, viewed up to orientation-preserving homeomorphisms; loops and multiple edges are allowed. Planar maps were enumerated by Tutte in the 1960s, appear in algebraic geometry and in the theory of matrix integrals, and serve in theoretical physics as discrete models of two-dimensional random…

44 thms2 active usersReviewed
CombinatoricsLinear OptimizationOperations Research·Captain: iris

Packing Feedback Arc Sets in Tournaments Exactly: A Tournament Is FAS Ideal iff FAS Mengerian iff Möbius-FreeResearch Paper

The feedback arc set (FAS) problem asks, for a digraph G=(V,A)G=(V,A)G=(V,A) with nonnegative integral arc weights www, for a set of arcs of minimum total weight whose deletion destroys every directed cycle. It is NPNPNP-hard, and it remains NPNPNP-hard on tournaments (Alon 2006; Charbit, Thomassé and Yeo 2007), where it models ranking from pairwise comparisons. A standard way to…

45 thms2 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: iris

Coordination Games on Weighted Directed Graphs: on an open chain of m cycles of v nodes, improvement paths of length at most 3vm³ reach a Nash equilibrium from every joint strategyResearch Paper

In a coordination game on a graph, every player is a node and chooses a colour, and a node is rewarded for agreeing with its neighbours. These games model the adoption of a common standard, clustering, and the stabilisation of distributed protocols. When the graph is directed, the dynamics change sharply. A node is paid only by its in-neighbours and pays…

11 thms2 active usersReviewed
EconomicsOperations ResearchProbability·Captain: iris

Exit Spirals in Coupled Networked Markets: Two Independent Random Networks with Simple Complementarities Lose All Activity Discontinuously at a Critical ShockResearch Paper

Financial intermediaries often need access to two markets at once. A dealer that funds bond inventory in the repo market cannot operate without access to the collateral market, and the reverse also holds. Aymanns, Georg and Golub (SSRN 2881814; Operations Research, doi:10.1287/opre.2023.2439) model this coupling as a participation game on a multilayer…

19 thms2 active usersReviewed
CombinatoricsOptimization·Captain: iris

Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph: Isolated Nodes Keeping ϑ-Rank 1 for Odd Cycles and ComplementsResearch Paper

The stability number α(G)\alpha(G)α(G) of a graph, the largest size of a set of pairwise non-adjacent nodes, is NP-hard to compute. Motzkin and Straus showed that it is the value of a copositive program, α(G)=min⁡{t:t(AG+I)−J copositive}\alpha(G)=\min\{t: t(A_G+I)-J \text{ copositive}\}α(G)=min{t:t(AG​+I)−J copositive}. That turns approximating α(G)\alpha(G)α(G) into approximating the cone of copositive matrices. Parrilo (2000 thesis)…

31 thms2 active usersReviewed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Pure Nash Equilibria and Best-Response Dynamics in Random Games: Best-Response Dynamics Reaches a Pure Nash Equilibrium for All Large N When the Tie Probability Is SmallResearch Paper

A pure Nash equilibrium (PNE) of a game is a strategy profile from which no player gains by a unilateral deviation. Unlike mixed equilibria, pure equilibria need not exist, and even when they do they can be hard to find: computing an equilibrium is PPAD-complete in general (Daskalakis, Goldberg & Papadimitriou 2009). The simplest learning procedure that…

15 thms2 active usersReviewed
Quantum Error CorrectionQuantum Information·Captain: mikedeng1

Decoding Quantum Tanner Codes: The Parallel Decoder Corrects Every Error of Weight Linear in the Code Length in Logarithmically Many RoundsResearch Paper

Quantum computers must correct errors faster than they accumulate, and quantum low-density parity-check (LDPC) codes are the leading candidates for doing so with little overhead: every check involves a bounded number of qubits, so syndromes can be measured by local circuits. In 2021–2022 the first asymptotically good quantum LDPC codes appeared, with…

18 thms2 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

A Dynamic Contagion Risk Model with Recovery Features: Fluid Limit for the Final Fraction of Failed Nodes in Threshold Contagion with Growth on the Configuration ModelResearch Paper

Financial networks, supply chains and contact networks share a failure mode: a node fails when enough of its counterparties have failed, and its failure in turn weakens its own counterparties. Threshold contagion on random graphs is the standard mathematical model of this. Amini, Cont and Minca (Resilience to contagion in financial networks, Mathematical…

10 thms2 active usersReviewed
Quantum Error CorrectionQuantum Information·Captain: mikedeng1

Quantum Tanner Codes 1: On a Ramanujan Left-Right Cayley Complex with Robust Dual Tensor Codes, the Quantum Tanner Code Has Rate at Least (1−2ρ)² and Distance at Least δn/(4Δ^{3/2+ε})Research Paper

An error-correcting code protects information by adding redundancy. A quantum code must also account for two kinds of errors, commonly called XXX and ZZZ errors. Quantum low-density parity-check codes use checks that each touch only a bounded number of qubits, while each qubit participates in only a bounded number of checks. Such locality matters when the…

9 thms2 active usersReviewed
CombinatoricsProbabilityStatistics·Captain: mikedeng1

Partial Recovery in the Graph Alignment Problem II: Under Explicit Sparsity Conditions with nqs Above a Constant, Some Algorithm Recovers a Fraction α of the AlignmentResearch Paper

Graph alignment asks for the correspondence between the vertex sets of two graphs that are noisy copies of each other. It underlies the de-anonymisation of social networks, where an anonymised graph is matched to a public one (Narayanan, Shmatikov 2009), the comparison of protein–protein interaction networks across species, and matching problems in computer…

12 thms2 active usersReviewed
Control TheoryDynamical SystemsLinear algebra·Captain: mikedeng1

Sub/Super-Stochastic Matrix with Applications to Bipartite Tracking Control over Signed Networks 3: ψ < 1/(τd_M), Structural Balance and Leader Reachability Give Asynchronous Bipartite TrackingResearch Paper

Networks of agents that interact both cooperatively and competitively are modelled by signed graphs: a positive edge weight means that one agent moves towards another, a negative weight means that it moves towards the other's opposite. Since Altafini's work on consensus over antagonistic networks (IEEE TAC 2013), the standard target on such networks has…

9 thms2 active usersReviewed
Combinatorics·Captain: mikedeng1

Stability Results on the Circumference of a Graph 2: A 2-Connected G with δ ≥ k, Circumference 10 ≤ c < n and e(G) > max{f(n,k+1,c), f(n,⌊c/2⌋−1,c)} Lies in W_{n,k,c}, W_{n,⌊c/2⌋,c}, X∪Y or Z_{n,k,c}Research Paper

How many edges can a graph have if it contains no long cycle? This Turán-type question for the circumference goes back to Erdős and Gallai (1959), who showed that an nnn-vertex graph with circumference ccc has at most c(n−1)/2c(n-1)/2c(n−1)/2 edges. For 2-connected graphs the answer is exact and the extremal graphs are known, so the natural next question is stability: what…

19 thms2 active usersReviewed
Algorithmic Game TheoryProbabilityStochastic Systems·Captain: mikedeng1

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes I: An Explicit Markovian Nash Equilibrium on Every Finite Transitive GraphResearch Paper

Mean field games describe Nash equilibria of large populations in which every player interacts with every other player symmetrically, through the empirical distribution of all states. Many systems of interest are not of this kind: agents in a network interact only with their neighbours, and the interaction structure is a graph rather than a complete graph.…

21 thms2 active usersReviewed
PreviousPage 11 of 16Next

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