Geodesic

Tome 28 (2021) no. 1

Sommaire

Extremal trees with fixed degree sequence
Conditions for a bigraph to be super-cyclic
On the spectra of general random mixed graphs
Avoidability of palindrome patterns
The component counts of random injections
A polynomial time algorithm to find the star chromatic index of trees
Extending perfect matchings to Hamiltonian cycles in line graphs
Display sets of normal and tree-child networks
Hirzebruch-type inequalities viewed as tools in combinatorics
Monochromatic components in edge-coloured graphs with large minimum degree
Non-separating planar graphs
Root cones and the resonance arrangement
On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
Circuit covers of signed Eulerian graphs
Classifications of \(\Gamma\)-colored \(d\)-complete posets and upper \(P\)-minuscule Borel representations
The non-commuting, non-generating graph of a nilpotent group
Birational rowmotion and Coxeter-motion on minuscule posets
Towards degree distribution of a duplication-divergence graph model
Graphs with no induced \(K_{2,t}\)
Minimum-weight combinatorial structures under random cost-constraints
The threshold for the full perfect matching color profile in a random coloring of random graphs
A randomly weighted minimum spanning tree with a random cost constraint
All minor-minimal apex obstructions with connectivity two
Limit densities of patterns in permutation inflations
The \(k\)-cut model in deterministic and random trees
Many cliques with few edges
Prisoners, rooms, and light switches
Domino tilings of cylinders: connected components under flips and normal distribution of the twist
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
An introduction to supersymmetric cluster algebras
The smallest matroids with no large independent flat
Inequalities for doubly nonnegative functions
The size of the giant joint component in a binomial random double graph
Coloring the \(n\)-smooth numbers with \(n\) colors
Cycle decompositions of complete digraphs
Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
Refined counting of core partitions into \(d\)-distinct parts
De Finetti lattices and magog triangles
Classification of toric log del Pezzo surfaces with few singular points
Supersaturation, counting, and randomness in forbidden subposet problems
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
On prime-valent symmetric Cayley graphs of finite simple groups
On the strong Hanani-Tutte theorem
Largest component and node fault tolerance for grids
Algebraic properties of the coordinate ring of a convex polyomino
On Ramsey-minimal infinite graphs
On the combinatorics of symmetrized poly-Bernoulli numbers
Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
Determining the circular flow number of a cubic graph
Regularity and the Gorenstein property of \(L\)-convex polyominoes
Shannon capacity and the categorical product
Generalized Catalan numbers from hypergraphs
Skeleton ideals of certain graphs, standard monomials and spherical parking functions
\(k\)-pop stack sortable permutations and \(2\)-avoidance
Induced Ramsey number for a star versus a fixed graph
Symmetric polynomials in the symplectic alphabet and the change of variables \(z_j = x_j + x_j^{-1}\)
On self-Mullineux and self-conjugate partitions
The Sprague-Grundy functions of saturations of misère Nim
On the maximum number of integer colourings with forbidden monochromatic sums
Some instances of homomesy among ideals of posets