Geodesic

Tome 24 (2017) no. 4

Sommaire

The gonality sequence of complete graphs
Minimum cuts of distance-regular digraphs
A major-index preserving map on fillings
Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
Disproof of a conjecture of Neumann-Lara
A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer
A short proof of Moll's minimal conjecture
Local resilience for squares of almost spanning cycles in sparse random graphs
Smaller subgraphs of minimum degree \(k\)
Fair representation in the intersection of two matroids
The universal Gröbner basis of a binomial edge ideal
On stacked triangulated manifolds
Longest monotone subsequences and rare regions of pattern-avoiding permutations
A chip-firing game on the product of two graphs and the tropical Picard group
Even cycles and even 2-factors in the line graph of a simple graph
Quantum walks on generalized quadrangles
Covers of D-type Artin groups
Matching and independence complexes related to small grids
Perfect matchings of trimmed Aztec rectangles
Linear chord diagrams with long chords
Large cuts with local algorithms on triangle-free graphs
Maximum size of a family of pairwise graph-different permutations
Cover \(k\)-uniform hypergraphs by monochromatic loose paths
Induced Ramsey-type results and binary predicates for point sets
Orbits of antichains in certain root posets
Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability
Eulerian polynomials, Stirling permutations of the second kind and perfect matchings
A step towards Yuzvinsky's conjecture
Neighborhood growth dynamics on the Hamming plane
Avoidability of formulas with two variables
Antimagic orientation of biregular bipartite graphs
A note on chromatic number and induced odd cycles
A cycle of maximum order in a graph of high minimum degree has a chord
On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
A Euclidean Ramsey result in the plane
Note on a Ramsey theorem for posets with linear extensions
Disjoint cycles of different lengths in graphs and digraphs
Self-avoiding walks and amenability
On the connectivity of graphs in association schemes
On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs