Theory & Algorithms · Computer Science & AI
Discrete Mathematics
The newest papers in Discrete Mathematics that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
129 papers, from 4 September 2026 to 5 November 2026: 129 arXiv preprints.
Get the few papers worth your time in Discrete Mathematics every morning.
Follow Discrete Mathematics and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 3
Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
We study how covering a graph by a small number of shortest or approximately shortest paths/walks constrains its treewidth and pathwidth.ARRIVAL in cube-root subexponential time
In the ARRIVAL problem, a token travels through a switch digraph: at every vertex, it leaves along one of two out-arcs, and the two are used alternately.Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold
We study the mixing time of the single-site Glauber dynamics for sampling proper \(q\)-colorings on sparse Erdős-Rényi random graphs \(\mathcal{G}(n, d/n)\).Degree Stability of Parallel Greedy Matching in Random Graphs
We study a natural synchronous greedy matching process in Erdős-Rényi random graphs $\mathbb{G}(n,p)$ and give a rigorous analysis of this parallel stochastic dynamics.When Weak Submodularity Meets Matroids: How Does Standard Greedy Behave?
Weakly submodular maximization finds numerous applications in machine learning, data mining and statistics.Tree Plurality Veto: Voting in Few Rounds with Efficient Communication and Low Metric Distortion
We consider the metric distortion framework for voting, where $n$ voters and $m$ candidates are embedded in an unknown metric space.Online Graph Coloring with Random Arrivals
We study online graph coloring in the random-arrival model, where the vertices are presented in a uniformly random order.Connectivity Bounds for GHZ Graphs
Greenberger-Horne-Zeilinger (GHZ) states are multipartite entangled quantum states that play a central role in quantum information theory, with applications in quantum communication, cryptography…Geometric Graph Representations via Compact SAT Encodings
We present compact SAT encodings and certifying exact solvers for boxicity and cubicity.An improved randomized algorithm for finding sinks of Acyclic Unique Sink Orientations of the binary hypercube
Acyclic Unique Sink Orientations (AUSOs) of the binary hypercube form an elegant abstraction of various optimization problems, ranging from linear programs whose feasibility region is a…Claw-Free and Line Graph Edge Deletion on Block Graphs
Edge deletion problems ask for the fewest edges whose deletion gives a graph with a specified property.The Komlós Problem in Matrix-Multiplication Time
We give a randomized algorithm that, for an $m\times n$ matrix whose columns have Euclidean norm at most one, finds a signing with discrepancy below $99$ in expected $\widetilde…A Practical Combinatorial Interior Point Method for Minimum-Cost Flow
In a recent breakthrough, Chen, Kyng, Liu, Peng, Probst Gutenberg, and Sachdeva (arXiv:2203.00671) designed the first almost-linear-time algorithm for minimum-cost flow.A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in $(0,1)$.On Collusion-Free Teaching in Planar Graphs
Non-clashing teaching minimizes teaching complexity among models satisfying the Goldman--Mathias collusion-avoidance criterion.QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators
A hereditary graph class has strongly edge-sublinear separators if, for some constant $0 \leqslant b < 1$, every graph in the class with $m$ edges admits a balanced separator of size $\mathcal…Exponential Local Search in Bounded-Occurrence MAX-CSP
We study the number of improving steps that local search may require for $(2,2,r)$-MCA (Maximum Constraint Assignment), a bounded-occurrence version of MAX-CSP with valued constraints in which every…FirstFit coloring process of random bipartite graphs and an online coloring lower bound in the random order model
FirstFit colors each arriving vertex with the smallest positive integer absent from its previously colored neighborhood.A Quantum Analogue of the Covering Lemma: Limits of Exact Anonymous Computation
Can quantum communication determine the size of an anonymous network when no size bound is known?Dynamic Conflict Clustering with Lightweight Learning and Strategic Repair for Distributed Constraint Satisfaction
Distributed Constraint Satisfaction Problems (DCSPs) model distributed decision-making in multi-agent systems, where agents assign values to local variables while satisfying shared constraints.