Geodesic

Tome 8 (2001) no. 1

Sommaire

Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
On Catalan trees and the Jacobian conjecture
A unified view of determinantal expansions for Jack polynomials
Small forbidden configurations. II
Product of integers in an interval, modulo squares
On the upper and lower chromatic numbers of BSQSs(16)
How to find overfull subgraphs in graphs with large maximum degree. II
A note on the Glauber dynamics for sampling independent sets
On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
The skeleton of a reduced word and a correspondence of Edelman and Green
Dumont's statistic on words
Applying balanced generalized weighing matrices to construct block designs
Guessing secrets
Parking functions, empirical processes, and the width of rooted labeled trees
Meet and join within the lattice of set partitions
Bijective proofs for Schur function identities which imply Dodgson's condensation formula and Plücker relations
Asymptotic bounds for bipartite Ramsey numbers
A reciprocity theorem for domino tilings
On a multiplicative partition function
Nowhere-zero \(k\)-flows of supergraphs
A color-to-spin domino Schensted algorithm
On coset coverings of solutions of homogeneous cubic equations over finite fields
The rectilinear crossing number of \(K_{10}\) is 62
Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs
Circular chromatic number of planar graphs of large odd girth
Recognizing circulant graphs in polynomial time: An application of association schemes
A one-sided Zimin construction
The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks
Values of domination numbers of the queen's graph
An extension of a criterion for unimodality
Towards a Katona type proof for the \(2\)-intersecting Erdős-Ko-Rado theorem
An analogue of covering space theory for ranked posets
Spanning trees of bounded degree
The arc-width of a graph
On planar mixed hypergraphs
From a polynomial Riemann hypothesis to alternating sign matrices
On the domination number of a random graph
Asymptotically optimal tree-packings in regular graphs
General bounds for identifying codes in some infinite regular graphs
An area-to-inv bijection between Dyck paths and 312-avoiding permutations
All regular multigraphs of even order and high degree are 1-factorable
Diagonal sums of boxed plane partitions
Weakly self-avoiding words and a construction of Friedman
Gaps in the chromatic spectrum of face-constrained plane graphs
The multiplicities of a dual-thin \(Q\)-polynomial association scheme
A note on the ranks of set-inclusion matrices
Queens on non-square tori
The polynomial part of a restricted partition function related to the Frobenius problem
About division by 1
A lower bound for the number of edges in a graph containing no two cycles of the same length
Some aspects of Hankel matrices in coding theory and combinatorics