| 0 | -- | 0 | Bart De Bruyn. An Alternative Definition of the Notion Valuation in the Theory of Near Polygons |
| 0 | -- | 0 | Aisling Kenny. Geometrically Constructed Bases for Homology of Non-Crossing Partition Lattices |
| 0 | -- | 0 | Michael Goff. Optimal Betti Numbers of Forest Ideals |
| 0 | -- | 0 | Chris J. Bates, David M. Bundy, S. Hart, Peter Rowley. A Note on Commuting Graphs for Symmetric Groups |
| 0 | -- | 0 | Peter Horák, Alexander Rosa. On a Problem of Marco Buratti |
| 0 | -- | 0 | Kenji Kashiwabara. Scheduling Partial Round Robin Tournaments Subject to Home Away Pattern Sets |
| 0 | -- | 0 | Kyung-Won Hwang, Naeem N. Sheikh, Stephen G. Hartke. A Note on Divisibility of the Number of Matchings of a Family of Graphs |
| 0 | -- | 0 | Bryan L. Shader, Wasin So. Skew Spectra of Oriented Graphs |
| 0 | -- | 0 | Robert Morris. Minimal Percolating Sets in Bootstrap Percolation |
| 0 | -- | 0 | A. E. Brouwer, E. Spence. Cospectral Graphs on 12 Vertices |
| 0 | -- | 0 | Ido Ben-Eliezer, Michael Krivelevich. Perfectly Balanced Partitions of Smoothed Graphs |
| 0 | -- | 0 | A. I. Molev. Comultiplication Rules for the Double Schur Functions and Cauchy Identities |
| 0 | -- | 0 | Claude Laflamme, Karen Seyffarth. Distinguishing Chromatic Numbers of Bipartite Graphs |
| 0 | -- | 0 | Alexander E. Patkowski. On Some Partitions Related to Q(√2) |
| 0 | -- | 0 | Jeremy L. Martin, Jennifer D. Wagner. Updown Numbers and the Initial Monomials of the Slope Variety |
| 0 | -- | 0 | Karen L. Collins, Mark Hovey, Ann N. Trenk. Bounds on the Distinguishing Chromatic Number |
| 0 | -- | 0 | Alexander L. Churchill. Restrictions and Generalizations on Comma-Free Codes |
| 0 | -- | 0 | Bünyamin Demir, Ali Deniz, Sahin Koçak. Stability of Graphs |
| 0 | -- | 0 | Ben Young. Squishing Dimers on the Hexagon Lattice |
| 0 | -- | 0 | Nathaniel Thiem, Vidya Venkateswaran. Restricting Supercharacters of the Finite Group of Unipotent Uppertriangular Matrices |
| 0 | -- | 0 | Tom Bohman, Ron Holzman, Venkatesh Natarajan. Maximum Independent Sets in Certain Powers of Odd Cycles |
| 0 | -- | 0 | S. D. Noble. Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width |
| 0 | -- | 0 | G. Dupont. Positivity in Coefficient-Free Rank Two Cluster Algebras |
| 0 | -- | 0 | Ralph H. Buchholz, Warwick de Launey. An Edge-Minimization Problem for Regular Polygons |
| 0 | -- | 0 | Andrew R. A. McGrae, Michele Zito. The Block Connectivity of Random Trees |
| 0 | -- | 0 | Omran Kouba. A Duality Based Proof of the Combinatorial Nullstellensatz |
| 0 | -- | 0 | William Y. C. Chen, Jing Qin, Christian M. Reidys, Doron Zeilberger. Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams |
| 0 | -- | 0 | Samuel K. Hsiao. A Semigroup Approach to Wreath-Product Extensions of Solomon's Descent Algebras |
| 0 | -- | 0 | Geoffrey R. Grimmett, Svante Janson. Random Even Graphs |
| 0 | -- | 0 | David Cariolaro, Hung-Lin Fu. The Excessive [3]-Index of All Graphs |
| 0 | -- | 0 | Jin-Xin Zhou. Tetravalent Non-Normal Cayley Graphs of Order 4p |
| 0 | -- | 0 | M. I. Bueno, S. Furtado, N. Sherer. Maximum Exponent of Boolean Circulant Matrices with Constant Number of Nonzero Entries in their Generating Vector |
| 0 | -- | 0 | Catarina P. Avelino, Altino F. Santos. Spherical f-Tilings by Scalene Triangles and Isosceles Trapezoids III |
| 0 | -- | 0 | Jacob Steinhardt. On Coloring the Odd-Distance Graph |
| 0 | -- | 0 | Michael S. Payne. Unit Distance Graphs with Ambiguous Chromatic Number |
| 0 | -- | 0 | Agelos Georgakopoulos, Philipp Sprüssel. Geodetic Topological Cycles in Locally Finite Graphs |
| 0 | -- | 0 | Peter Allen, Vadim V. Lozin, Michaël Rao. Clique-Width and the Speed of Hereditary Properties |
| 0 | -- | 0 | Uwe Schauz. Mr. Paint and Mrs. Correct |
| 0 | -- | 0 | Yuri Yoshida, Tatsuya Maruta. Ternary Linear Codes and Quadrics |
| 0 | -- | 0 | Agnieszka Görlich, Andrzej Zak. A Note on Packing Graphs Without Cycles of Length up to Five |
| 0 | -- | 0 | Jie Yan, Chengmin Wang. u)'s |
| 0 | -- | 0 | Edward A. Bender, E. Rodney Canfield. Locally Restricted Compositions II. General Restrictions and Infinite Matrices |
| 0 | -- | 0 | David Ellis. Note on Generating All Subsets of a Finite Set with Disjoint Unions |
| 0 | -- | 0 | Bart De Bruyn. On a Class of Hyperplanes of the Symplectic and Hermitian Dual Polar Spaces |
| 0 | -- | 0 | D. Armstrong, Christian Krattenthaler. Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions |
| 0 | -- | 0 | Norbert Seifter, Vladimir Ivanovich Trofimov. Reachability Relations and the Structure of Transitive Digraphs |
| 0 | -- | 0 | Vít Jelínek, Toufik Mansour. Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions |
| 0 | -- | 0 | Jiangmin Pan. Locally Primitive Normal Cayley Graphs of Metacyclic Groups |
| 0 | -- | 0 | Elizabeth Perez Reilly, Edward R. Scheinerman. Random Threshold Graphs |
| 0 | -- | 0 | W. B. Vasantha, R. S. Selvaraj. Multi-Covering Radius for Rank Metric Codes |
| 0 | -- | 0 | Thomas Stoll, Jiang Zeng. On the Total Weight of Weighted Matchings of Segment Graphs |
| 0 | -- | 0 | Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga. On k-Walk-Regular Graphs |
| 0 | -- | 0 | Dan Hefetz, Sebastian U. Stich. On Two Problems Regarding the Hamiltonian Cycle Game |
| 0 | -- | 0 | H. N. Ramaswamy, C. R. Veena. On the Energy of Unitary Cayley Graphs |
| 0 | -- | 0 | Niklas Eriksen, Ragnar Freij, Johan Wästlund. Enumeration of Derangements with Descents in Prescribed Positions |
| 0 | -- | 0 | Abraham Isgur, David Reiss, Stephen M. Tanny. Trees and Meta-Fibonacci Sequences |
| 0 | -- | 0 | Agelos Georgakopoulos. Topological Circles and Euler Tours in Locally Finite Graphs |
| 0 | -- | 0 | Iwao Sato. A New Determinant Expression of the Zeta Function for a Hypergraph |
| 0 | -- | 0 | Benjamin R. Smith. Some Gregarious Cycle Decompositions of Complete Equipartite Graphs |
| 0 | -- | 0 | Charmaine Sia. Hurwitz Equivalence in Tuples of Dihedral Groups, Dicyclic Groups, and Semidihedral Groups |
| 0 | -- | 0 | Pu Gao, Nicholas C. Wormald. Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging |
| 0 | -- | 0 | Yaim Cooper. Properties Determined by the Ihara Zeta Function of a Graph |
| 0 | -- | 0 | László Babai, Barry Guiduli. Spectral Extrema for Graphs: The Zarankiewicz Problem |
| 0 | -- | 0 | Joel Brewster Lewis. Alternating, Pattern-Avoiding Permutations |
| 0 | -- | 0 | Robin Pemantle, Herbert S. Wilf. Counting Nondecreasing Integer Sequences that Lie Below a Barrier |
| 0 | -- | 0 | André E. Kézdy, Hunter S. Snevily, Susan C. White. 3 |
| 0 | -- | 0 | Guy Wolfovitz. Lower Bounds for the Size of Random Maximal H-Free Graphs |
| 0 | -- | 0 | Tsoy-Wo Ma. Higher Chain Formula proved by Combinatorics |
| 0 | -- | 0 | Nathaniel Thiem, C. Ryan Vinroot. Gelfand-Graev Characters of the Finite Unitary Groups |
| 0 | -- | 0 | Mike J. Grannell, Terry S. Griggs, Martin Knor. On Biembeddings of Latin Squares |
| 0 | -- | 0 | Rudy X. J. Liu. Set Systems with Restricted t-wise Intersections Modulo Prime Powers |
| 0 | -- | 0 | Asaf Shapira, Raphael Yuster. Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma |
| 0 | -- | 0 | Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson. Saturation Numbers for Trees |
| 0 | -- | 0 | Choongbum Lee. On the Size of Minimal Unsatisfiable Formulas |
| 0 | -- | 0 | Markus Kuba, Alois Panholzer, Helmut Prodinger. Lattice Paths, Sampling Without Replacement, and Limiting Distributions |
| 0 | -- | 0 | Yair Caro, Douglas B. West. Repetition Number of Graphs |
| 0 | -- | 0 | Zemin Jin, Xueliang Li. Anti-Ramsey Numbers for Graphs with Independent Cycles |
| 0 | -- | 0 | Torsten Sander. Sudoku Graphs are Integral |
| 0 | -- | 0 | Sergio Caracciolo, Alan D. Sokal, Andrea Sportiello. Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities I. Generalizations of the Capelli and Turnbull identities |
| 0 | -- | 0 | Yanqing Chen, Ligong Wang. The Laplacian Spread of Tricyclic Graphs |
| 0 | -- | 0 | Amin Coja-Oghlan, André Lanka. The Spectral Gap of Random Graphs with Given Expected Degrees |
| 0 | -- | 0 | Veselin Jungic, Tomás Kaiser, Daniel Král'. m |
| 0 | -- | 0 | Richard W. Kenyon, David B. Wilson. Combinatorics of Tripartite Boundary Connections for Trees and Dimers |
| 0 | -- | 0 | Paul Zinn-Justin. Littlewood-Richardson Coefficients and Integrable Tilings |
| 0 | -- | 0 | Jacob Fox, Benny Sudakov. Paths and Stability Number in Digraphs |
| 0 | -- | 0 | Matthew Alpert, Elie Feder, Heiko Harborth. The Maximum of the Maximum Rectilinear Crossing Numbers of d-Regular Graphs of Order n |
| 0 | -- | 0 | Luc Lapointe, Yvan Le Borgne, Philippe Nadeau. A Normalization Formula for the Jack Polynomials in Superspace and an Identity on Partitions |
| 0 | -- | 0 | Kyle Pula. Products of All Elements in a Loop and a Framework for Non-Associative Analogues of the Hall-Paige Conjecture |
| 0 | -- | 0 | Steven B. Gillispie, Branko Grünbaum. The {4, 5} Isogonal Sponges on the Cubic Lattice |
| 0 | -- | 0 | Michael O. Albertson, Daniel W. Cranston, Jacob Fox. Crossings, Colorings, and Cliques |
| 0 | -- | 0 | Michael Plantholt, Shailesh K. Tipnis. Vertex-Oriented Hamilton Cycles in Directed Graphs |
| 0 | -- | 0 | Rafael Ayala, Luis M. Fernández, José Antonio Vilches. Discrete Morse Inequalities on Infinite Graphs |
| 0 | -- | 0 | Cheng Yeaw Ku, Kok Bin Wong. Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover |
| 0 | -- | 0 | Rupert G. Wood, Douglas R. Woodall. Defective Choosability of Graphs without Small Minors |
| 0 | -- | 0 | Craig Lennon. On the Locality of the Prüfer Code |
| 0 | -- | 0 | Michael H. Albert, M. D. Atkinson, Vincent Vatter. Counting 1324, 4231-Avoiding Permutations |
| 0 | -- | 0 | Wolfgang Haas, Immanuel Halupczok, Jan-Christoph Schlage-Puchta. Lower Bounds for q-ary Codes with Large Covering Radius |
| 0 | -- | 0 | John T. Hall, Jeffrey Liese, Jeffrey B. Remmel. q-Counting Descent Pairs with Prescribed Tops and Bottoms |
| 0 | -- | 0 | Vladimir Nikiforov. Degree Powers in Graphs with a Forbidden Even Cycle |
| 0 | -- | 0 | Leonid Gurvits. A Short Proof, Based on Mixed Volumes, of Liggett's Theorem on the Convolution of Ultra-Logconcave Sequences |
| 0 | -- | 0 | Farzin Barekat, Stephanie van Willigenburg. Composition of Transpositions and Equality of Ribbon Schur Q-Functions |
| 0 | -- | 0 | M. Cámara, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga. Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes |
| 0 | -- | 0 | Hendrik Van Maldeghem. Semiaffine Spaces |
| 0 | -- | 0 | Richard A. Brualdi, Kathleen Kiernan. Landau's and Rado's Theorems and Partial Tournaments |
| 0 | -- | 0 | L. B. Richmond, Jeffrey Shallit. Counting Abelian Squares |
| 0 | -- | 0 | Dömötör Pálvölgyi. Combinatorial Necklace Splitting |
| 0 | -- | 0 | Xia Zhou, David M. Bradley, Tianxin Cai. Depth Reduction of a Class of Witten Zeta Functions |
| 0 | -- | 0 | Hongtao Zhao. Another Product Construction for Large Sets of Resolvable Directed Triple Systems |
| 0 | -- | 0 | Tom Rackham. Δ+1-Free Precolouring with Δ Colours |
| 0 | -- | 0 | Daniel Král', Douglas B. West. Chromatic Number for a Generalization of Cartesian Product Graphs |
| 0 | -- | 0 | Edward Dobson, Joy Morris. Automorphism Groups of Wreath Product Digraphs |
| 0 | -- | 0 | Manfred Walter. Some Results on Chromatic Polynomials of Hypergraphs |
| 0 | -- | 0 | Ebrahim Ghorbani, Jack H. Koolen, Jae Young Yang. Bounds for the Hückel Energy of a Graph |
| 0 | -- | 0 | William Y. C. Chen, Oliver X. Q. Gao, Peter L. Guo. Hook Length Formulas for Trees by Han's Expansion |
| 0 | -- | 0 | Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou. Tight Bounds for Quasirandom Rumor Spreading |
| 0 | -- | 0 | Arun Sharma. Enumerating Permutations that Avoid Three Term Arithmetic Progressions |
| 0 | -- | 0 | Rui Yang, Xinmin Hou, Ning Li, Wei Zhong. A Note on the Distance-Balanced Property of Generalized Petersen Graphs |
| 0 | -- | 0 | Thierry Gensane. Generation of Optimal Packings from Optimal Packings |
| 0 | -- | 0 | Ron Aharoni, Eli Berger. Rainbow Matchings in r-Partite r-Graphs |
| 0 | -- | 0 | Feng-Gen Lin, Lian-zhu Zhang. Pfaffian Orientation and Enumeration of Perfect Matchings for some Cartesian Products of Graphs |
| 0 | -- | 0 | A. Abdollahi, E. Vatandoost. Which Cayley Graphs are Integral? |
| 0 | -- | 0 | Thomas Kalinowski. A Dual of the Rectangle-Segmentation Problem for Binary Matrices |
| 0 | -- | 0 | Steve Kirkland. Near Threshold Graphs |
| 0 | -- | 0 | Satoshi Murai. Face Vectors of Two-Dimensional Buchsbaum Complexes |
| 0 | -- | 0 | Adrien Boussicault, Valentin Féray. Application of graph combinatorics to rational identities of type A |
| 0 | -- | 0 | Xuding Zhu. On-Line List Colouring of Graphs |
| 0 | -- | 0 | Anupam Prakash, Reto Spöhel, Henning Thomas. Balanced Online Ramsey Games in Random Graphs |
| 0 | -- | 0 | Vladimir Nikiforov. Spectral Saturation: Inverting the Spectral Turán Theorem |
| 0 | -- | 0 | Po-Shen Loh. A Note on Embedding Hypertrees |
| 0 | -- | 0 | Balázs Patkós. Traces of Uniform Families of Sets |
| 0 | -- | 0 | Ryan Martin, Yi Zhao. Tiling Tripartite Graphs with 3-Colorable Graphs |
| 0 | -- | 0 | Bart De Bruyn. n |
| 0 | -- | 0 | Frank Ruskey, Jennifer Woodcock. Counting Fixed-Height Tatami Tilings |
| 0 | -- | 0 | Filippo Cesi. Cayley Graphs on the Symmetric Group Generated by Initial Reversals have Unit Spectral Gap |
| 0 | -- | 0 | Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts. Maximal Flat Antichains of Minimum Weight |
| 0 | -- | 0 | Stephan G. Wagner. Almost All Trees have an Even Number of Independent Sets |
| 0 | -- | 0 | Marko Boben, Stefko Miklavic, Primoz Potocnik. Consistent Cycles in 1/2-Arc-Transitive Graphs |
| 0 | -- | 0 | Pradipta Mitra. Entrywise Bounds for Eigenvectors of Random Graphs |
| 0 | -- | 0 | Adam M. Goyt, David Mathisen. Permutation Statistics and q-Fibonacci Numbers |
| 0 | -- | 0 | Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti. (a) |
| 0 | -- | 0 | Pingzhi Yuan. Subsequence Sums of Zero-sum-free Sequences |
| 0 | -- | 0 | Frédéric Vanhove. 2n+1+1 |
| 0 | -- | 0 | Philippe Di Francesco, Rinat Kedem. Positivity of the T-System Cluster Algebra |
| 0 | -- | 0 | Iwao Sato. Bartholdi Zeta Functions of Fractal Graphs |
| 0 | -- | 0 | Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky. An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements |
| 0 | -- | 0 | Edward Dobson, István Kovács. 3 |
| 0 | -- | 0 | Reza Akhtar, Megan Boggess, Tiffany Jackson-Henderson, Isidora Jiménez, Rachel Karpman, Amanda Kinzel, Dan Pritikin. On the Unitary Cayley Graph of a Finite Ring |
| 0 | -- | 0 | Mariusz Meszka. k-Cycle Free One-Factorizations of Complete Graphs |
| 0 | -- | 0 | Jason E. Fulman. Mixing Time for a Random Walk on Rooted Trees |
| 0 | -- | 0 | Tsz Lung Chan, Wai Shun Cheung, Tuen-Wai Ng. Graceful Tree Conjecture for Infinite Trees |
| 0 | -- | 0 | Van H. Vu, Philip Matchett Wood. The Inverse Erdös-Heilbronn Problem |
| 0 | -- | 0 | Robert W. Chen, Alan Zame, Burton Rosenberg. On the First Occurrence of Strings |
| 0 | -- | 0 | Amir Rahnamai Barghi, Ilia Ponomarenko. Non-Isomorphic Graphs with Cospectral Symmetric Powers |
| 0 | -- | 0 | Daniel W. Cranston, Gexin Yu. A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid |
| 0 | -- | 0 | Kenzi Akiyama, Masayuki Ogawa, Chihiro Suetake. 7[21, 3]'s Admitting a Semiregular Automorphism Group of Order 9 |
| 0 | -- | 0 | Aslak Bakke Buan, Hermund André Torkildsen. n |
| 0 | -- | 0 | Maria Monks. Reconstructing Permutations from Cycle Minors |
| 0 | -- | 0 | Kerri Morgan, Graham Farr. Certificates of Factorisation for Chromatic Polynomials |
| 0 | -- | 0 | Jessica Striker. The Alternating Sign Matrix Polytope |
| 0 | -- | 0 | Ernesto Vallejo. n Characters |
| 0 | -- | 0 | Pedro Pablo Pérez Velasco, Juan de Lara. A Reformulation of Matrix Graph Grammars with Boolean Complexes |
| 0 | -- | 0 | Mireille Bousquet-Mélou, James Propp, Julian West. Perfect Matchings for the Three-Term Gale-Robinson Sequences |
| 0 | -- | 0 | Torleiv Kløve. Generating Functions for the Number of Permutations with Limited Displacement |
| 0 | -- | 0 | Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki. A Rainbow k-Matching in the Complete Graph with r Colors |
| 0 | -- | 0 | Natasha Rozhkovskaya. n(C) |
| 0 | -- | 0 | Kerri Morgan, Graham Farr. Certificates of Factorisation for a Class of Triangle-Free Graphs |
| 0 | -- | 0 | Yury J. Ionin. Isosceles Sets |
| 0 | -- | 0 | Clara E. Brasseur, Ryan E. Grady, Stratos Prassidis. Coverings, Laplacians, and Heat Kernels of Directed Graphs |
| 0 | -- | 0 | Chai Wah Wu. Multipartite Separability of Laplacian Matrices of Graphs |
| 0 | -- | 0 | Courtney R. Gibbons, Joshua D. Laison. Fixing Numbers of Graphs and Groups |
| 0 | -- | 0 | Alexander Gnedin, Grigori Olshanski. A q-Analogue of de Finetti's Theorem |
| 0 | -- | 0 | Refik Keskin, Bahar Demirtürk. 0(N) |
| 0 | -- | 0 | E. R. Vaughan. The Complexity of Constructing Gerechte Designs |
| 0 | -- | 0 | Augustine O. Munagi. Labeled Factorization of Integers |
| 0 | -- | 0 | Dan Singer. A Graph-Theoretic Method for Choosing a Spanning Set for a Finite-Dimensional Vector Space, with Applications to the Grossman-Larson-Wright Module and the Jacobian Conjecture |
| 0 | -- | 0 | Jennifer Vandenbussche, Douglas B. West. Independence Number of 2-Factor-Plus-Triangles Graphs |
| 0 | -- | 0 | Michael Lugo. Profiles of Permutations |
| 0 | -- | 0 | Boris Bukh. Set Families with a Forbidden Subposet |
| 0 | -- | 0 | Michael Giudici, Sarah Hart. Small Maximal Sum-Free Sets |
| 0 | -- | 0 | Thotsaporn "Aek" Thanatipanonda. On the Monochromatic Schur Triples Type Problem |
| 0 | -- | 0 | Dhruv Mubayi, Sundar Vishwanathan. Bipartite Coverings and the Chromatic Number |
| 0 | -- | 0 | Andrzej Pezarski, Michal Zmarz. Non-Repetitive 3-Coloring of Subdivided Graphs |
| 0 | -- | 0 | Xiaodong Xu, Stanislaw P. Radziszowski. An Improvement to Mathon's Cyclotomic Ramsey Colorings |