Table of Contents
Papers
Periodic Rigidity on a Variable Torus Using Inductive Constructions | |
Anthony Nixon, Elissa Ross | P1.1 |
Evaluating the Numbers of some Skew Standard Young Tableaux of Truncated Shapes | |
Ping Sun | P1.2 |
Some Enumerations on Non-Decreasing Dyck Paths | |
Éva Czabarka, Rigoberto Flórez, Leandro Junes | P1.3 |
Group Homomorphisms as Error Correcting Codes | |
Alan Guo | P1.4 |
Vertically Symmetric Alternating Sign Matrices and a Multivariate Laurent Polynomial Identity | |
Ilse Fischer, Lukas Riegler | P1.5 |
On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach | |
Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang | P1.6 |
On Computing the Degree of Convexity of Polyominoes | |
Stefano Brocchi, Giuseppa Castiglione, Paolo Massazza | P1.7 |
The Concavity and Convexity of the Boros-Moll Sequences | |
Ernest X.W. Xia | P1.8 |
Proof of a Conjecture of Amdeberhan and Moll on a Divisibility Property of Binomial Coefficients | |
Quan-Hui Yang | P1.9 |
Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions | |
Martin Loebl, Petr Somberg | P1.10 |
Maximum 4-Degenerate Subgraph of a Planar Graph | |
Robert Lukot'ka, Ján Mazák, Xuding Zhu | P1.11 |
Characterizations of Regularity for certain $Q$-Polynomial Association Schemes | |
Sho Suda | P1.12 |
Spanning $k$-trees of Bipartite Graphs | |
Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita | P1.13 |
Crossings and Nestings for Arc-Coloured Permutations and Automation | |
Lily Yen | P1.14 |
On-line Ramsey Numbers of Paths and Cycles | |
Joanna Cyman, Tomasz Dzido, John Lapinskas, Allan Lo | P1.15 |
On Keller’s Conjecture in Dimension Seven | |
Andrzej P. Kisielewicz, Magdalena Łysakowska | P1.16 |
Brown's Theorem and its Application for Enumeration of Dissections and Planar Trees | |
Evgeniy Krasko, Alexander Omelchenko | P1.17 |
Multiple Coverings with Closed Polygons | |
István Kovács, Géza Tóth | P1.18 |
On the Codes Related to the Higman-Sims Graph | |
Wolfgang Knapp, Hans-Jörg Schaeffer | P1.19 |
On a Refinement of Wilf-equivalence for Permutations | |
Sherry H.F. Yan, Huiyun Ge, Yaqiu Zhang | P1.20 |
On Commuting Graphs for Elements of Order 3 in Symmetric Groups | |
Athirah Nawawi, Peter Rowley | P1.21 |
A Characterization of the Hermitian Variety in Finite 3-Dimensional Projective Spaces | |
Vito Napolitano | P1.22 |
Faster Rumor Spreading With Multiple Calls | |
Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald | P1.23 |
Polygons as Sections of Higher-Dimensional Polytopes | |
Arnau Padrol, Julian Pfeifle | P1.24 |
On a Certain Vector Crank Modulo 7 | |
Michael D. Hirschhorn, Pee Choon Toh | P1.25 |
Wieland Drift for Triangular Fully Packed Loop Configurations | |
Sabine Beil, Ilse Fischer, Philippe Nadeau | P1.26 |
A New Approach to the 2-Regularity of the $\ell$-Abelian Complexity of 2-Automatic Sequences | |
Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme | P1.27 |
Density of Gallai Multigraphs | |
Colton Magnant | P1.28 |
Power of $k$ Choices and Rainbow Spanning Trees in Random Graphs | |
Deepak Bal, Patrick Bennett, Alan Frieze, Paweł Prałat | P1.29 |
Induced and Non-induced Forbidden Subposet Problems | |
Balázs Patkós | P1.30 |
Maximal Clades in Random Binary Search Trees | |
Svante Janson | P1.31 |
An improved lower bound related to the Furstenberg-Sárközy theorem | |
Mark Lewko | P1.32 |
Exchangeable Pairs, Switchings, and Random Regular Graphs | |
Tobias Johnson | P1.33 |
Between 2- and 3-Colorability | |
Alan Frieze, Wesley Pegden | P1.34 |
On Limits of Dense Packing of Equal Spheres in a Cube | |
Milos Tatarevic | P1.35 |
Conditions for the Parameters of the Block Graph of Quasi-Symmetric Designs | |
Rajendra M. Pawale, Mohan S. Shrikhande, Shubhada M. Nyayate | P1.36 |
Modular Statistics for Subgraph Counts in Sparse Random Graphs | |
Bobby DeMarco, Jeff Kahn, Amanda Redlich | P1.37 |
A Generalization of the $k$-Bonacci Sequence from Riordan Arrays | |
José L. Ramírez, Víctor F. Sirvent | P1.38 |
Leapfrog Constructions: From Continuant Polynomials to Permanents of Matrices | |
Alberto Facchini, André Leroy | P1.39 |
A Note on Goldbach Partitions of Large Even Integers | |
Ljuben Mutafchiev | P1.40 |
The Maximum Difference between the Number of Atoms and Number of Coatoms of a Bruhat Interval of the Symmetric Group | |
Emmanuel Tsukerman | P1.41 |
Backward Jeu de Taquin Slides for Composition Tableaux and a Noncommutative Pieri Rule | |
Vasu Tewari | P1.42 |
Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions | |
Reinhard Diestel | P1.43 |
On Graph Parameters Guaranteeing Fast Sandpile Diffusion | |
Ayush Choure, Sundar Vishwanathan | P1.44 |
Some Results on the Structure of Multipoles in the Study of Snarks | |
M. A. Fiol, J. Vilaltella | P1.45 |
Bipartite Graphs whose Squares are not Chromatic-Choosable | |
Seog-Jin Kim, Boram Park | P1.46 |
On Maltsev Digraphs | |
Catarina Carvalho, Laszlo Egri, Marcel Jackson, Todd Niven | P1.47 |
On the Longest $k$-Alternating Subsequence | |
Igor Pak, Robin Pemantle | P1.48 |
Characterisations of Elementary Pseudo-Caps and Good Eggs | |
Sara Rottey, Geertrui Van de Voorde | P1.49 |
Decomposing Dense Bipartite Graphs into 4-Cycles | |
Nicholas Cavenagh | P1.50 |
Small Snarks with Large Oddness | |
Robert Lukoťka, Edita Máčajová, Ján Mazák, Martin Škoviera | P1.51 |
Asymptotic Expansion of the Multi-Orientable Random Tensor Model | |
Eric Fusy, Adrian Tanasa | P1.52 |
Infinite Gammoids | |
Seyed Hadi Afzali Borujeni, Hiu-Fai Law, Malte Müller | P1.53 |
Gammoids, Pseudomodularity and Flatness Degree | |
Jorge Alberto Olarte | P1.54 |
On Shuffling of Infinite Square-Free Words | |
Mike Müller, Svetlana Puzynina, Michaël Rao | P1.55 |
Distributions Defined by $q$-Supernomials, Fusion Products, and Demazure Modules | |
Stavros Kousidis, Ernst Schulte-Geers | P1.56 |
Near-Colorings: Non-Colorable Graphs and NP-Completeness | |
M. Montassier, P. Ochem | P1.57 |
Ascent Sequences Avoiding Pairs of Patterns | |
Andrew M. Baxter, Lara K. Pudwell | P1.58 |
Summation of Rational Series Twisted by Strongly $B$-multiplicative Coefficients | |
Jean-Paul Allouche, Jonathan Sondow | P1.59 |
Keeping Avoider's Graph Almost Acyclic | |
Dennis Clemens, Julia Ehrenmüller, Yury Person, Tuan Tran | P1.60 |
Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs | |
Asaf Ferber | P1.61 |
Lai's Conditions for Spanning and Dominating Closed Trails | |
Wei-Guo Chen, Zhi-Hong Chen, Mei Lu | P1.62 |
A Criterion for a Monomial Ideal to have a Linear Resolution in Characteristic 2 | |
E. Connon, Sara Faridi | P1.63 |
On the Number of Walks in a Triangular Domain | |
Paul R.G. Mortimer, Thomas Prellberg | P1.64 |
Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position | |
Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow | P1.65 |
Sandpiles and Dominos | |
Laura Florescu, Daniela Morar, David Perkinson, Nicholas Salter, Tianyuan Xu | P1.66 |
Faces of Birkhoff Polytopes | |
Andreas Paffenholz | P1.67 |
A Bijective Proof of the Alladi-Andrews-Gordon Partition Theorem | |
James J.Y. Zhao | P1.68 |
On the Strength of Connectedness of a Random Hypergraph | |
Daniel Poole | P1.69 |
A De Bruijn–Erdős Theorem for Chordal Graphs | |
Laurent Beaudou, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vašek Chvátal, Nicolas Fraiman, Yori Zwols | P1.70 |
Solution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs | |
Xiaolin Chen, Xueliang Li, Huishu Lian | P1.71 |
A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs | |
Natacha Astromujoff, Martin Matamala | P1.72 |
Crystal Structure on Rigged Configurations and the Filling Map | |
Anne Schilling, Travis Scrimshaw | P1.73 |
Heffter Arrays and Biembedding Graphs on Surfaces | |
Dan Archdeacon | P1.74 |
Simplicial Complexes of Whisker Type | |
Mina Bigdeli, Jürgen Herzog, Takayuki Hibi, Antonio Macchia | P1.75 |
Vertex-Transitive Digraphs of Order $p^5$ are Hamiltonian | |
Jun-Yang Zhang | P1.76 |
Generalized Cages | |
Marko Boben, Robert Jajcay, Tomaz Pisanski | P1.77 |
The Distinguishing Index of Infinite Graphs | |
Izak Broere, Monika Pilśniak | P1.78 |
Linear Relations for a Generalized Tutte Polynomial | |
Gary Gordon | P1.79 |
Most Probably Intersecting Hypergraphs | |
Shagnik Das, Benny Sudakov | P1.80 |
Maximal Partial Latin Cubes | |
Thomas Britz, Nicholas J. Cavenagh, Henrik Kragh Sørensen | P1.81 |
On Graphs Having no Flow Roots in the Interval $(1,2)$ | |
F.M. Dong | P1.82 |
On the Number of Maximal Intersecting $k$-Uniform Families and Further Applications of Tuza's Set Pair Method | |
Zoltán Lóránt Nagy, Balázs Patkós | P1.83 |
A Deza–Frankl Type Theorem for Set Partitions | |
Cheng Yeaw Ku, Kok Bin Wong | P1.84 |
ISSN: 1077-8926