Table of Contents
Papers
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs | |
Darryn Bryant, Andrea Burgess, Peter Danziger | P2.1 |
Enumeration of Hybrid Domino-Lozenge Tilings II: Quasi-Octagonal Regions | |
Tri Lai | P2.2 |
On Mixed Almost Moore Graphs of Diameter Two | |
Nacho López, Josep M. Miret | P2.3 |
Cyclic Sieving and Rational Catalan Theory | |
Michelle Bodnar, Brendon Rhoades | P2.4 |
Blocking and Double Blocking Sets in Finite Planes | |
Jan De Beule, Tamás Héger, Tamás Szőnyi, Geertrui Van de Voorde | P2.5 |
On Snarks that are far from being 3-Edge Colorable | |
Jonas Hägglund | P2.6 |
Evaluations of Hecke Algebra Traces at Kazhdan-Lusztig Basis Elements | |
Samuel Clearman, Matthew Hyatt, Brittany Shelton, Mark Skandera | P2.7 |
Pairs of Quadratic Forms over Finite Fields | |
Alexander Pott, Kai-Uwe Schmidt, Yue Zhou | P2.8 |
Nice Reflection Arrangements | |
Torsten Hoge, Gerhard Röhrle | P2.9 |
Locally Convex Words and Permutations | |
Christopher Coscia, Jonathan DeWitt | P2.10 |
An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching | |
Dennis Clemens, Julia Ehrenmüller | P2.11 |
Weakly Distance-Regular Digraphs of Valency Three, I | |
Yuefeng Yang, Benjian Lv, Kaishun Wang | P2.12 |
The Bondage Number of Random Graphs | |
Dieter Mitsche, Xavier Pérez-Giménez, Paweł Prałat | P2.13 |
The Peak Statistics on Simsun Permutations | |
Shi-Mei Ma, Yeong-Nan Yeh | P2.14 |
Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph | |
Jessica De Silva, Theodore Molla, Florian Pfender, Troy Retter, Michael Tait | P2.15 |
Graphs with no $\bar P_7$-Minor | |
Guoli Ding, Chanun Lewchalermvongs, John Maharry | P2.16 |
On the Staircases of Gyárfás | |
János Csányi, Peter Hajnal, Gábor V. Nagy | P2.17 |
Locally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs | |
Eric Swartz | P2.18 |
Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree | |
Francesc Aguiló, Miquel Àngel Fiol, Sonia Pérez | P2.19 |
Inverse Expander Mixing for Hypergraphs | |
Emma Cohen, Dhruv Mubayi, Peter Ralli, Prasad Tetali | P2.20 |
Multi-Eulerian Tours of Directed Graphs | |
Matthew Farrell, Lionel Levine | P2.21 |
On Isomorphisms of Vertex-transitive Graphs | |
Jing Chen, Binzhou Xia | P2.22 |
Completing Partial Latin Squares with One Nonempty Row, Column, and Symbol | |
Jaromy Kuhl, Michael W. Schroeder | P2.23 |
Variations on a theme of Kasteleyn, with Application to the Totally Nonnegative Grassmannian | |
David E Speyer | P2.24 |
Brick Manifolds and Toric Varieties of Brick Polytopes | |
Laura Escobar | P2.25 |
Neighborhood Complexes of Some Exponential Graphs | |
Nandini Nilakantan, Samir Shukla | P2.26 |
A Family of Symmetric Graphs with Complete Quotients | |
Teng Fang, Xin Gui Fang, Binzhou Xia, Sanming Zhou | P2.27 |
Combinatorics Meets Potential Theory | |
Philippe D'Arco, Valentina Lacivita, Sami Mustapha | P2.28 |
Extremal Graph for Intersecting Odd Cycles | |
Xinmin Hou, Yu Qiu, Boyuan Liu | P2.29 |
Turán Numbers for 3-Uniform Linear Paths of Length 3 | |
Eliza Jackowska, Joanna Polcyn, Andrzej Ruciński | P2.30 |
On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs | |
Jakub Przybyło | P2.31 |
On Ultralimits of Sparse Graph Classes | |
Michał Pilipczuk, Szymon Toruńczyk | P2.32 |
A Simple Existence Criterion for Normal Spanning Trees | |
Reinhard Diestel | P2.33 |
Chung-Feller Property of Schröder Objects | |
Youngja Park, Sangwook Kim | P2.34 |
A New Near Octagon and the Suzuki Tower | |
Anurag Bishnoi, Bart De Bruyn | P2.35 |
Some Probabilistic Trees with Algebraic Roots | |
Olivier Bernardi, Alejandro H. Morales | P2.36 |
0-Sum and 1-Sum Flows in Regular Graphs | |
S. Akbari, M. Kano, S. Zare | P2.37 |
A Combinatorial Approach to the $q,t$-Symmetry Relation in Macdonald Polynomials | |
Maria Monks Gillespie | P2.38 |
On Well-Covered, Vertex Decomposable and Cohen-Macaulay Graphs | |
Iván D. Castrillón, Roberto Cruz, Enrique Reyes | P2.39 |
Unimodality via Alternating Gamma Vectors | |
Charles Brittenham, Andrew T. Carroll, T. Kyle Petersen, Connor Thomas | P2.40 |
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$ | |
James Currie | P2.41 |
Embedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations | |
Amin Bahmanian, Mike Newman | P2.42 |
On Some Conjectures Concerning Critical Independent Sets of a Graph | |
Taylor Short | P2.43 |
Solutions to the T-Systems with Principal Coefficients | |
Panupong Vichitkunakorn | P2.44 |
Lower Bounds for Cover-Free Families | |
Ali Z. Abdi, Nader H. Bshouty | P2.45 |
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs | |
Patrick Bennett, Andrzej Dudek, Alan Frieze, Laars Helenius | P2.46 |
The Existence of a Maximal Green Sequence is not Invariant under Quiver Mutation | |
Greg Muller | P2.47 |
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs | |
Oliver Cooley, Mihyun Kang, Christoph Koch | P2.48 |
Unsplittable Classes of Separable Permutations | |
Michael Albert, Vít Jelínek | P2.49 |
Painting Squares in $\Delta^2-1$ Shades | |
Daniel W. Cranston, Landon Rabern | P2.50 |
2-Walk-Regular Dihedrants from Group-Divisible Designs | |
Zhi Qiao, Shao Fei Du, Jack H Koolen | P2.51 |
Modeling Limits in Hereditary Classes: Reduction and Application to Trees | |
Jaroslav Nešetřil, Patrice Ossona de Mendez | P2.52 |
Decompositions of the Boolean Lattice into Rank-symmetric Chains | |
István Tomon | P2.53 |
Distant Set Distinguishing Total Colourings of Graphs | |
Jakub Przybyło | P2.54 |
The Total Acquisition Number of Random Graphs | |
Deepak Bal, Patrick Bennett, Andrzej Dudek, Paweł Prałat | P2.55 |
ISSN: 1077-8926