Geodesic

Holes in graphs
A Specht module analog for the rook monoid
On the number of permutations admitting an \(m\)th root
Relaxed graceful labellings of trees
On packing densities of permutations
New lower bounds for Heilbronn numbers
Minimum connected dominating sets of random cubic graphs
Set-systems with restricted multiple intersections
Computation of the vertex Folkman numbers \(F(2,2,2,4;6)\) and \(F(2,3,4;6)\)
Generating a random sink-free orientation in quadratic time
Identifying codes with small radius in some infinite regular graphs
A generalization of transversals for Latin squares
New lower bound formulas for multicolored Ramsey numbers
Efficient packing of unit squares in a square
On the orbits of Singer groups and their subgroups
The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order
Combinatorial Laplacian of the matching complex
A `nice' bijection for a content formula for skew semistandard Young tableaux
MacWilliams identities and matroid polynomials
Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption
On counting permutations by pairs of congruence classes of major index
Triangle free sets and arithmetic progressions---two Pisier type problems
On recursively directed hypercubes
On the number of distributive lattices
Computation in Coxeter groups. I: Multiplication
Compositions of random functions on a finite set
Sparse graphs usually have exponentially many optimal colorings
Non-repetitive tilings
Kasteleyn cokernels
On the dimer problem and the Ising problem in finite \(3\)-dimensional lattices
A prolific construction of strongly regular graphs with the \(n\)-e. c. property
On the excluded minors for matroids of branch-width three
Catalan traffic at the beach
Spanning trees and function classes
Toida's conjecture is true
Bitableaux bases for some Garsia-Haiman modules and other related modules
Graph color extensions: When Hadwiger's conjecture and embeddings help
On the connectivity of graphs embedded in surfaces. II
Linearly independent products of rectangularly complementary Schur functions
Map genus, forbidden maps, and monadic second-order logic
Ternary constant weight codes
Generalizing the Ramsey problem through diameter
The number of labeled 2-connected planar graphs
Thue-like sequences and rainbow arithmetic progressions
A density result for random sparse oriented graphs and its relation to a conjecture of Woodall
A note on odd cycle-complete graph Ramsey numbers
Cycle index, weight enumerator, and Tutte polynomial
A small trivalent graph of girth 14
A proof of the two-path conjecture
A concise proof of the Littlewood-Richardson rule
A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
Parking functions of types A and B
Sum list coloring \(2\times n\) arrays
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
Irreducible coverings by cliques and Sperner's theorem

Sommaire du Fascicule no. 2

Permutation Patterns

The packing density of other layered permutations
Homogeneous permutations
Words restricted by patterns with at most 2 distinct letters
The minimum number of monotone subsequences
321-polygon-avoiding permutations and Chebyshev polynomials
Permutations avoiding two patterns of length three
Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
On the diagram of Schröder permutations
Sorting with a forklift
On growth rates of closed permutation classes
Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph
Longest increasing subsequences in pattern-restricted permutations
Counting 1324-avoiding permutations
A generalization of Simion-Schmidt's bijection for restricted permutations
Motzkin paths and reduced decompositions for permutations with forbidden patterns
Prefix exchanging and pattern avoidance by involutions
Profile classes and partial well-order for permutations
Pattern avoidance in permutations: Linear and cyclic orders
Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
Packing patterns into words
A survey of stack-sorting disciplines