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
🏆Completed
EconomicsOperations ResearchProbability·Captain: mikedeng1

The Value of Price Discrimination in Large Random Networks: The Expected Fractional Regret of Uniform Pricing Vanishes in Erdős–Rényi Networks of Any DensityResearch Paper

A seller whose customers influence one another faces a choice between two pricing policies. It can collect information about the social network and charge each customer a personalised price that reflects their position in it, or it can ignore the network and charge everyone one uniform price. Personalised pricing is never worse for the seller, but…

15 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

Sands–Sauer–Woodrow: monochromatic paths in two-coloured tournamentsResearch Paper

A tournament is a directed graph in which every two distinct vertices are joined by exactly one arc — the model of a round-robin competition, and the setting of Ramsey theory's oldest questions.

6 thms3 active usersReviewed
Linear OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Linear Programming and Community Detection 6: The LP Relaxation Fails w.h.p. in the Very Dense and Dense SBM Above Explicit ThresholdsResearch Paper

Community detection asks for a hidden partition of the nodes of a graph from its edges. Its simplest probabilistic benchmark is the two-community stochastic block model (SBM), in which the minimum bisection problem is the maximum a posteriori estimator. That problem is NP-hard, so convex relaxations are used in its place, and the question is when a…

15 thms3 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research+2·Captain: mikedeng1

Linear Programming and Community Detection 5: The LP Relaxation Recovers the Planted Bisection w.h.p. in the Very Dense SBM When p − q > 1/2Research Paper

The stochastic block model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is the standard random model for networks with community structure, and the basic benchmark for community-detection algorithms (Abbe 2018). In its two-community form the nodes are split into two equal halves, edges inside a half appear with probability ppp, and edges across…

12 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Load Balancing Under Strict Compatibility Constraints 3: Inhomogeneous Random Graphs with Edge Probabilities Satisfying (3.5) Are Almost Surely Proportionally Sparse and SubcriticalResearch Paper

Large-scale computing systems route incoming tasks to servers through dispatchers, one per task type. A task can only run on a server that holds the data or software it needs, so the set of admissible pairs forms a bipartite compatibility graph between task types and servers. Full flexibility (every server can serve every type) gives the best load balancing…

28 thms3 active users
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Linear Programming and Community Detection 3: The Metric LP Relaxation Recovers the Planted Bisection When d_in − d_out ≥ n/4 Under Regular SandwichingResearch Paper

The minimum bisection problem asks, for a graph G=(V,E)G=(V,E)G=(V,E) on an even number nnn of vertices, for a split of VVV into two halves of size n/2n/2n/2 that cuts as few edges as possible. It is NP-hard, and it is also the maximum a posteriori estimator for the two-community stochastic block model, the standard random model of networks with community structure. A tractable…

7 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear OptimizationMechanism Design+2·Captain: mikedeng1

Designing Approximately Optimal Search on Matching Platforms 1: Some Stationary Equilibrium of Directed Search Attains a Quarter of the First-Best WelfareResearch Paper

Two-sided platforms for dating, freelancing and housing do more than list participants: they decide whom each participant is shown. When search is costly and agents leave the market over time, the platform's choice of assortments (which types of agents meet which, and how often) determines who matches, and agents respond strategically by deciding which…

14 thms3 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research·Captain: mikedeng1

Dynamic Matching: Characterizing and Achieving Constant Regret II: In (SPP)-Acyclic Networks the Static Planning Solution Is Given by Surplus Vectors in {−1, 0, 1}ⁿResearch Paper

Centralized markets such as kidney exchanges, ride-sharing platforms and online labor markets match agents who arrive over time. Kerimov, Ashlagi and Gurvich (SSRN 3824407; Management Science, 2023, doi:10.1287/mnsc.2021.01215) study such a market with nnn agent types and ddd feasible multi-way matches. Their main result is that, when a fluid linear program…

10 thms3 active usersReviewed
OptimizationQuantum Information·Captain: mikedeng1

A Quantum Approximate Optimization Algorithm II: On v-Regular Graphs the Variance of the Cut Value in the QAOA State Is at Most 2((v−1)^(2p+2)−1)/(v−2) Times the Number of EdgesResearch Paper

