Skip to main content

Discrete Mathematics

Authors and titles for recent submissions

See today's new changes

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

Fri, 9 Oct 2026 (continued, showing last 4 of 11 entries )

[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 : 1-50 51-64
Showing up to 50 entries per page: fewer | more | all