Geodesic

Tome 20 (2013) no. 1

Sommaire

Distance-regular graphs with a relatively small eigenvalue multiplicity
Ramsey properties of permutations
T-systems with boundaries from network solutions
Hom complexes of set systems
Forbidden submatrices: some new bounds and constructions
Covering \(n\)-permutations with \((n+1)\)-permutations
Statistical distributions and \(q\)-analogues of \(k\)-Fibonacci numbers
Pattern popularity in 132-avoiding permutations
Products and sums divisible by central binomial coefficients
Colourful theorems and indices of homomorphism complexes
A family of two-variable derivative polynomials for tangent and secant
The Ramsey number of loose paths in 3-uniform hypergraphs
The maximal number of runs in standard Sturmian words
On the Sprague-Grundy values of the \(\mathcal{F}\)-Wythoff game
Scattered linear sets and pseudoreguli
Towards random uniform sampling of bipartite graphs with given degree sequence
Cross-intersecting families of labeled sets
Monochromatic path and cycle partitions in hypergraphs
Graphs with large distinguishing chromatic number
The Canada day theorem
Nonconvexity of the set of hypergraph degree sequences
The prime stems of rooted circuits of closure spaces and minimum implicational bases
The distinguishing chromatic number of Kneser graphs
On a class of highly symmetric \(k\)-factorizations
Finding a princess in a palace: a pursuit-evasion problem
Extremal hypergraphs for the biased Erdős-Selfridge theorem
A new determinant expression for the weighted Bartholdi zeta function of a digraph
Generalized pattern frequency in large permutations
Integral Cayley graphs generated by distance sets in vector spaces over finite fields
New computational upper bounds for Ramsey numbers \(R(3,k)\)
Biologically unavoidable sequences
Families that remain \(k\)-Sperner even after omitting an element of their ground set
New approach to the \(k\)-independence number of a graph
Partitions and compositions over finite fields
Extremal graphs having no stable cutset
Arc-transitive pentavalent graphs of order 4\(pq\)
Multiple Petersen subdivisions in permutation graphs
Inequivalence of difference sets: on a remark of Baumert
Common edges in rooted trees and polygonal triangulations
Decomposing sets of inversions
Properties of the corolla polynomial of a 3-regular graph
Lehmer's conjecture for Hermitian matrices over the Eisenstein and Gaussian integers
Optimization problems over unit-distance representations of graphs
Induced subarrays of Latin squares without repeated symbols
Galkin quandles, pointed abelian groups, and sequence A000712
Enumeration of unlabeled directed hypergraphs
Residue reduced form of a rational function as an iterated Laurent series
On the binomial edge ideal of a pair of graphs
Toward a graph version of Rado's theorem
Ramsey properties of countably infinite partial orderings
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
Some remarks on the joint distribution of descents and inverse descents
Edge-disjoint induced subgraphs with given minimum degree
Combinatorial tilings of the sphere by pentagons
On some generalized \(q\)-Eulerian polynomials
A family of half-transitive graphs
On perfect packings in dense graphs
Perfect 1-factorisations of circulants with small degree
An iterative approach to the traceability conjecture for oriented graphs
Matchings in random biregular bipartite graphs
Making a graph crossing-critical by multiplying its edges
Edge regular graph products
An involution proof of the Alladi-Gordon key identity for Schur's partition theorem
Upper bounds for perfect matchings in Pfaffian and planar graphs
Extremal graphs for blow-ups of cycles and trees
Hamiltonicity of cubic 3-connected \(k\)-Halin graphs
Extremal values of ratios: distance problems vs. subtree problems in trees
On some small classical Ramsey numbers
Symmetry breaking in tournaments
Graph labelings and continuous factors of dynamical systems
Biregular cages of girth five
Enumeration of (16,4,16,4) relative difference sets
Stirling numbers of forests and cycles
The cost of 2-distinguishing Cartesian powers
Nonexistence of almost Moore digraphs of diameter four
On 021-avoiding ascent sequences