Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 22 (2015)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Periodic rigidity on a variable torus using inductive constructions
Anthony Nixon
;
Elissa Ross
Evaluating the numbers of some skew standard Young tableaux of truncated shapes
Ping Sun
Some enumerations on non-decreasing Dyck paths
Éva Czabarka
;
Rigoberto Flórez
;
Leandro Junes
Group homomorphisms as error correcting codes
Alan Guo
Vertically symmetric alternating sign matrices and a multivariate Laurent polynomial identity
Ilse Fischer
;
Lukas Riegler
On-line choice number of complete multipartite graphs: an algorithmic approach
Fei-Huang Chang
;
Hong-Bin Chen
;
Jun-Yi Guo
;
Yu-Pei Huang
On computing the degree of convexity of polyominoes
Stefano Brocchi
;
Giuseppa Castiglione
;
Paolo Massazza
The concavity and convexity of the Boros-Moll sequences
Ernest X.W. Xia
Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients
Quan-Hui Yang
Discrete Dirac operators, critical embeddings and Ihara-Selberg functions
Martin Loebl
;
Petr Somberg
Maximum 4-degenerate subgraph of a planar graph
Robert Lukot'ka
;
Ján Mazák
;
Xuding Zhu
Characterizations of regularity for certain \(Q\)-polynomial association schemes
Sho Suda
Spanning \(k\)-trees of bipartite graphs
Mikio Kano
;
Kenta Ozeki
;
Kazuhiro Suzuki
;
Masao Tsugaki
;
Tomoki Yamashita
Crossings and nestings for arc-coloured permutations and automation
Lily Yen
On-line Ramsey numbers of paths and cycles
Joanna Cyman
;
Tomasz Dzido
;
John Lapinskas
;
Allan Lo
On Keller's conjecture in dimension seven
Andrzej P. Kisielewicz
;
Magdalena Łysakowska
Brown's theorem and its application for enumeration of dissections and planar trees
Evgeniy Krasko
;
Alexander Omelchenko
Multiple coverings with closed polygons
István Kovács
;
Géza Tóth
On the codes related to the Higman-Sims graph
Wolfgang Knapp
;
Hans-Jörg Schaeffer
On a refinement of Wilf-equivalence for permutations
Sherry H.F. Yan
;
Huiyun Ge
;
Yaqiu Zhang
On commuting graphs for elements of order 3 in symmetric groups
Athirah Nawawi
;
Peter Rowley
A characterization of the Hermitian variety in finite 3-dimensional projective spaces
Vito Napolitano
Faster rumor spreading with multiple calls
Konstantinos Panagiotou
;
Ali Pourmiri
;
Thomas Sauerwald
Polygons as sections of higher-dimensional polytopes
Arnau Padrol
;
Julian Pfeifle
On a certain vector crank modulo 7
Michael D. Hirschhorn
;
Pee Choon Toh
Wieland drift for triangular fully packed loop configurations
Sabine Beil
;
Ilse Fischer
;
Philippe Nadeau
A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
Aline Parreau
;
Michel Rigo
;
Eric Rowland
;
Élise Vandomme
Density of Gallai multigraphs
Colton Magnant
Power of \(k\) choices and rainbow spanning trees in random graphs
Deepak Bal
;
Patrick Bennett
;
Alan Frieze
;
Paweł Prałat
Induced and non-induced forbidden subposet problems
Balázs Patkós
Maximal clades in random binary search trees
Svante Janson
An improved lower bound related to the Furstenberg-Sárközy theorem
Mark Lewko
Exchangeable pairs, switchings, and random regular graphs
Tobias Johnson
Between 2- and 3-colorability
Alan Frieze
;
Wesley Pegden
On limits of dense packing of equal spheres in a cube
Milos Tatarevic
Conditions for the parameters of the block graph of quasi-symmetric designs
Rajendra M. Pawale
;
Mohan S. Shrikhande
;
Shubhada M. Nyayate
Modular statistics for subgraph counts in sparse random graphs
Bobby DeMarco
;
Jeff Kahn
;
Amanda Redlich
A generalization of the \(k\)-bonacci sequence from Riordan arrays
José L. Ramírez
;
Víctor F. Sirvent
Leapfrog constructions: from continuant polynomials to permanents of matrices
Alberto Facchini
;
André Leroy
A note on Goldbach partitions of large even integers
Ljuben Mutafchiev
The maximum difference between the number of atoms and number of coatoms of a Bruhat interval of the symmetric group.
Emmanuel Tsukerman
Backward jeu de taquin slides for composition tableaux and a noncommutative Pieri rule
Vasu Tewari
Forcing finite minors in sparse infinite graphs by large-degree assumptions
Reinhard Diestel
On graph parameters guaranteeing fast sandpile diffusion
Ayush Choure
;
Sundar Vishwanathan
Some results on the structure of multipoles in the study of snarks
M. A. Fiol
;
J. Vilaltella
Bipartite graphs whose squares are not chromatic-choosable
Seog-Jin Kim
;
Boram Park
On Maltsev digraphs
Catarina Carvalho
;
Laszlo Egri
;
Marcel Jackson
;
Todd Niven
On the longest \(k\)-alternating subsequence
Igor Pak
;
Robin Pemantle
Characterisations of elementary pseudo-caps and good eggs
Sara Rottey
;
Geertrui Van de Voorde
Decomposing dense bipartite graphs into 4-cycles
Nicholas Cavenagh
Small snarks with large oddness
Robert Lukoťka
;
Edita Máčajová
;
Ján Mazák
;
Martin Škoviera
Asymptotic expansion of the multi-orientable random tensor model
Eric Fusy
;
Adrian Tanasa
Infinite gammoids
Seyed Hadi Afzali Borujeni
;
Hiu-Fai Law
;
Malte Müller
Gammoids, pseudomodularity and flatness degree
Jorge Alberto Olarte
On shuffling of infinite square-free words
Mike Müller
;
Svetlana Puzynina
;
Michaël Rao
Distributions defined by \(q\)-supernomials, fusion products, and Demazure modules
Stavros Kousidis
;
Ernst Schulte-Geers
Near-colorings: non-colorable graphs and NP-completeness
M. Montassier
;
P. Ochem
Ascent sequences avoiding pairs of patterns
Andrew M. Baxter
;
Lara K. Pudwell
Summation of rational series twisted by strongly \(B\)-multiplicative coefficients
Jean-Paul Allouche
;
Jonathan Sondow
Keeping avoider's graph almost acyclic
Dennis Clemens
;
Julia Ehrenmüller
;
Yury Person
;
Tuan Tran
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
Asaf Ferber
Lai's conditions for spanning and dominating closed trails
Wei-Guo Chen
;
Zhi-Hong Chen
;
Mei Lu
A criterion for a monomial ideal to have a linear resolution in characteristic 2
E. Connon
;
Sara Faridi
On the number of walks in a triangular domain
Paul R.G. Mortimer
;
Thomas Prellberg
Disjoint compatibility graph of non-crossing matchings of points in convex position
Oswin Aichholzer
;
Andrei Asinowski
;
Tillmann Miltzow
Sandpiles and dominos
Laura Florescu
;
Daniela Morar
;
David Perkinson
;
Nicholas Salter
;
Tianyuan Xu
Faces of Birkhoff polytopes
Andreas Paffenholz
A bijective proof of the Alladi-Andrews-Gordon partition theorem
James J.Y. Zhao
On the strength of connectedness of a random hypergraph
Daniel Poole
A de Bruijn-Erdős theorem for chordal graphs
Laurent Beaudou
;
Adrian Bondy
;
Xiaomin Chen
;
Ehsan Chiniforooshan
;
Maria Chudnovsky
;
Vašek Chvátal
;
Nicolas Fraiman
;
Yori Zwols
Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
Xiaolin Chen
;
Xueliang Li
;
Huishu Lian
A quantitative approach to perfect one-factorizations of complete bipartite graphs
Natacha Astromujoff
;
Martin Matamala
Crystal structure on rigged configurations and the filling map
Anne Schilling
;
Travis Scrimshaw
Heffter arrays and biembedding graphs on surfaces
Dan Archdeacon
Simplicial complexes of Whisker type
Mina Bigdeli
;
Jürgen Herzog
;
Takayuki Hibi
;
Antonio Macchia
Vertex-transitive digraphs of order \(p^5\) are Hamiltonian
Jun-Yang Zhang
Generalized cages
Marko Boben
;
Robert Jajcay
;
Tomaz Pisanski
The distinguishing index of infinite graphs
Izak Broere
;
Monika Pilśniak
Linear relations for a generalized Tutte polynomial
Gary Gordon
Most probably intersecting hypergraphs
Shagnik Das
;
Benny Sudakov
Maximal partial Latin cubes
Thomas Britz
;
Nicholas J. Cavenagh
;
Henrik Kragh Sørensen
On graphs having no flow roots in the interval \((1,2)\)
F.M. Dong
On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
Zoltán Lóránt Nagy
;
Balázs Patkós
A Deza-Frankl type theorem for set partitions
Cheng Yeaw Ku
;
Kok Bin Wong
Sommaire du
Fascicule no. 2
A note on coloring vertex-transitive graphs
Daniel W. Cranston
;
Landon Rabern
Equipopularity classes in the separable permutations
Michael Albert
;
Cheyne Homberger
;
Jay Pantone
Roudneff's conjecture for Lawrence oriented matroids
Luis Pedro Montejano
;
Jorge Luis Ramírez-Alfonsín
Young diagrams and intersection numbers for toric manifolds associated with Weyl chambers
Hiraku Abe
Permutations destroying arithmetic structure
Veselin Jungić
;
Julian Sahasrabudhe
Flag-transitive non-symmetric 2-designs with \((r,\lambda)=1\) and alternating socle
Shenglin Zhou
;
Yajie Wang
Power sum expansion of chromatic quasisymmetric functions
Christos A. Athanasiadis
Motzkin paths, Motzkin polynomials and recurrence relations
Roy Oste
;
Joris Van der Jeugt
From edge-coloring to strong edge-coloring
Valentin Borozan
;
Gerard Jennhwa Chang
;
Nathann Cohen
;
Shinya Fujita
;
Narayanan Narayanan
;
Reza Naserasr
;
Petru Valicov
A construction of small \((q-1)\)-regular graphs of girth 8
M. Abreu
;
G. Araujo-Pardo
;
C. Balbuena
;
D. Labbate
A generalization of Tokuyama's formula to the Hall-Littlewood polynomials
Vineet Gupta
;
Uma Roy
;
Roger Van Peski
A generalization of very odd sequences
Cheng Yeaw Ku
;
Kok Bin Wong
Sprague-Grundy values of the \(\mathcal{R}\)-Wythoff game
Albert Gu
Characterization of \((2m,m)\)-paintable graphs
Thomas Mahoney
;
Jixian Meng
;
Xuding Zhu
Locating-dominating sets and identifying codes in graphs of girth at least 5
Camino Balbuena
;
Florent Foucaud
;
Adriana Hansberg
Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
Murray Elder
;
Geoffrey Lee
;
Andrew Rechnitzer
Ehrhart series of polytopes related to symmetric doubly-stochastic matrices
Robert Davis
On modular \(k\)-free sets
Victor Lambert
Output sum of transducers: limiting distribution and periodic fluctuation
Clemens Heuberger
;
Sara Kropf
;
Helmut Prodinger
Well-quasi-order for permutation graphs omitting a path and a clique
Aistis Atminas
;
Robert Brignall
;
Nicholas Korpelainen
;
Vadim Lozin
;
Vincent Vatter
On the chromatic number of the Erdős-Rényi orthogonal polarity graph
Xing Peng
;
Michael Tait
;
Craig Timmons
Some combinatorial arrays related to the Lotka-Volterra system
David Callan
;
Shi-Mei Ma
;
Toufik Mansour
Biembeddings of 2-rotational Steiner triple systems
M. J. Grannell
;
J. Z. Schroeder
Hyperbinary expansions and Stern polynomials
Karl Dilcher
;
Larry Ericksen
Intersections of shifted sets
Mauro Di Nasso
Schubert calculus and the homology of the Peterson variety
Erik Insko
Cooperative colorings and independent systems of representatives
Ron Aharoni
;
Ron Holzman
;
David Howard
;
Philipp Sprüssel
On embeddings of circulant graphs
Marston Conder
;
Ricardo Grande
Extensions of infinite partition regular systems
Neil Hindman
;
Imre Leader
;
Dona Strauss
Fan-extensions in fragile matroids
Carolyn Chun
;
Deborah Chun
;
Dillon Mayhew
;
Stefan H. M. Van Zwam
When does the set of \((a, b, c)\)-core partitions have a unique maximal element?
Amol Aggarwal
Containment game played on random graphs: another zig-zag theorem
Paweł Prałat
On a generalization of Thue sequences
Jaka Kranjc
;
Borut Lužar
;
Martina Mockovčiaková
;
Roman Soták
Generating the cycle space of planar graphs
Matthias Hamann
Symmetric chain decompositions of quotients by wreath products.
Dwight Duffus
;
Kyle Thayer
The parametric Frobenius problem
Bjarke Hammersholt Roune
;
Kevin Woods
Nonexistence of a class of distance-regular graphs
Yu-pei Huang
;
Yeh-jong Pan
;
Chih-wen Weng
A generic method for bijections between blossoming trees and planar maps
Marie Albenque
;
Dominique Poulalhon
Thresholds and expectation-thresholds of monotone properties with small minterms
Ehud Friedgut
;
Jeff Kahn
;
Clara Shikhelman
SB-lattices, distributivity, and Bruhat order on sortable elements.
Henri Mühle
On-line list colouring of random graphs
Alan Frieze
;
Dieter Mitsche
;
Xavier Pérez-Giménez
;
Paweł Prałat
Tokuyama's identity for factorial Schur \(P\) and \(Q\) functions
Angèle M. Hamel
;
Ronald C. King
Wreath product action on generalized Boolean algebras
Ashish Mishra
;
Murali K. Srinivasan
Combinatorics of tableau inversions
Jonathan E. Beagley
;
Paul Drube
The complete \(\mathbf{cd}\)-index of Boolean lattices
Neil J.Y. Fan
;
Liao He
The degree-diameter problem for sparse graph classes
Guillermo Pineda-Villavicencio
;
David R. Wood
Contractible edges in 2-connected locally finite graphs
Tsz Lung Chan
A note on statistical averages for oscillating tableaux
Sam Hopkins
;
Ingrid Zhang
Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
Ferdinand Ihringer
The minimum size of signed sumsets
Béla Bajnok
;
Ryan Matzke
On the number of matroids compared to the number of sparse paving matroids
Rudi Pendavingh
;
Jorn van der Pol
A disproof of Tsallis' bond percolation threshold conjecture for the Kagome lattice
John C. Wierman
;
Gaoran Yu
;
Theodore Huang
Representing graphs via pattern avoiding words
Miles Jones
;
Sergey Kitaev
;
Artem Pyatkin
;
Jeffrey Remmel
Permutations on the random permutation
Julie Linman
;
Michael Pinsker
Interpreting the truncated pentagonal number theorem using partition pairs
Louis W. Kolitsch
;
Michael Burnette
Tiling groups with difference sets
Ante Ćustić
;
Vedran Krčadinac
;
Yue Zhou
The toggle group, homomesy, and the Razumov-Stroganov correspondence
Jessica Striker
On exponential growth of degrees
Yuval Roichman
Sommaire du
Fascicule no. 3
On obstacle numbers
Vida Dujmović
;
Pat Morin
On a conjecture of Thomassen
Michelle Delcourt
;
Asaf Ferber
Distinct parts partitions without sequences
Kathrin Bringmann
;
Karl Mahlburg
;
Karthik Nataraj
Homomesy in products of two chains
James Propp
;
Tom Roby
Small regular graphs of girth 7
M. Abreu
;
G. Araujo-Pardo
;
C. Balbuena
;
D. Labbate
;
J. Salas
Completing partial proper colorings using Hall's condition
Sarah Holliday
;
Jennifer Vandenbussche
;
Erik E Westlund
Acyclic subgraphs of planar digraphs
Noah Golowich
;
David Rolnick
Arithmetic properties of a restricted bipartition function
Jian Liu
;
Andrew Y.Z. Wang
Strong Turán stability
Mykhaylo Tyomkyn
;
Andrew J. Uzzell
Mutually unbiased bush-type Hadamard matrices and association schemes
Hadi Kharaghani
;
Sara Sasani
;
Sho Suda
New lower bounds for 28 classical Ramsey numbers
Geoffrey Exoo
;
Milos Tatarevic
Sign conjugacy classes of the symmetric groups.
Lucia Morotti
Forbidden triples generating a finite set of 3-connected graphs
Yoshimi Egawa
;
Jun Fujisawa
;
Michitaka Furuya
;
Michael D Plummer
;
Akira Saito
Generalized small Schröder numbers
JiSun Huh
;
SeungKyung Park
Rectangular symmetries for coefficients of symmetric functions
Emmanuel Briand
;
Rosa Orellana
;
Mercedes Rosas
On the density of certain languages with \(p^2\) letters
Carlos Segovia
;
Monika Winklmeier
Overpartitions with restricted odd differences
Kathrin Bringmann
;
Jehanne Dousse
;
Jeremy Lovejoy
;
Karl Mahlburg
Local fusion graphs and sporadic simple groups.
John Ballantyne
;
Peter Rowley
A relationship between generalized Davenport-Schinzel sequences and interval chains
Jesse Geneson
Absolute differences along Hamiltonian paths
Francesco Monopoli
Closing the gap on path-kipas Ramsey numbers
Binlong Li
;
Yanbo Zhang
;
Halina Bielak
;
Hajo Broersma
;
Premek Holub
Nondeterministic automatic complexity of overlap-free and almost square-free words
Kayleigh K. Hyde
;
Bjørn Kjos-Hanssen
Zeros of Jones polynomials of graphs
Fengming Dong
;
Xian'an Jin
On the largest component of a hyperbolic model of complex networks
Michel Bode
;
Nikolaos Fountoulakis
;
Tobias Müller
On edge-transitive graphs of square-free order
Cai Heng Li
;
Zai Ping Lu
;
Gai Xia Wang
Linear transformations preserving the strong \(q\)-log-convexity of polynomials
Bao-Xuan Zhu
;
Hua Sun
Connectivity of some algebraically defined digraphs
Aleksandr Kodess
;
Felix Lazebnik
Weight of 3-paths in sparse plane graphs
V. A. Aksenov
;
O. V. Borodin
;
A. O. Ivanova
On the game domination number of graphs with given minimum degree
Csilla Bujtás
The covering problem in Rosenbloom-Tsfasman spaces
André G. Castoldi
;
Emerson L. Monte Carmelo
Covering partial cubes with zones
Jean Cardinal
;
Stefan Felsner
Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method
Joy Morris
;
Pablo Spiga
;
Gabriel Verret
Generalized line graphs: Cartesian products and complexity of recognition
Aparna Lakshmanan S.
;
Csilla Bujtás
;
Zsolt Tuza
Regular graphs are antimagic
Kristóf Bérczi
;
Attila Bernáth
;
Máté Vizer
Bessenrodt-Stanley polynomials and the octahedron recurrence
Philippe Di Francesco
Locally oriented noncrossing trees
Isaac Owino Okoth
;
Stephan Wagner
Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
J. Fernando Barbero G.
;
Jesús Salas
;
Eduardo J.S. Villaseñor
Vizing's conjecture for graphs with domination number 3 -- a new proof
Boštjan Brešar
Finding domatic partitions in infinite graphs
Matthew Jura
;
Oscar Levin
;
Tyler Markkanen
Iterative properties of birational rowmotion. II: Rectangles and triangles.
Darij Grinberg
;
Tom Roby
Partial list colouring of certain graphs
Jeannette Janssen
;
Rogers Mathew
;
Deepak Rajendraprasad
A remark on the tournament game
Dennis Clemens
;
Mirjana Mikalački
Genus ranges of 4-regular rigid vertex graphs
Dorothy Buck
;
Egor Dolzhenko
;
Natasa Jonoska
;
Masahico Saito
;
Karin Valencia
Sommaire du
Fascicule no. 4
The spectrum for 3-way \(k\)-homogeneous Latin trades
Trent G. Marbach
;
Lijun Ji
Genus of the Cartesian product of triangles
Michal Kotrbčík
;
Tomaž Pisanski
An exact Turán result for tripartite 3-graphs
Adam Sanitt
;
John Talbot
The Page-Rényi parking process
Lucas Gerin
Bounding tree-width via contraction on the projective plane and torus
Evan Morgan
;
Bogdan Oporowski
Identifying codes in vertex-transitive graphs and strongly regular graphs
Sylvain Gravier
;
Aline Parreau
;
Sara Rottey
;
Leo Storme
;
Élise Vandomme
A generalization of Graham's conjecture
Huanhuan Guan
;
Pingzhi Yuan
;
Xiangneng Zeng
HOMFLY polynomials of torus links as generalized Fibonacci polynomials
Kemal Taşköprü
;
İsmet Altıntaş
Random-player maker-breaker games
Michael Krivelevich
;
Gal Kronenberg
Walks, partitions, and normal ordering
Askar Dzhumadil'daev
;
Damir Yeliussizov
Fractional coloring of triangle-free planar graphs
Zdeněk Dvořák
;
Jean-Sébastien Sereni
;
Jan Volec
On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations
Philip B. Zhang
Wilf-classification of mesh patterns of short length
Ísak Hilmarsson
;
Ingibjörg Jónsdóttir
;
Steinunn Sigurðardóttir
;
Lína Viðarsdóttir
;
Henning Ulfarsson
Thin edges in braces
Cláudio L. Lucchesi
;
Marcelo H. de Carvalho
;
U. S. R. Murty
The maximal length of a gap between \(r\)-graph Turán densities
Oleg Pikhurko
Overview on Heisenberg-Weyl algebra and subsets of Riordan subgroups
Silvia Goodenough
;
Christian Lavault
Rank and crank analogs for some colored partitions
Roberta R. Zhou
;
Wenlong Zhang
\(h\)-polynomials via reduced forms
Karola Meszaros
Local finiteness, distinguishing numbers, and Tucker's conjecture
Florian Lehner
;
Rögnvaldur G. Möller
Reconstructing permutations from identification minors
Erkko Lehtonen
Normally regular digraphs
Leif K Jørgensen
Enumeration of Lozenge tilings of halved hexagons with a boundary defect
Ranjan Rohatgi
Words with many palindrome pair factors
Adam Borchert
;
Narad Rampersad
Clustered planarity testing revisited
Radoslav Fulek
;
Jan Kynčl
;
Igor Malinović
;
Dömötör Pálvölgyi
Cataloguing PL 4-manifolds by gem-complexity
Maria Rita Casali
;
Paola Cristofori
A linear bound towards the traceability conjecture
Susan A. van Aardt
;
Jean E. Dunbar
;
Marietjie Frick
;
Nicolas Lichiardopol
On generalizations of the Petersen graph and the Coxeter graph
Marko Orel
Inversion formulae on permutations avoiding 321
Pingge Chen
;
Zhousheng Mei
;
Suijie Wang
Exact forbidden subposet results using chain decompositions of the cycle
Abhishek Methuku
;
Casey Tompkins
Extended formulation for CSP that is compact for instances of bounded treewidth
Petr Kolman
;
Martin Koutecký
Digraph representations of 2-closed permutation groups with a normal regular cyclic subgroup
Jing Xu
Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration
Boris L. Granovsky
;
Dudley Stark
On the existence of certain optimal self-dual codes with lengths between 74 and 116
Tao Zhang
;
Jerod Michel
;
Tao Feng
;
Gennian Ge
Semi-degree threshold for anti-directed Hamiltonian cycles
Louis DeBiasio
;
Theodore Molla
Applications of integer programming methods to cages
Frans J.C.T. de Ruiter
;
Norman L. Biggs
Lifespan in a primitive Boolean linear dynamical system
Yaokun Wu
;
Yinfeng Zhu
Infinite gammoids: minors and duality
Seyed Hadi Afzali Borujeni
;
Hiu-Fai Law
;
Malte Müller
Greatest descents after any maxima in compositions
Margaret Archibald
;
Aubrey Blecher
;
Charlotte Brennan
;
Arnold Knopfmacher
Permutations destroying arithmetic progressions in finite cyclic groups
Peter Hegarty
;
Anders Martinsson
Counting invertible Schrödinger operators over finite fields for trees, cycles and complete graphs
Roland Bacher
Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
Rafael Plaza
Stirling permutations, cycle structure of permutations and perfect matchings
Shi-Mei Ma
;
Yeong-Nan Yeh
Tropical linear spaces and tropical convexity
Simon Hampe
Cluster algebras of type \(D\): pseudotriangulations approach
Cesar Ceballos
;
Vincent Pilaud
A general theory of Wilf-equivalence for Catalan structures
Michael Albert
;
Mathilde Bouvel
A Cambrian framework for the oriented cycle
Nathan Reading
;
David E Speyer
On relative \(t\)-designs in polynomial association schemes
Eiichi Bannai
;
Etsuko Bannai
;
Sho Suda
;
Hajime Tanaka
Universal and near-universal cycles of set partitions
Zach Higgins
;
Elizabeth Kelley
;
Bertilla Sieben
;
Anant Godbole