Math-Co
An additive combinatorics approach to the log-rank conjecture in communication complexity
Nonrepetitive sequences on arithmetic progressions
Combinatorial Batch Codes: A Lower Bound and Optimal Constructions
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs
A Simple Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem
Injective Envelopes and Projective Covers of Quivers
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
Tight bounds on the threshold for permuted k-colorability
Eigenvector Synchronization, Graph Rigidity and the Molecule Problem
Generalised k-Steiner Tree Problems in Normed Planes
Generalization of a few results in Integer Partitions
Optimal antithickenings of claw-free trigraphs
Complexity of Ising Polynomials
Integer realizations of disk and segment graphs
Towards on-line Ohbas conjecture
Diameter of Cayley graphs of permutation groups generated by transposition trees
Geometric Graph Properties of the Spatial Preferred Attachment model
Memoryless computation: new results, constructions, and extensions
A generalized palindromization map in free monoids
Rainbow connections for planar graphs and line graphs
Constant-factor approximation of domination number in sparse graphs
