| 1021 | -- | 1043 | Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt. Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs |
| 1045 | -- | 1065 | Daniel W. Cranston, Landon Rabern. Edge Lower Bounds for List Critical Graphs, Via Discharging |
| 1067 | -- | 1078 | Mauro Di Nasso, Maria Riggio. Fermat-Like Equations that are not Partition Regular |
| 1079 | -- | 1094 | Peter Frankl. Resilient Hypergraphs with Fixed Matching Number |
| 1095 | -- | 1100 | Brandon Hanson. The Additive Structure of Cartesian Products Spanning Few Distinct Distances |
| 1101 | -- | 1127 | Rintaro Ikeshita, Shin-ichi Tanigawa. Count Matroids of Group-Labeled Graphs |
| 1129 | -- | 1148 | Gwenaël Joret, Piotr Micek, Veit Wiechert. Sparsity and Dimension |
| 1149 | -- | 1174 | Ben D. Lund. Essential Dimension and the Flats Spanned by a Point Set |
| 1175 | -- | 1203 | Péter Pál Pach, Csaba Sándor. Multiplicative Bases and an Erdős Problem |
| 1205 | -- | 1238 | Shubhangi Saraf, Ilya Volkovich. Black-Box Identity Testing of Depth-4 Multilinear Circuits |
| 1239 | -- | 1249 | Victor A. Vassiliev. Topology of Complexes of Edge Covering Partite Graphs and Hypergraphs |
| 1251 | -- | 1263 | Yujun Yang, Dong Ye. Inverses of Bipartite Graphs |
| 1265 | -- | 1267 | Tamás Fleiner. A Note on Restricted List Edge-Colourings |
| 1269 | -- | 1277 | Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh. A Simple Proof of Optimal Epsilon Nets |
| 1279 | -- | 1284 | Sang-il Oum, Sounggun Wee. A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein |