Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Discrete Mathematics

Authors and titles for recent submissions

  • Thu, 15 Oct 2026
  • Wed, 14 Oct 2026
  • Mon, 12 Oct 2026
  • Fri, 9 Oct 2026
  • Thu, 8 Oct 2026

See today's new changes

Total of 64 entries : 31-64 51-64
Showing up to 50 entries per page: fewer | more | all

Wed, 14 Oct 2026 (continued, showing last 8 of 30 entries )

[31] arXiv:2610.15222 (cross-list from cs.DS) [pdf, html, other]
Title: A Fast Greedy Algorithm with a 0.45 Approximation Guarantee for the Airplane Refueling Problem
Oleg Lomachenko, Arnold Enikeev
Comments: 14 pages, 1 figure (4 panels), 1 algorithm
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
[32] arXiv:2610.15145 (cross-list from math.CO) [pdf, html, other]
Title: Nim heaps in the Game of Cycles: the parity conjecture fails on trees
Muchen Xu
Comments: 35 pages, 3 figures, 7 tables. Ancillary files contain all programs and data
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[33] arXiv:2610.14979 (cross-list from math.CO) [pdf, html, other]
Title: Sharp bounds and extremal structure of minimally strongly $k$-connected digraphs
Junran Yu, Gregory Gutin, Hong-Jian Lai, Xiaoyan Zhang
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[34] arXiv:2610.14962 (cross-list from math.OC) [pdf, html, other]
Title: Non-convex integer programming: a deterministic solution method of the large block sale problem
David Nizard, Dominique Quadri
Subjects: Optimization and Control (math.OC); Discrete Mathematics (cs.DM)
[35] arXiv:2610.14892 (cross-list from math.CO) [pdf, html, other]
Title: Coefficientwise Extremality and Rigidity for Independent Sets in Bipartite Graph Covers
Yusuke Watanabe
Comments: 39 pages. Main Theorems A-C formalized in Lean 4; code: this https URL
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[36] arXiv:2610.14217 (cross-list from math.CO) [pdf, html, other]
Title: The Path Partition Conjecture and 3-(quasi-)Transitive Digraphs
Shamik Ghosh, Jing Huang
Comments: 27 pages, 2 figures
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[37] arXiv:2610.14099 (cross-list from math.CO) [pdf, html, other]
Title: Maximally symmetric $(23_4)$ configurations and the end of the existence problem for geometric $(n_4)$ configurations
Wenhao Lu
Comments: 25 pages, 3 figures. Code, polynomial certificates and Lean 4 files: this https URL
Subjects: Combinatorics (math.CO); Computational Geometry (cs.CG); Discrete Mathematics (cs.DM)
[38] arXiv:2610.14085 (cross-list from math.PR) [pdf, html, other]
Title: Satisfiability and freezing in random integer programs
Dylan J. Altschuler, Ruben Ascoli, Will Perkins
Comments: Minimal AI usage. Comments welcome. 49 pages
Subjects: Probability (math.PR); Discrete Mathematics (cs.DM); Combinatorics (math.CO)

Mon, 12 Oct 2026 (showing 5 of 5 entries )

[39] arXiv:2610.13244 [pdf, html, other]
Title: Equitable Subpartitionability Does Not Characterize Box-TDI Polyhedra
Emiliano Lancini, Francesco Pisanu
Comments: 6 pages
Subjects: Discrete Mathematics (cs.DM)
[40] arXiv:2610.13096 [pdf, html, other]
Title: Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
Quanlong Niu, Riheng Jia
Subjects: Discrete Mathematics (cs.DM)
[41] arXiv:2610.12613 [pdf, html, other]
Title: Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
Comments: 11 pages
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[42] arXiv:2610.13270 (cross-list from cs.DS) [pdf, html, other]
Title: Polynomial directed treewidth forces a large bramble with congestion two
Victor A. Campos, Raul Lopes, Rodrigo Nogueira, Ignasi Sau
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[43] arXiv:2610.12720 (cross-list from math.CO) [pdf, html, other]
Title: The Stable Marriage Polytope is Box-Totally Dual Integral
Michele Barbato, Emiliano Lancini
Comments: 6 pages
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)

Fri, 9 Oct 2026 (showing 11 of 11 entries )