The Quantum Approximate Optimization Algorithm (QAOA) of Farhi, Goldstone and Gutmann (arXiv:1411.4028, 2014) is a family of shallow quantum circuits for combinatorial optimization, indexed by a depth ppp and 2p2p2p real angles. It has become one of the standard candidate algorithms for near-term quantum hardware, and its MaxCut instance is the usual benchmark on…

14 thms3 active usersReviewed
OptimizationQuantum Information·Captain: mikedeng1

A Quantum Approximate Optimization Algorithm I: At p = 1 the QAOA Expected Cut Is at Least 0.6924 Times the Maximum Cut on Every Connected 3-Regular GraphResearch Paper

The quantum approximate optimization algorithm (QAOA) of Farhi, Goldstone and Gutmann (arXiv:1411.4028, 2014) is a family of shallow quantum circuits, indexed by an integer depth p≥1p \ge 1p≥1, that prepare states whose computational-basis measurements are biased toward good solutions of a combinatorial optimization problem. It became the standard candidate for…

14 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Lightning Network Economics: Topology II: A Lightning Network with Average Degree Above 2g₊⁻¹(2·disc) Contains a Hermetizable SetResearch Paper

The Lightning Network (LN) is a layer-two payment system for Bitcoin. Two parties open a payment channel by locking funds on the blockchain and can then pay each other off-chain; payments between parties without a common channel are routed along paths of channels. Locking funds is costly, and the amount a channel needs grows with the net flow it has to…

16 thms3 active users
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Flow Allocation Games 1: Every Unit-Ranking Game Has a Strong Equilibrium That Maximizes the Total FlowResearch Paper

Financial firms owe each other money. When some firms cannot meet their obligations, the payments that actually clear in the network are a fixed point: what a firm can pay depends on what it receives, which depends on what others can pay. Eisenberg and Noe (Management Science, 2001) introduced this clearing model under a fixed pro-rata payment rule. Later…

18 thms3 active users
🏆Completed
CombinatoricsDiscrete Geometry·Captain: mikedeng1

Triangle-Free Intersection Graphs of Line Segments with Large Chromatic Number: For Every k ≥ 1 There Is a Triangle-Free Family of Plane Line Segments with Chromatic Number Greater than kResearch Paper

A proper coloring of a graph assigns colors to its vertices so that adjacent vertices get different colors; the least number of colors that suffices is the chromatic number χ(G)\chi(G)χ(G). The clique number ω(G)\omega(G)ω(G) is the size of a largest set of pairwise adjacent vertices, and χ(G)≥ω(G)\chi(G)\ge\omega(G)χ(G)≥ω(G) always. A class of graphs is χ\chiχ-bounded if χ\chiχ is bounded by a…

8 thms3 active usersReviewed
Combinatorics·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
🏆Completed
Combinatorics·Captain: mikedeng1

Cycle Lengths in Expanding Graphs 2: Every α-Expander on n Vertices Has Ω(α³/log(1/α))·n Distinct Cycle LengthsResearch Paper

An expander graph has many edges leaving each small vertex set. This condition is useful when a graph must remain connected after local losses, and it also constrains the cycles that can occur. Knowing that one long cycle exists leaves open how many different lengths its cycles can have. For example, a bipartite graph has no odd cycle, so expansion alone…

9 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

Finding Cliques in Social Networks: A New Distribution-Free Model 3: For Every c ≥ 2 and n ≥ c There Is a c-Closed Graph on n Vertices with Ω(c^(−3/2)·2^(c/2)·n^(3/2)) Maximal CliquesResearch Paper

Social networks exhibit triadic closure: two people with many common friends tend to be friends themselves. Fox, Roughgarden, Seshadhri, Wei and Wein (arXiv:1804.07431, SIAM J. Comput. 2020) turn this empirical regularity into a deterministic graph class, the ccc-closed graphs, and ask how hard a classical NP-hard problem, enumerating maximal cliques, becomes…

7 thms3 active usersReviewed
Combinatorics·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
Combinatorics·Captain: mikedeng1

Exact Solution of the Hypergraph Turán Problem for k-Uniform Linear Paths: For k ≥ 4 and Large n, the Turán Numbers of P_{2t+1} and P_{2t+2} and Their Unique Extremal FamiliesResearch Paper

