| 1 | -- | 0 | Jakub Przybylo, Andrzej Zak. Largest Component and Node Fault Tolerance for Grids |
| 1 | -- | 0 | Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk. Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs |
| 1 | -- | 0 | Andrés Eduardo Caicedo, Thomas A. C. Chartier, Péter Pál Pach. Coloring the $n$-Smooth Numbers with $n$ Colors |
| 1 | -- | 0 | Piotr Pokora. Hirzebruch-Type Inequalities Viewed as Tools in Combinatorics |
| 1 | -- | 0 | Pascal Ochem, Matthieu Rosenfeld. Avoidability of Palindrome Patterns |
| 1 | -- | 0 | Beáta Bényi, Toshiki Matsusaka. On the Combinatorics of Symmetrized Poly-Bernoulli Numbers |
| 1 | -- | 0 | Yuki Irie. The Sprague-Grundy Functions of Saturations of Misère Nim |
| 1 | -- | 0 | Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang. On the Spectra of General Random Mixed Graphs |
| 1 | -- | 0 | Gabriel Berzunza, Xing Shi Cai, Cecilia Holmgren. The $k$-Cut Model in Deterministic and Random Trees |
| 1 | -- | 0 | Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin. Conditions for a Bigraph to be Super-Cyclic |
| 1 | -- | 0 | Mark Jerrum, Tamás Makai. The Size of the Giant Joint Component in a Binomial Random Double Graph |
| 1 | -- | 0 | Michael C. Strayer. Classifications of $\Gamma$-Colored $d$-Complete Posets and Upper $P$-Minuscule Borel Representations |
| 1 | -- | 0 | Paul E. Gunnells. Generalized Catalan Numbers from Hypergraphs |
| 1 | -- | 0 | Zi-Xia Song, Jingmei Zhang. On the Size of $(K_t, \mathcal{T}_k)$-Co-Critical Graphs |
| 1 | -- | 0 | Shahrzad Haddadan. Some Instances of Homomesy Among Ideals of Posets |
| 1 | -- | 0 | Nicolau C. Saldanha. Domino Tilings of Cylinders: Connected Components under Flips and Normal Distribution of the Twist |
| 1 | -- | 0 | Songling Shan. Hamiltonian Cycles in Tough $(P_2\cup P_3)$-Free Graphs |
| 1 | -- | 0 | Claudia Andrei. Algebraic Properties of the Coordinate Ring of a Convex Polyomino |
| 1 | -- | 0 | Andrea C. Burgess, Peter Danziger, M. T. Javed. Cycle Decompositions of Complete Digraphs |
| 1 | -- | 0 | Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal. The Non-Commuting, Non-Generating Graph of a Nilpotent Group |
| 1 | -- | 0 | Alexander F. Sidorenko. Inequalities for Doubly Nonnegative Functions |
| 1 | -- | 0 | Tanya Khovanova, Eric Zhang. Limit Densities of Patterns in Permutation Inflations |
| 1 | -- | 0 | Freddie Illingworth. Graphs with no Induced $K_{2, t}$ |
| 1 | -- | 0 | Gábor Simonyi. Shannon Capacity and the Categorical Product |
| 1 | -- | 0 | Rachel Kirsch, A. J. Radcliffe. Many Cliques with Few Edges |
| 1 | -- | 0 | Andrew Beveridge, Ian Calaway, Kristin Heysse. De Finetti Lattices and Magog Triangles |
| 1 | -- | 0 | Murray Elder, Yoong Kuan Goh. $k$-Pop Stack Sortable Permutations and $2$-Avoidance |
| 1 | -- | 0 | Chanchal Kumar, Gargi Lather, Sonica. Skeleton Ideals of Certain Graphs, Standard Monomials and Spherical Parking Functions |
| 1 | -- | 0 | Ana Bernal. On Self-Mullineux and Self-Conjugate Partitions |
| 1 | -- | 0 | Jing Jian Li, Jicheng Ma. On Prime-Valent Symmetric Cayley Graphs of Finite Simple Groups |
| 1 | -- | 0 | Hannah E. Burson, Simone Sisneros-Thiry, Armin Straub. Refined Counting of Core Partitions into $d$-Distinct Parts |
| 1 | -- | 0 | Alan M. Frieze, Tomasz Tkocz. A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint |
| 1 | -- | 0 | Dudley Stark. The Component Counts of Random Injections |
| 1 | -- | 0 | Li Li, James Mixco, B. Ransingh, Ashish K. Srivastava. An Introduction to Supersymmetric Cluster Algebras |
| 1 | -- | 0 | Viviana Ene, Jürgen Herzog, Ayesha Asloob Qureshi, Francesco Romeo. Regularity and the Gorenstein property of $L$-convex Polyominoes |
| 1 | -- | 0 | Hong Liu 0010, Maryam Sharifzadeh, Katherine Staden. On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums |
| 1 | -- | 0 | Hannah Guggiari, Alex Scott 0001. Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree |
| 1 | -- | 0 | Hooman Reisi Dehkordi, Graham Farr. On the Strong Hanani-Tutte Theorem |
| 1 | -- | 0 | Marién Abreu, John Baptist Gauci, Domenico Labbate, Giuseppe Mazzuoccolo, Jean Paul Zerafa. Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs |
| 1 | -- | 0 | Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi. A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees |
| 1 | -- | 0 | Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin, Tomasz Tkocz. Minimum-Weight Combinatorial Structures Under Random Cost-Constraints |
| 1 | -- | 0 | Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer. Supersaturation, Counting, and Randomness in Forbidden Subposet Problems |
| 1 | -- | 0 | Eric Ould Dadah Andriantiana, Valisoa Razanajatovo Misanantenaina, Stephan Wagner 0003. Extremal Trees with Fixed Degree Sequence |
| 1 | -- | 0 | Peter Nelson, Sergey Norin. The Smallest Matroids with no Large Independent Flat |
| 1 | -- | 0 | Krzysztof Turowski, Wojciech Szpankowski. Towards Degree Distribution of a Duplication-Divergence Graph Model |
| 1 | -- | 0 | Yusuke Suyama. Classification of Toric Log Del Pezzo Surfaces with Few Singular Points |
| 1 | -- | 0 | Bo Bao, Rong Chen, Genghua Fan. Circuit Covers of Signed Eulerian Graphs |
| 1 | -- | 0 | Adam S. Jobson, André E. Kézdy. All Minor-Minimal Apex Obstructions with Connectivity Two |
| 1 | -- | 0 | Debsoumya Chakraborti, Mihir Hasabnis. The Threshold for the Full Perfect Matching Color Profile in a Random Coloring of Random Graphs |
| 1 | -- | 0 | Hooman Reisi Dehkordi, Graham Farr. Non-Separating Planar Graphs |
| 1 | -- | 0 | Samuel C. Gutekunst, Karola Mészáros, T. Kyle Petersen. Root Cones and the Resonance Arrangement |
| 1 | -- | 0 | Daniel M. Kane, Scott Duke Kominers. Prisoners, Rooms, and Light Switches |
| 1 | -- | 0 | Martin Milanic, Nevena Pivac. Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem |
| 1 | -- | 0 | Per Alexandersson, Luis Angel González-Serrano, Egor A. Maximenko, Mario Alberto Moctezuma-Salazar. Symmetric Polynomials in the Symplectic Alphabet and the Change of Variables $z_j = x_j + x_j^{-1}$ |
| 1 | -- | 0 | P. Mark Kayll, Esmaeil Parsa. Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization |
| 1 | -- | 0 | Robert Lukotka. Determining the Circular Flow Number of a Cubic Graph |
| 1 | -- | 0 | Maria Axenovich, Izolda Gorgol. Induced Ramsey Number for a Star Versus a Fixed Graph |
| 1 | -- | 0 | Soichi Okada. Birational Rowmotion and Coxeter-Motion on Minuscule Posets |
| 1 | -- | 0 | Janosch Döcker, Simone Linz, Charles Semple. Display Sets of Normal and Tree-Child Networks |
| 1 | -- | 0 | Jordan Mitchell Barrett, Valentino Vito. On Ramsey-Minimal Infinite Graphs |