[44] arXiv:2610.10632 [pdf, html, other]
Title: Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
Journal-ref: Counting Polyominoes, Revisited. Algorithmica (2026) 88:51
Subjects: Discrete Mathematics (cs.DM)
[45] arXiv:2610.10599 [pdf, html, other]
Title: An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev
Comments: 16 pages, 1 figure. Includes a complete Lean 4 formalization and a reproducible rational certificate
Subjects: Discrete Mathematics (cs.DM); Probability (math.PR)
[46] arXiv:2610.12357 (cross-list from quant-ph) [pdf, html, other]
Title: Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
Yihang Sun, Mary Wootters
Comments: 70 pages, 3 figures
Subjects: Quantum Physics (quant-ph); Cryptography and Security (cs.CR); Discrete Mathematics (cs.DM); Information Theory (cs.IT)
[47] arXiv:2610.12122 (cross-list from math.CO) [pdf, html, other]
Title: Lower bounds for Ramsey numbers: $\mathrm{R}(6,8)\ge 135$ and $\mathrm{R}(8,10)\ge 345$
Fritz Cremer
Comments: 8 pages, 2 figures
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[48] arXiv:2610.11473 (cross-list from cs.DS) [pdf, html, other]
Title: An ETH-based quasipolynomial lower bound for Dualization
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
[49] arXiv:2610.10911 (cross-list from math.OC) [pdf, html, other]
Title: Integer programming on polytopes of Chvátal rank one is as hard as lattice problems
Alberto Del Pia
Subjects: Optimization and Control (math.OC); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)
[50] arXiv:2610.10831 (cross-list from math.CO) [pdf, html, other]
Title: Tweaking the constant in the Linear Hadwiger Theorem
David R. Wood
Comments: This paper was first submitted to the arXiv before the announcement of the disproof of Hadwiger's Conjecture
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[51] arXiv:2610.10800 (cross-list from math.CO) [pdf, html, other]
Title: Decomposition Profiles and Weisfeiler-Leman Dimension for Graphs of Bounded Rank Width
Antonios Kalampakas
Comments: 44 pages. Includes ancillary verification code
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM); Logic in Computer Science (cs.LO)
[52] arXiv:2610.10737 (cross-list from math.CO) [pdf, html, other]
Title: Obstructions to $k$-colouring $H$-free graphs
Iain Beaton, Ben Cameron, Adam van Omme
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[53] arXiv:2610.10596 (cross-list from cs.DS) [pdf, html, other]
Title: Dijkstra Is NOT Greedy: A Global-to-Local Proof of Correctness
Shengbao Wang
Comments: 9 pages, 1 figure
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Optimization and Control (math.OC)
[54] arXiv:2610.05617 (cross-list from cs.DS) [pdf, html, other]
Title: Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census
Yoshiteru Ishida
Comments: 29 pages, 1 figure. Ancillary files: an independent verification script that reproduces every exhaustive and exact count in the paper, and a cross-check of the two implementations
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Computer Science and Game Theory (cs.GT); Combinatorics (math.CO)

Thu, 8 Oct 2026 (showing 10 of 10 entries )

[55] arXiv:2610.09968 [pdf, html, other]
Title: Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S, Renjith P
Comments: Submitted to CALDAM 2027
Subjects: Discrete Mathematics (cs.DM)
[56] arXiv:2610.09175 [pdf, html, other]
Title: An Efficient Algorithm for the Quickest Path Reliability Problem
Majid Forghani-elahabad
Subjects: Discrete Mathematics (cs.DM)
[57] arXiv:2610.08893 [pdf, html, other]
Title: A symmetric conference matrix of order 86
Harshit Verma
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[58] arXiv:2610.10474 (cross-list from cs.DS) [pdf, html, other]
Title: Fast Almost-Uniform Sampling of Random $k$-SAT Solutions
Kun He, Zhidan Li, Kuan Yang
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Probability (math.PR)
[59] arXiv:2610.10108 (cross-list from cs.IT) [pdf, html, other]
Title: The Multiple Unicast Conjecture is False
Mark Braverman, Zhongtian He
Subjects: Information Theory (cs.IT); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[60] arXiv:2610.10095 (cross-list from math.CO) [pdf, html, other]
Title: Making Every Number from 1 to N Under a Fixed Cycle of $+$, $\times$, $-$, $÷$
Sean Lesmana, Theodore Tjugiarto
Comments: 25 pages, 2 figures, 9 tables. Verification code: this https URL
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM); Number Theory (math.NT)
[61] arXiv:2610.09618 (cross-list from cs.DS) [pdf, html, other]
Title: Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors
Saeed Amiri, Sebastian Siebertz
Subjects: Data Structures and Algorithms (cs.DS); Distributed, Parallel, and Cluster Computing (cs.DC); Discrete Mathematics (cs.DM)
[62] arXiv:2610.09506 (cross-list from math.PR) [pdf, html, other]
Title: Mixing Times of Switch Chains via High-Dimensional Expansion
Sawyer Jack Robertson
Comments: 52 pages, 3 figures
Subjects: Probability (math.PR); Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[63] arXiv:2610.09084 (cross-list from cs.CC) [pdf, html, other]
Title: On the complexity of the single-move labeled token routing problem
Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura
Comments: 53 pages, 8 figures
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Robotics (cs.RO); Combinatorics (math.CO)
[64] arXiv:2610.09042 (cross-list from math.CO) [pdf, html, other]
Title: Distinguishing graphs with simple spectrum by homomorphism counts
Takanori Maehara
Comments: 29 pages, 8 figures
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
Total of 64 entries : 31-64 51-64
Showing up to 50 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences