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 7
Maximum Matching on Regular Nonbipartite Graphs
Blocking flow-type maximum matching algorithms are based on finding maximal sets of shortest augmenting paths.NOC NOC, who's there? Clustering systems of tree-child and normal networks
Clustering systems provide a natural way to encode structural information contained in phylogenetic networks.Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs.On the Parameterized Complexity of Coloring Discovery
Coloring Discovery asks whether a possibly improper initial coloring can be made proper within a prescribed number of allowed changes.Testing the Binary Rank with Polynomial Query Complexity
We provide an adaptive two-sided error testing algorithm for the binary rank of a $0,1$ matrix $M$ with query complexity $O(d^3\log(d+1)/ε^2)$, where $d$ is the tested binary rank bound and $ε$ is…Generalized Graph Search Trees
Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory.A $(\log n)^{1/4}$ Bound for the Komlós Problem
Let $A\in\mathbb{R}^{m\times n}$ have columns of Euclidean norm at most one.The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions
Given a graph $G=(V,E)$, let $S$ ($\subseteq V$) be a set of vertices.Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates.