Table of Contents
Papers
Maximum Planar Subgraphs in Dense Graphs | |
Peter Allen, Jozef Skokan, Andreas Würfl | P1 |
Gromov Hyperbolicity in Strong Product Graphs | |
Walter Carballosa, Rocío M. Casablanca, Amauris de la Cruz, José M. Rodríguez | P2 |
Degree Distribution of an Inhomogeneous Random Intersection Graph | |
Mindaugas Bloznelis, Julius Damarackas | P3 |
Limits of Modified Higher $q,t$-Catalan Numbers | |
Kyungyong Lee, Li Li, Nicholas A Loehr | P4 |
Recognition and Characterization of Chronological Interval Digraphs | |
Sandip Das, Mathew Francis, Pavol Hell, Jing Huang | P5 |
A Bound on Permutation Codes | |
Jürgen Bierbrauer, Klaus Metsch | P6 |
An Identity Conjectured by Lacasse via the Tree Function | |
Helmut Prodinger | P7 |
$(2,m,n)$-groups with Euler characteristic equal to $-2^as^b$ | |
Nick Gill | P8 |
Geometric Constructions for Symmetric 3-Configurations | |
Leah Wrenn Berman | P9 |
On the Independence Numbers of the Cubes of Odd Cycles | |
Tom Bohman, Ron Holzman, Venkatesh Natarajan | P10 |
Extensions to $2$-Factors in Bipartite Graphs | |
Jennifer Vandenbussche, Douglas B. West | P11 |
A Plethysm Formula on the Characteristic Map of Induced Linear Characters from $U_n(\mathbb F_q)$ to $GL(\mathbb F_q)$ | |
Zhi Chen | P12 |
The Number of Euler Tours of Random Directed Graphs | |
Páidí Creed, Mary Cryan | P13 |
Generalized Permutohedra, h-Vectors of Cotransversal Matroids and Pure O-Sequences | |
Suho Oh | P14 |
Balanced Vertex Decomposable Simplicial Complexes and their h-vectors | |
Jennifer Biermann, Adam Van Tuyl | P15 |
Symmetry in Gardens of Eden | |
Christiaan Hartman, Marijn J. H. Heule, Kees Kwekkeboom, Alain Noels | P16 |
Eigenvalue Pairing in the Response Matrix for a Class of Network Models with Circular Symmetry | |
Miriam Farber, Charles R Johnson, Wei Zhen | P17 |
A Characterization of Graphs by Codes from their Incidence Matrices | |
Peter Dankelmann, Jennifer D. Key, Bernardo G. Rodrigues | P18 |
An Inhomogeneous Lambda-Determinant | |
Philippe Di Francesco | P19 |
Regularity of Join-meet Ideals of Distributive Lattices | |
Viviana Ene, Ayesha Asloob Qureshi, Asia Rauf | P20 |
The Spectral Excess Theorem for Distance-Biregular Graphs. | |
Miquel Àngel Fiol | P21 |
The Combinatorics of Interval Vector Polytopes | |
Matthias Beck, Jessica De Silva, Gabriel Dorfsman-Hopkins, Joseph Pruitt, Amanda Ruiz | P22 |
Can Colour-Blind Distinguish Colour Palettes? | |
Rafał Kalinowski, Monika Pilśniak, Jakub Przybyło, Mariusz Woźniak | P23 |
Embedding Cycles in Finite Planes | |
Felix Lazebnik, Keith E. Mellinger, Oscar Vega | P24 |
A Note on Total and Paired Domination of Cartesian Product Graphs | |
K. Choudhary, S. Margulies, I. V. Hicks | P25 |
The Edit Distance Function and Symmetrization | |
Ryan R. Martin | P26 |
The Adjacency Matroid of a Graph | |
Lorenzo Traldi, Robert Brijder, Hendrik Jan Hoogeboom | P27 |
Greedy Trees, Subtrees and Antichains | |
Eric Ould Dadah Andriantiana, Stephan Wagner, Hua Wang | P28 |
Medial Symmetry Type Graphs | |
Isabel Hubard, María del Río Francos, Alen Orbanić, Tomaž Pisanski | P29 |
On Sumsets of Multisets in $\mathbb{Z}_p^m$ | |
Kaisa Matomäki | P30 |
Knots in Collapsible and Non-Collapsible Balls | |
Bruno Benedetti, Frank H. Lutz | P31 |
Upper-Bounding the $k$-Colorability Threshold by Counting Covers | |
Amin Coja-Oghlan | P32 |
Involutions on Standard Young Tableaux and Divisors on Metric Graphs | |
Rohit Agrawal, Gregg Musiker, Vladimir Sotirov, Fan Wei | P33 |
Symmetric Polynomials and Symmetric Mean Inequalities | |
Karl Mahlburg, Clifford Smyth | P34 |
Integral Circulant Ramanujan Graphs of Prime Power Order | |
T. A. Le, J. W. Sander | P35 |
On the Size of Kakeya Sets in Finite Vector Spaces | |
Gohar Kyureghyan, Peter Müller, Qi Wang | P36 |
Coloring 2-Intersecting Hypergraphs | |
Lucas Colucci, András Gyárfás | P37 |
Intersecting $k$-Uniform Families Containing all the $k$-Subsets of a Given Set | |
Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih | P38 |
New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix | |
Pawel Wocjan, Clive Elphick | P39 |
On the Relationship between Pipe Dreams and Permutation Words | |
Cameron Marcott | P40 |
From Heaps of Matches to the Limits of Computability | |
Urban Larsson, Johan Wästlund | P41 |
Product Dimension of Forests and Bounded Treewidth Graphs | |
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma | P42 |
Enumerating Finite Racks, Quandles and Kei | |
Simon R. Blackburn | P43 |
Shattering, Graph Orientations, and Connectivity | |
László Kozma, Shay Moran | P44 |
Delay Colourings of Cubic Graphs | |
Agelos Georgakopoulos | P45 |
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number | |
Karen L. Collins, Ann Trenk | P46 |
Self-Avoiding Walks and the Fisher Transformation | |
Geoffrey Grimmett, Zhongyang Li | P47 |
Oriented Hypergraphs: Introduction and Balance | |
Lucas J. Rusnak | P48 |
The Size of Edge-critical Uniquely 3-Colorable Planar Graphs | |
Naoki Matsumoto | P49 |
A New Statistic on the Hyperoctahedral Groups | |
Alexander Stasinski, Christopher Voll | P50 |
Chains of Length 2 in Fillings of Layer Polyominoes | |
Mitch Phillipson, Catherine H. Yan, Jean Yeh | P51 |
A Note on the Acquaintance Time of Random Graphs | |
William B. Kinnersley, Dieter Mitsche, Paweł Prałat | P52 |
Linked Partitions and Permutation Tableaux | |
William Y.C. Chen, Lewis H. Liu, Carol J. Wang | P53 |
Rational Associahedra and Noncrossing Partitions | |
Drew Armstrong, Brendon Rhoades, Nathan Williams | P54 |
A Note on Forbidding Clique Immersions | |
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide | P55 |
Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters | |
Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben | P56 |
On the Characteristic Polynomial of $n$-Cayley Digraphs | |
Majid Arezoomand, Bijan Taeri | P57 |
On Wilf Equivalence for Alternating Permutations | |
Sherry H.F. Yan | P58 |
The Range of a Random Walk on a Comb | |
János Pach, Gábor Tardos | P59 |
ISSN: 1077-8926