1 | -- | 0 | Jack H. Koolen, Joohyung Kim, Jongyook Park. Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity |
2 | -- | 0 | Julia Böttcher, Jan Foniok. Ramsey Properties of Permutations |
3 | -- | 0 | Philippe Di Francesco, Rinat Kedem. T-systems with Boundaries from Network Solutions |
4 | -- | 0 | Jakob Jonsson. Hom Complexes of Set Systems |
5 | -- | 0 | Richard P. Anstee, Ruiyuan Chen. Forbidden Submatrices: Some New Bounds and Constructions |
6 | -- | 0 | Taylor F. Allison, Anant P. Godbole, Kathryn M. Hawley, Bill Kay. Covering n-Permutations with (n+1)-Permutations |
7 | -- | 0 | Adam M. Goyt, Brady L. Keller, Jonathan E. Rue. Statistical Distributions and q-Analogues of k-Fibonacci Numbers |
8 | -- | 0 | Kate Rudolph. Pattern Popularity in 132-Avoiding Permutations |
9 | -- | 0 | Zhi-Wei Sun. Products and Sums Divisible by Central Binomial Coefficients |
10 | -- | 0 | Gábor Simonyi, Claude Tardif, Ambrus Zsbán. Colourful Theorems and Indices of Homomorphism Complexes |
11 | -- | 0 | Shi-Mei Ma. A Family of Two-Variable Derivative Polynomials for Tangent and Secant |
12 | -- | 0 | Leila Maherani, Gholam Reza Omidi, Ghaffar Raeisi, Maryam Shahsiah. The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs |
13 | -- | 0 | Pawel Baturo, Marcin Piatkowski, Wojciech Rytter. The Maximal Number of Runs in Standard Sturmian Words |
14 | -- | 0 | Yang Jiao. On the Sprague-Grundy Values of the 픽-Wythoff Game |
15 | -- | 0 | Michel Lavrauw, Geertrui Van de Voorde. Scattered Linear Sets and Pseudoreguli |
16 | -- | 0 | István Miklós, Péter L. Erdös, Lajos Soukup. Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence |
17 | -- | 0 | Huajun Zhang. Cross-Intersecting Families of Labeled Sets |
18 | -- | 0 | András Gyárfás, Gábor N. Sárközy. Monochromatic Path and Cycle Partitions in Hypergraphs |
19 | -- | 0 | Michael Cavers, Karen Seyffarth. Graphs with Large Distinguishing Chromatic Number |
20 | -- | 0 | Daniel Gomez, Hans Lundmark, Jacek Szmigielski. The Canada Day Theorem |
21 | -- | 0 | Ricky Ini Liu. Nonconvexity of the Set of Hypergraph Degree Sequences |
22 | -- | 0 | Masataka Nakamura, Kenji Kashiwabara. The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases |
23 | -- | 0 | Zhongyuan Che, Karen L. Collins. The Distinguishing Chromatic Number of Kneser Graphs |
24 | -- | 0 | Tommaso Traetta. On a Class of Highly Symmetric k-Factorizations |
25 | -- | 0 | John R. Britnell, Mark Wildon. Finding a Princess in a Palace: a Pursuit-Evasion Problem |
26 | -- | 0 | Eric Lars Sundberg. Extremal Hypergraphs for the Biased Erdős-Selfridge Theorem |
27 | -- | 0 | Iwao Sato, Hideo Mitsuhasi, Hideaki Morita. A New Determinant Expression for the Weighted Bartholdi Zeta Function of a Digraph |
28 | -- | 0 | Joshua Cooper, Erik Lundberg, Brendan Nagle. Generalized Pattern Frequency in Large Permutations |
29 | -- | 0 | Ngoc Dai Nguyen, Minh Hai Nguyen, Duy Hieu Do, Anh Vinh Le. Integral Cayley Graphs Generated by Distance Sets in Vector Spaces over Finite Fields |
30 | -- | 0 | Jan Goedgebeur, Stanislaw P. Radziszowski. New Computational Upper Bounds for Ramsey Numbers R(3, k) |
31 | -- | 0 | Samuel A. Alexander. Biologically Unavoidable Sequences |
32 | -- | 0 | Balázs Patkós. Families that Remain k-Sperner Even After Omitting an Element of their Ground Set |
33 | -- | 0 | Yair Caro, Adriana Hansberg. New Approach to the k-Independence Number of a Graph |
34 | -- | 0 | Amela Muratovic-Ribic, Qiang Wang. Partitions and Compositions over Finite Fields |
35 | -- | 0 | Van Bang Le, Florian Pfender. Extremal Graphs Having No Stable Cutset |
36 | -- | 0 | Jiangmin Pan, Bengong Lou, Cuifeng Liu. Arc-transitive Pentavalent Graphs of Order 4pq |
37 | -- | 0 | Tomás Kaiser, Jean-Sébastien Sereni, Zelealem B. Yilma. Multiple Petersen Subdivisions in Permutation Graphs |
38 | -- | 0 | Padraig Ó Catháin. Inequivalence of Difference Sets: On a Remark of Baumert |
39 | -- | 0 | Sean Cleary, Andrew Rechnitzer, Thomas Wong. Common Edges in Rooted Trees and Polygonal Triangulations |
40 | -- | 0 | Lukas Katthän. Decomposing Sets of Inversions |
41 | -- | 0 | Dirk Kreimer, Karen Yeats. Properties of the Corolla Polynomial of a 3-regular Graph |
42 | -- | 0 | Graeme Taylor, Gary Greaves. Lehmer's Conjecture for Hermitian Matrices over the Eisenstein and Gaussian Integers |
43 | -- | 0 | Marcel Kenji de Carli Silva, Levent Tunçel. Optimization Problems over Unit-Distance Representations of Graphs |
44 | -- | 0 | R. Julian R. Abel, Nicholas J. Cavenagh, Jaromy Kuhl. Induced Subarrays of Latin Squares Without Repeated Symbols |
45 | -- | 0 | William E. Clark, Xiang-dong Hou. Galkin Quandles, Pointed Abelian Groups, and Sequence A000712 |
46 | -- | 0 | Jianguo Qian. Enumeration of Unlabeled Directed Hypergraphs |
47 | -- | 0 | Xin Guo Ce, Zhou Yue. Residue Reduced Form of a Rational Function as an Iterated Laurent Series |
48 | -- | 0 | Sara Saeedi Madani, Dariush Kiani. On The Binomial Edge Ideal of a Pair of Graphs |
49 | -- | 0 | Andy Parrish. Toward a Graph Version of Rado's Theorem |
50 | -- | 0 | Marcia J. Groszek. Ramsey Properties of Countably Infinite Partial Orderings |
51 | -- | 0 | Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood. Nonrepetitive Colourings of Planar Graphs with O(log n) Colours |
52 | -- | 0 | Mirkó Visontai. Some Remarks on the Joint Distribution of Descents and Inverse Descents |
53 | -- | 0 | Raphael Yuster. Edge-Disjoint Induced Subgraphs with Given Minimum Degree |
54 | -- | 0 | Min Yan. Combinatorial Tilings of the Sphere by Pentagons |
55 | -- | 0 | Zhicong Lin. On some Generalized q-Eulerian Polynomials |
56 | -- | 0 | Jing Chen, Cai Heng Li, Ákos Seress. A Family of Half-Transitive Graphs |
57 | -- | 0 | József Balogh, Alexandr V. Kostochka, Andrew Treglown. On Perfect Packings in Dense Graphs |
58 | -- | 0 | Sarada Herke, Barbara M. Maenhaut. Perfect 1-Factorisations of Circulants with Small Degree |
59 | -- | 0 | Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, John Harris, Joy Singleton. An Iterative Approach to the Traceability Conjecture for Oriented Graphs |
60 | -- | 0 | Guillem Perarnau, Giorgis Petridis. Matchings in Random Biregular Bipartite Graphs |
61 | -- | 0 | Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar. Making a Graph Crossing-Critical by Multiplying its Edges |
62 | -- | 0 | Bostjan Frelih, Stefko Miklavic. Edge Regular Graph Products |
63 | -- | 0 | James J. Y. Zhao. An Involution Proof of the Alladi-Gordon Key Identity for Schur's Partition Theorem |
64 | -- | 0 | Afshin Behmaram, Shmuel Friedland. Upper Bounds for Perfect Matchings in Pfaffian and Planar Graphs |
65 | -- | 0 | Hong Liu. Extremal Graphs for Blow-Ups of Cycles and Trees |
66 | -- | 0 | Shabnam Malik, Ahmad Mahmood Qureshi, Tudor Zamfirescu. Hamiltonicity of Cubic 3-Connected k-Halin Graphs |
67 | -- | 0 | László A. Székely, Hua Wang. Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees |
68 | -- | 0 | Geoffrey Exoo. On Some Small Classical Ramsey Numbers |
69 | -- | 0 | Antoni Lozano. Symmetry Breaking in Tournaments |
70 | -- | 0 | Stephen M. Shea. Graph Labelings and Continuous Factors of Dynamical Systems |
71 | -- | 0 | Marien Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez. Biregular Cages of Girth Five |
72 | -- | 0 | David Clark, Vladimir D. Tonchev. Enumeration of (16, 4, 16, 4) Relative Difference Sets |
73 | -- | 0 | David Galvin, Do Trong Thanh. Stirling Numbers of Forests and Cycles |
74 | -- | 0 | Debra L. Boutin. The Cost of 2-Distinguishing Cartesian Powers |
75 | -- | 0 | Josep Conde, Joan Gimbert, Josep González, Josep M. Miret, Ramiro Moreno. Nonexistence of Almost Moore Digraphs of Diameter Four |
76 | -- | 0 | William Y. C. Chen, Alvin Y. L. Dai, Theodore Dokos, Tim Dwyer, Bruce E. Sagan. On 021-Avoiding Ascent Sequences |