Hypergraph Turán problems ask how many edges a kkk-uniform hypergraph on nnn vertices can have without containing a fixed sub-hypergraph. For graphs (k=2k=2k=2) the theory is well developed; for k≥3k\ge 3k≥3 exact answers are rare and are known mostly for small, dense configurations such as the Fano plane or expanded triangles. Paths are the natural sparse test case. For…

19 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Minimum Cost Flows in Graphs with Unit Capacities: When the Second Phase of a Cost Scale Starts, at Most 3λ Excess Is Left for λ = √m and 36λ for λ = n^(2/3)Research Paper

Minimum-cost flow is a standard model for routing a quantity through a network while paying a cost on each arc. Unit capacities arise when each input arc can carry at most one unit; they include flow formulations of several matching and assignment problems. Goldberg, Kaplan, Hed and Tarjan analyze a cost-scaling algorithm for this setting. Their…

9 thms3 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Twin-width I: Tractable FO Model Checking 4: Every K_t-Minor-Free Graph Has Twin-width at Most 4c_g(t)·2^(4c_g(t)+2), a Triple-Exponential Bound in tResearch Paper

Many graph classes are defined by excluding a fixed graph as a minor. A minor can be formed by deleting vertices, deleting edges, and contracting edges. Planar graphs, for example, exclude K5K_5K5​ as a minor. Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant proved that every class excluding a fixed clique minor has bounded twin-width, a graph…

17 thms3 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Graphon Mean Field Systems IV: Law of Large Numbers for Particle Systems on Percolated Not-So-Dense Graphs With nβₙ → ∞Research Paper

Large networks are often modeled through a graphon, a measurable function that records how likely two labeled vertices are to interact. For interacting diffusions, this lets one ask whether a finite random network has a predictable population limit. Bayraktar, Chakraborty and Wu study that question for graphon weighted systems, including graphs obtained by…

14 thms3 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Twin-width I: Tractable FO Model Checking 3: Grid Minor Theorem for Twin-width — t-Twin-Ordered Matrices Are (2t+2)-Mixed Free, and t-Mixed Free Matrices Have Twin-width at Most 4c_t·α^(4c_t+2)Research Paper

Twin-width is a graph and matrix invariant introduced by Bonnet, Kim, Thomassé and Watrigant (J. ACM 69(1), Article 3, 2021). Classes of bounded twin-width include bounded tree-width and clique-width graphs, proper minor-closed classes, posets of bounded width, and permutations avoiding a fixed pattern; on all of them, first-order model checking is…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

A c^k n 5-Approximation Algorithm for Treewidth 1: If tw(G) ≤ k, Pushed Terminal Separations Around a 3/4-Balanced Separation Glue to a Separation of Order k+1 with Sides ≤ 7/8|V|+(|B|+k+1)/2Research Paper

Treewidth measures how closely a graph resembles a tree. Many problems that are NP-hard on general graphs can be solved in time linear in the number of vertices once a tree decomposition of bounded width is available, so computing such decompositions quickly is a basic task in algorithmic graph theory. Bodlaender, Drange, Dregi, Fomin, Lokshtanov and…

12 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices 1: Every Connected P₇-Free Graph Has a Connected 2-Dominating Set of at Most Three Vertices or a K₄Research Paper

Graph coloring asks whether vertices can be assigned colors so that adjacent vertices receive different colors. Restricting the graphs by forbidden induced paths can expose structure that is absent from general graphs. Bonomo, Chudnovsky, Maceli, Schaudt, Stein and Zhong study list three-coloring when the graph has no induced path on seven vertices,…

6 thms3 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Graphon Mean Field Systems II: The Empirical Measure of the Dense Graphon-Weighted Particle System Converges in Probability to the Averaged Graphon LawResearch Paper

Classical mean field theory describes nnn exchangeable diffusions, each interacting with the empirical average of all the others. As n→∞n\to\inftyn→∞ the particles become independent copies of a McKean–Vlasov process (propagation of chaos). Many systems of interest are not exchangeable. Particles sit at the vertices of a network and interact only with their…

16 thms3 active usersReviewed
PreviousPage 10 of 28Next

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