Math-Co
Obstacles, Slopes, and Tic-Tac-Toe: An excursion in discrete geometry and combinatorial game theory
Optimal accessing and non-accessing structures for graph protocols
A Note on Total and Paired Domination of Cartesian Product Graphs
Asymptotic enumeration of Minimal Automata
Some nice Hankel determinants
Infinite-dimensional uniform polyhedra
A note on hitting maximum and maximal cliques with a stable set
A New Framework for Network Disruption
Colouring the Triangles Determined by a Point Set
A Counterexample to rapid mixing of the Ge-Stefankovic Process
Grahams Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions
Multidimensional extension of the Morse--Hedlund theorem
On automatic infinite permutations
Note on the complexity of deciding the rainbow connectedness for bipartite graphs
Bisections of graphs
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
Tolerant identification with Euclidean balls
The number of Huffman codes, compact trees, and sums of unit fractions
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyns Technique
The bottleneck 2-connected $k$-Steiner network problem for $kleq 2$
Understanding 3-manifolds in the context of permutations
Weak Dominance Drawings and Linear Extension Diameter
