| 0 | -- | 0 | Lyuben Lichev, Dieter Mitsche. On the Minimum Bisection of Random 3-Regular Graphs |
| 0 | -- | 0 | Antonino Ficarra, Jürgen Herzog, Takayuki Hibi. Behaviour of the Normalized Depth Function |
| 0 | -- | 0 | Nándor Sieben. Impartial Hypergraph Games |
| 0 | -- | 0 | Ron M. Adin, Yuval Roichman. Cyclic Descents, Matchings and Schur-Positivity |
| 0 | -- | 0 | Éric Fusy, Erkan Narmanli, Gilles Schaeffer. Enumeration of Corner Polyhedra and 3-Connected Schnyder Labelings |
| 0 | -- | 0 | Jonathan A. Noel, Arjun Ranganathan. On the Running Time of Hypergraph Bootstrap Percolation |
| 0 | -- | 0 | Chunqiu Fang, Ervin Györi, Chuanqi Xiao, Jimeng Xiao. Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs |
| 0 | -- | 0 | Ragnar Freij-Hollanti, Relinde Jurrius, Olga Kuznetsova. Combinatorial Derived Matroids |
| 0 | -- | 0 | Gregg Musiker, Kayla Wright. Mixed Dimer Configuration Model in Type D Cluster Algebras |
| 0 | -- | 0 | Mark Holmes, Alexander E. Holroyd, Alejandro Ramírez. Cyclic Products and Optimal Traps in Cyclic Birth and Death Chains |
| 0 | -- | 0 | Faqruddin Ali Azam, Edward Richmond. On the Generating Function for Intervals in Young's Lattice |
| 0 | -- | 0 | Wei Li, Yao Wang. Enumeration of Perfect Matchings of the Cartesian Products of Graphs |
| 0 | -- | 0 | Michael Drmota, Marc Noy, Clément Requilé, Juanjo Rué. Random Cubic Planar Maps |
| 0 | -- | 0 | Davoud Abdi. A Cantor-Bendixson Rank for Siblings of Trees |
| 0 | -- | 0 | Manoj Kummini, Dharm Veer. The $h$-Polynomial and the Rook Polynomial of some Polyominoes |
| 0 | -- | 0 | Zhenzhen Lou, Mingfei Gao, Qiongxiang Huang. On the Spectral Radius of Minimally 2-(Edge)-Connected Graphs with Given Size |
| 0 | -- | 0 | Zhipeng Lu. On Counting Double Centralizers of Symmetric Groups |
| 0 | -- | 0 | Robert Hickingbotham. Induced Subgraphs and Path Decompositions |
| 0 | -- | 0 | Alin Bostan, Sergey Yurkevich. On the $q$-Analogue of Pólya's Theorem |
| 0 | -- | 0 | Tolson Bell. The Park-Pham Theorem with Optimal Convergence Rate |
| 0 | -- | 0 | João Paulo Costalonga, Talmage James Reid, Haidong Wu. Rooted Prism-Minors and Disjoint Cycles Containing a Specified Edge |
| 0 | -- | 0 | Pavel Shuldiner, R. Wayne Oldford. How Many Cliques Can a Clique Cover Cover? |
| 0 | -- | 0 | Svante Janson. The Number of Occurrences of Patterns in a Random Tree or Forest Permutation |
| 0 | -- | 0 | Michael Anastos. A Note on Long Cycles in Sparse Random Graphs |
| 0 | -- | 0 | Sami Assaf, Danjoseph Quijada. Monk's Rule for Demazure Characters of the General Linear Group |
| 0 | -- | 0 | Svante Janson, Valentas Kurauskas. Estimating Global Subgraph Counts by Sampling |
| 0 | -- | 0 | Kagan Kursungöz, Halime Ömrüuzun Seyrek. Combinatorial Constructions of Generating Functions of Cylindric Partitions with Small Profiles into Unrestricted or Distinct Parts |
| 0 | -- | 0 | Patrick Arras. Ore- and Pósa-Type Conditions for Partitioning 2-Edge-Coloured Graphs into Monochromatic Cycles |
| 0 | -- | 0 | Aram Dermenjian. Maximal Degree Subposets of $\nu$-Tamari Lattices |
| 0 | -- | 0 | Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl. Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs |
| 0 | -- | 0 | Hadi Kharaghani, Sho Suda. Hadamard Matrices related to Projective Planes |
| 0 | -- | 0 | Jane Ivy Coons, Seth Sullivant. The $h^*$-Polynomial of the Order Polytope of the Zig-Zag Poset |
| 0 | -- | 0 | Marek Sokolowski. Bounds on Half Graph Orders in Powers of Sparse Graphs |
| 0 | -- | 0 | Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat. Edge and Pair Queries-Random Graphs and Complexity |
| 0 | -- | 0 | Vsevolod F. Lev, Oriol Serra. Towards $3n-4$ in groups of prime order |
| 0 | -- | 0 | Denis S. Krotov. Perfect Colorings of the Infinite Square Grid: Coverings and Twin Colors |
| 0 | -- | 0 | Liam Armstrong, Bryan Ducasse, Thomas Meyer, Holly Swisher. Generalized Alder-Type Partition Inequalities |
| 0 | -- | 0 | Zheng-Jiang Xia, Jae-Ho Lee, Jack H. Koolen. A New Feasibility Condition for the AT4 Family |
| 0 | -- | 0 | Cheolwon Heo, Hyobin Kim, Siggers Mark. The Complexity of the Matroid Homomorphism Problem |
| 0 | -- | 0 | Claudio Alexandre Piedade. Infinite Families of Hypertopes from Centrally Symmetric Polytopes |
| 0 | -- | 0 | Nicolas Folinsbee, Joel Friedman. Generalized Riemann Functions, Their Weights, and the Complete Graph |
| 0 | -- | 0 | Michael Krul, Lubos Thoma. An Algebraic Formulation of Hypergraph Colorings |
| 0 | -- | 0 | José L. Fernández, Pablo Fernández. Some Arithmetic Properties of Pólya's Urn |
| 0 | -- | 0 | Tom Johnston. Zero-Sum Squares in $\{-1, 1\}$-Matrices with Low Discrepancy |
| 0 | -- | 0 | Luiz Emilio Allem, Elismar R. Oliveira, Fernando Tura. Generating $I$-Eigenvalue Free Threshold Graphs |
| 0 | -- | 0 | George Drummond, Charles Semple. A Splitter Theorem for Elastic Elements in 3-Connected Matroids |
| 0 | -- | 0 | Kevin Liu. Characterizing Planar Tanglegram Layouts and Applications to Edge Insertion Problems |
| 0 | -- | 0 | Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen. Tight Bound for the Number of Distinct Palindromes in a Tree |
| 0 | -- | 0 | Tara Gomes, Christopher O'Neill, Eduardo Torres Davila. Numerical Semigroups, Polyhedra, and Posets III: Minimal Presentations and Face Dimension |
| 0 | -- | 0 | Alheydis Geiger, Marta Panizzut. A Tropical Count of Real Bitangents to Plane Quartic Curves |
| 0 | -- | 0 | Yinsong Chen, Vladislav Kargin. On Enumeration and Entropy of Ribbon Tilings |
| 0 | -- | 0 | Dandan Fan, Xueyi Huang, Huiqiu Lin. Spectral Radius Conditions for the Rigidity of Graphs |
| 0 | -- | 0 | Han Wang, Zhi-Wei Sun. Proof of a Conjecture Involving Derangements and Roots of Unity |
| 0 | -- | 0 | Federico Romaniello, Jean Paul Zerafa. Betwixt and Between 2-Factor Hamiltonian and Perfect-Matching-Hamiltonian Graphs |
| 0 | -- | 0 | Bojan Basic, Aleksa Dzuklevski, Anna Slivková. Solutions to Seven and a Half Problems on Tilings |
| 0 | -- | 0 | Margaret Bayer, Marija Jelic Milutinovic, Julianne Vega. Perfect Matching Complexes of Honeycomb Graphs |
| 0 | -- | 0 | Mikhail Isaev, Mihyun Kang. On the Chromatic Number in the Stochastic Block Model |