Geodesic

Tome 4 (1997) no. 1

Sommaire

Packing graphs: The packing problem solved
On primitive 3-smooth partitions of \(n\).
The fraction of subspaces of \(\text{GF}(q)^ n\) with a specified number of minimal weight vectors is asymptotically Poisson
Colored partitions and a generalization of the braid arrangement
Affine permutations and inversion multigraphs
Codes, lattices, and Steiner systems
Disconnected vertex sets and equidistant code pairs
Fruit salad
Union of all the minimum cycle bases of a graph
Efficient covering designs of the complete graph
On random greedy triangle packing
Short certificates for tournaments
A \(\beta\) invariant for greedoids and antimatroids
A plethysm formula for \(p_ \mu(\underline x)\circ h_ \lambda(\underline x)\)
Magic \(N\)-cubes form a free monoid
A matrix dynamics approach to Golomb's recursion
Analysis of an asymmetric leader election algorithm
Threshold functions for the bipartite Turán property
On the function ``sandwiched'' between \(\alpha(G)\) and \(\bar\chi (G)\)
Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
Some applications of the proper and adjacency polynomials in the theory of graph spectra
Asymptotics of Young diagrams and hook numbers
Limit probabilities for random sparse bit strings
Hook lengths in a skew Young diagram
An exact performance bound for an \(O(m+n)\) time greedy matching procedure
Tight upper bounds for the domination numbers of graphs with given order and minimum degree
Determinant identities and a generalization of the number of totally symmetric self-complementary plane partitions
Frankl-Füredi Type Inequalities for Polynomial Semi-lattices
Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
An eigenvalue characterization of antipodal distance-regular graphs