Geodesic

Tome 7 (2000)

Sommaire

On the twin designs with the Ionin-type parameters
Resolving triple systems into regular configurations
Diagonal checker-jumping and Eulerian numbers for color-signed permutations
Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture
Where the typical set partitions meet and join
A note on symmetric powers of the standard representation of \(S_n\)
Online coloring known graphs
Random sampling of labeled tournaments
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
Evolutionary families of sets
Linear codes over finite chain rings
The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
Some pairwise balanced designs
Parity systems and the delta-matroid intersection problem
Low rank co-diagonal matrices and Ramsey graphs
Interchangeability of relevant cycles in graphs
Restricted permutations, continued fractions, and Chebyshev polynomials
Constrainted graph processes
A note on sparse random graphs and cover graphs
Composition sum identities related to the distribution of coordinate values in a discrete simplex
Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
The strongly regular (40, 12, 2, 4) graphs
The action of the symmetric group on a generalized partition semilattice
A short proof of a partion relation for triples
Trees and matchings
min-wise independent linear permutations
Bijections for hook pair identities
Harmonic functions on multiplicative graphs and interpolation polynomials
A note on the non-colorability threshold of a random graph
A note on the number of \((k,l)\)-sum-free sets
Separability number and Schurity number of coherent configurations
Symmetric sum-free partitions and lower bounds for Schur numbers
Asymptotics for the probability of connectedness and the distribution of number of components
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
Some bijective correspondences involving domino tableaux
When structures are almost surely connected
A large dihedral symmetry of the set of alternating sign matrices
Automorphisms and enumeration of switching classes of tournaments
A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large
Counting lattice paths by Narayana polynomials
A note on random minimum length spanning trees
The Hamiltonian \(p\)-median problem
Bound graph polysemy
Tournament sequences and Meeussen sequences
Continued fractions and Catalan problems
Improving dense packings of equal disks in a square
A Turán type problem concerning the powers of the degrees of a graph
Linear discrepancy of basic totally unimodular matrices
Two new extensions of the Hales-Jewett theorem
An asymptotic expansion for the number of permutations with a certain number of inversions
A quasi-spectral characterization of strongly distance-regular graphs
A Ramsey treatment of symmetry
A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions
Franklin's argument proves an identity of Zagier
Large equiangular sets of lines in euclidean space
Frequency squares and affine designs
On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
On descents in standard Young tableaux
Colouring planar mixed hypergraphs
Determinantal expression and recursion for Jack polynomials
An infinite antichain of permutations
Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
An inequality related to Vizing's conjecture
A construction method for complete sets of mutually orthogonal frequency squares
A determinant of the Chudnovskys generalizing the elliptic Frobenius-Stickelberger-Cauchy determinantal identity