Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 20 (2013)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Distance-regular graphs with a relatively small eigenvalue multiplicity
Jack H. Koolen
;
Joohyung Kim
;
Jongyook Park
Ramsey properties of permutations
Julia Böttcher
;
Jan Foniok
T-systems with boundaries from network solutions
Philippe Di Francesco
;
Rinat Kedem
Hom complexes of set systems
Jakob Jonsson
Forbidden submatrices: some new bounds and constructions
R.P. Anstee
;
Ruiyuan Chen
Covering \(n\)-permutations with \((n+1)\)-permutations
Taylor F Allison
;
Anant P Godbole
;
Kathryn M Hawley
;
Bill Kay
Statistical distributions and \(q\)-analogues of \(k\)-Fibonacci numbers
Adam M Goyt
;
Brady L Keller
;
Jonathan E Rue
Pattern popularity in 132-avoiding permutations
Kate Rudolph
Products and sums divisible by central binomial coefficients
Zhi-Wei Sun
Colourful theorems and indices of homomorphism complexes
Gábor Simonyi
;
Claude Tardif
;
Ambrus Zsbán
A family of two-variable derivative polynomials for tangent and secant
Shi-Mei Ma
The Ramsey number of loose paths in 3-uniform hypergraphs
Leila Maherani
;
Gholam Reza Omidi
;
Ghaffar Raeisi
;
Maryam Shahsiah
The maximal number of runs in standard Sturmian words
Paweł Baturo
;
Marcin Piątkowski
;
Wojciech Rytter
On the Sprague-Grundy values of the \(\mathcal{F}\)-Wythoff game
Yang Jiao
Scattered linear sets and pseudoreguli
Michel Lavrauw
;
Geertrui Van de Voorde
Towards random uniform sampling of bipartite graphs with given degree sequence
István Miklós
;
Péter L Erdős
;
Lajos Soukup
Cross-intersecting families of labeled sets
Huajun Zhang
Monochromatic path and cycle partitions in hypergraphs
András Gyárfás
;
Gábor N. Sárközy
Graphs with large distinguishing chromatic number
Michael Cavers
;
Karen Seyffarth
The Canada day theorem
Daniel Gomez
;
Hans Lundmark
;
Jacek Szmigielski
Nonconvexity of the set of hypergraph degree sequences
Ricky Ini Liu
The prime stems of rooted circuits of closure spaces and minimum implicational bases
Masataka Nakamura
;
Kenji Kashiwabara
The distinguishing chromatic number of Kneser graphs
Zhongyuan Che
;
Karen L. Collins
On a class of highly symmetric \(k\)-factorizations
Tommaso Traetta
Finding a princess in a palace: a pursuit-evasion problem
John R Britnell
;
Mark Wildon
Extremal hypergraphs for the biased Erdős-Selfridge theorem
Eric Lars Sundberg
A new determinant expression for the weighted Bartholdi zeta function of a digraph
Iwao Sato
;
Hideo Mitsuhasi
;
Hideaki Morita
Generalized pattern frequency in large permutations
Joshua Cooper
;
Erik Lundberg
;
Brendan Nagle
Integral Cayley graphs generated by distance sets in vector spaces over finite fields
Ngoc Dai Nguyen
;
Minh Hai Nguyen
;
Duy Hieu Do
;
Anh Vinh Le
New computational upper bounds for Ramsey numbers \(R(3,k)\)
Jan Goedgebeur
;
Stanisław P. Radziszowski
Biologically unavoidable sequences
Samuel A Alexander
Families that remain \(k\)-Sperner even after omitting an element of their ground set
Balázs Patkós
New approach to the \(k\)-independence number of a graph
Yair Caro
;
Adriana Hansberg
Partitions and compositions over finite fields
Amela Muratovic-Ribic
;
Qiang Wang
Extremal graphs having no stable cutset
Van Bang Le
;
Florian Pfender
Arc-transitive pentavalent graphs of order 4\(pq\)
Jiangmin Pan
;
Bengong Lou
;
Cuifeng Liu
Multiple Petersen subdivisions in permutation graphs
Tomáš Kaiser
;
Jean-Sébastien Sereni
;
Zelealem B. Yilma
Inequivalence of difference sets: on a remark of Baumert
Padraig Ó Catháin
Common edges in rooted trees and polygonal triangulations
Sean Cleary
;
Andrew Rechnitzer
;
Thomas Wong
Decomposing sets of inversions
Lukas Katthän
Properties of the corolla polynomial of a 3-regular graph
Dirk Kreimer
;
Karen Yeats
Lehmer's conjecture for Hermitian matrices over the Eisenstein and Gaussian integers
Graeme Taylor
;
Gary Greaves
Optimization problems over unit-distance representations of graphs
Marcel Kenji de Carli Silva
;
Levent Tunçel
Induced subarrays of Latin squares without repeated symbols
R. Julian R. Abel
;
Nicholas J. Cavenagh
;
Jaromy Kuhl
Galkin quandles, pointed abelian groups, and sequence A000712
William E. Clark
;
Xiang-dong Hou
Enumeration of unlabeled directed hypergraphs
Jianguo Qian
Residue reduced form of a rational function as an iterated Laurent series
Xin Guo Ce
;
Zhou Yue
On the binomial edge ideal of a pair of graphs
Sara Saeedi Madani
;
Dariush Kiani
Toward a graph version of Rado's theorem
Andy Parrish
Ramsey properties of countably infinite partial orderings
Marcia J. Groszek
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
Vida Dujmović
;
Fabrizio Frati
;
Gwenaël Joret
;
David R. Wood
Some remarks on the joint distribution of descents and inverse descents
Mirkó Visontai
Edge-disjoint induced subgraphs with given minimum degree
Raphael Yuster
Combinatorial tilings of the sphere by pentagons
Min Yan
On some generalized \(q\)-Eulerian polynomials
Zhicong Lin
A family of half-transitive graphs
Jing Chen
;
Cai Heng Li
;
Ákos Seress
On perfect packings in dense graphs
József Balogh
;
Alexandr Kostochka
;
Andrew Treglown
Perfect 1-factorisations of circulants with small degree
Sarada Herke
;
Barbara Maenhaut
An iterative approach to the traceability conjecture for oriented graphs
Susan van Aardt
;
Alewyn Burger
;
Jean Dunbar
;
Marietjie Frick
;
John Harris
;
Joy Singleton
Matchings in random biregular bipartite graphs
Guillem Perarnau
;
Giorgis Petridis
Making a graph crossing-critical by multiplying its edges
Laurent Beaudou
;
César Hernández-Vélez
;
Gelasio Salazar
Edge regular graph products
Boštjan Frelih
;
Štefko Miklavič
An involution proof of the Alladi-Gordon key identity for Schur's partition theorem
James J.Y. Zhao
Upper bounds for perfect matchings in Pfaffian and planar graphs
Afshin Behmaram
;
Shmuel Friedland
Extremal graphs for blow-ups of cycles and trees
Hong Liu
Hamiltonicity of cubic 3-connected \(k\)-Halin graphs
Shabnam Malik
;
Ahmad Mahmood Qureshi
;
Tudor Zamfirescu
Extremal values of ratios: distance problems vs. subtree problems in trees
László Székely
;
Hua Wang
On some small classical Ramsey numbers
Geoffrey Exoo
Symmetry breaking in tournaments
Antoni Lozano
Graph labelings and continuous factors of dynamical systems
Stephen M. Shea
Biregular cages of girth five
Marién Abreu
;
Gabriela Araujo-Pardo
;
Camino Balbuena
;
Domenico Labbate
;
Gloria López-Chávez
Enumeration of (16,4,16,4) relative difference sets
David Clark
;
Vladimir D. Tonchev
Stirling numbers of forests and cycles
David Galvin
;
Do Trong Thanh
The cost of 2-distinguishing Cartesian powers
Debra Boutin
Nonexistence of almost Moore digraphs of diameter four
Josep Conde
;
Joan Gimbert
;
Josep González
;
Josep M. Miret
;
Ramiro Moreno
On 021-avoiding ascent sequences
William Y.C. Chen
;
Alvin Y.L. Dai
;
Theodore Dokos
;
Tim Dwyer
;
Bruce E. Sagan
Sommaire du
Fascicule no. 2
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Maurice Pouzet
;
Nicolas Marc Thiéry
Asymptotic lower bounds on circular chromatic index of snarks
Martin Mačaj
;
Ján Mazák
Maximal antichains of minimum size
Thomas Kalinowski
;
Uwe Leck
;
Ian T. Roberts
Coloring the cube with rainbow cycles
Dhruv Mubayi
;
Randall Stading
Pattern avoidance in matchings and partitions
Jonathan Bloom
;
Sergi Elizalde
Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
Alejandro H. Morales
;
Ekaterina A. Vassilieva
Erdős-Gyárfás conjecture for cubic planar graphs
Christopher Carl Heckman
;
Roi Krakovski
Counting families of mutually intersecting sets
A. E. Brouwer
;
C. F. Mills
;
W. H. Mills
;
A. Verbeek
The biased odd cycle game
Asaf Ferber
;
Roman Glebov
;
Michael Krivelevich
;
Hong Liu
;
Cory Palmer
;
Tomas Valla
;
Máté Vizer
Decomposition of triply rooted trees
William Y.C. Chen
;
Janet F.F. Peng
;
Harold R.L. Yang
A simple proof of an identity of Lacasse
Yidong Sun
Sisterhood in the Gale-Shapley matching algorithm
Yannai A. Gonczarowski
;
Ehud Friedgut
A combinatorial proof of an identity for the divisor generating function
Masanori Ando
Non-classical hyperplanes of \(\mathrm{DW}(5,q)\)
Bart De Bruyn
General lower bounds on maximal determinants of binary matrices
Richard P. Brent
;
Judy-anne H. Osborn
On optimality of designs with three distinct eigenvalues
M. R. Faghihi
;
E. Ghorbani
;
G. B. Khosrovshahi
;
S. Tat
New results in \(t\)-tone coloring of graphs
Daniel Cranston
;
Jaehoon Kim
;
William Kinnersley
An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
Yevgeniy Rudoy
On the skew spectra of Cartesian products of graphs
Cui Denglan
;
Hou Yaoping
Minimal covers of the Archimedean tilings. II.
Mark Mixer
;
Daniel Pellicer
;
Gordon Williams
On the Cartesian product of non well-covered graphs
Bert L Hartnell
;
Douglas F Rall
Circular Nim games
Matthieu Dufour
;
Silvia Heubach
Random lifts of graphs are highly connected
Marcin Witkowski
The capture time of the hypercube
Anthony Bonato
;
Przemysław Gordinowicz
;
Bill Kinnersley
;
Paweł Prałat
Hamilton saturated hypergraphs of essentially minimum size
Andrzej Ruciński
;
Andrzej Żak
Fixed point polynomials of permutation groups.
C. M. Harden
;
D. B. Penman
On the Shannon capacity of triangular graphs
Ashik Mathew Kizhakkepallathu
;
Patric RJ Östergård
;
Alexandru Popa
Excedance numbers for the permutations of type \(B\)
Alina F.Y. Zhao
Congruences for \(q\)-Lucas numbers
Hao Pan
On the rank of \(p\)-schemes
Fateme Raei Barandagh
;
Amir Rahnamai Barghi
Labeling the regions of the type \(C_n\) Shi arrangement
Karola Mészáros
Face numbers of centrally symmetric polytopes produced from Split graphs
Ragnar Freij
;
Matthias Henze
;
Moritz W. Schmitt
;
Günter M. Ziegler
Coupon collector problem for non-uniform coupons and random quotas
Nathan B. Shank
;
Hannah Yang
An extension theorem for terraces.
Matt Ollis
;
Devin Willmott
Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
Andrei Asinowski
;
Gill Barequet
;
Mireille Bousquet-Mélou
;
Toufik Mansour
;
Ron Y. Pinter
Near packings of graphs
Andrzej Zak
On the number of nonequivalent propelinear extended perfect codes
Joaquim Borges
;
Ivan Yu. Mogilnykh
;
Josep Rifà
;
Faina I. Solov'eva
The number of rooted trees of given depth
Péter Pál Pach
;
Gabriella Pluhár
;
András Pongrácz
;
Csaba Szabó
Affine primitive groups and semisymmetric graphs
Hua Han
;
Zaiping Lu
On blow-ups and injectivity of quivers
Will Grilliette
;
Deborah E. Seacrest
;
Tyler Seacrest
Multivariate Fuss-Narayana polynomials and their application to random matrices
Romuald Lenczewski
;
Rafal Salapata
Integer points in knapsack polytopes and \(s\)-covering radius
Iskander Aliev
;
Martin Henk
;
Eva Linke
Which exterior powers are balanced?
Devlin Mallory
;
Abigail Raz
;
Christino Tamon
;
Thomas Zaslavsky
Generating and enumerating 321-avoiding and skew-merged simple permutations
Michael H. Albert
;
Vincent Vatter
Cores of vertex transitive graphs
David E. Roberson
On slowly percolating sets of minimal size in bootstrap percolation
Fabricio Benevides
;
Michał Przykucki
Graphs on affine and linear spaces and Deuber sets
David S. Gunderson
;
Hanno Lefmann
On the topology of the Cambrian semilattices.
Myrto Kallipoliti
;
Henri Mühle
On the maximum number of \(k\)-hooks of partitions of \(n\)
Anna R.B. Fan
;
Harold R.L. Yang
;
Rebecca T. Yu
Distinguishing maps. II: General case
Thomas W. Tucker
Generalized balanced tournament designs with block size four
Yeow Meng Chee
;
Han Mao Kiah
;
Chengmin Wang
Random graphs from a weighted minor-closed class
Colin McDiarmid
On the union complexity of diametral disks
Boris Aronov
;
Muriel Dulieu
;
Rom Pinchasi
;
Micha Sharir
On drawings and decompositions of 1-planar graphs
Július Czap
;
Dávid Hudák
Barred preferential arrangements
Connor Ahlbach
;
Jeremy Usatine
;
Nicholas Pippenger
Counting \(k\)-convex polyominoes
Anne Micheli
;
Dominique Rossin
Multiplicative partitions
Marc Chamberland
;
Colin Johnson
;
Alice Nadeau
;
Bingxi Wu
A combinatorial proof of an identity from Ramanujan's lost notebook
Lishuang Lin
;
Jian Liu
;
Yezhou Wang
Note on upper density of quasi-random hypergraphs
Vindya Bhat
;
Vojtěch Rödl
Vanishing of doubly symmetrized tensors
Andrew Berget
;
J. A. Dias da Silva
;
Amélia Fonseca
Modular Schur numbers
Jonathan Chappelon
;
María Pastora Revuelta Marchena
;
María Isabel Sanz Domínguez
On the Turán number of forests
Hong Liu
;
Bernard Lidicky
;
Cory Palmer
Integral Cayley multigraphs over abelian and Hamiltonian groups
Matt DeVos
;
Roi Krakovski
;
Bojan Mohar
;
Azhvan Sheikh Ahmady
Rooted \(K_4\)-minors
Ruy Fabila-Monroy
;
David R. Wood
Sommaire du
Fascicule no. 3
Maximum planar subgraphs in dense graphs
Peter Allen
;
Jozef Skokan
;
Andreas Würfl
Gromov hyperbolicity in strong product graphs
Walter Carballosa
;
Rocío M. Casablanca
;
Amauris de la Cruz
;
José M. Rodríguez
Degree distribution of an inhomogeneous random intersection graph
Mindaugas Bloznelis
;
Julius Damarackas
Limits of modified higher \(q,t\)-Catalan numbers
Kyungyong Lee
;
Li Li
;
Nicholas A Loehr
Recognition and characterization of chronological interval digraphs
Sandip Das
;
Mathew Francis
;
Pavol Hell
;
Jing Huang
A bound on permutation codes
Jürgen Bierbrauer
;
Klaus Metsch
An identity conjectured by Lacasse via the tree function
Helmut Prodinger
\((2,m,n)\)-groups with Euler characteristic equal to \(-2^as^b\).
Nick Gill
Geometric constructions for symmetric 3-configurations
Leah Wrenn Berman
On the independence numbers of the cubes of odd cycles
Tom Bohman
;
Ron Holzman
;
Venkatesh Natarajan
Extensions to 2-factors in bipartite graphs
Jennifer Vandenbussche
;
Douglas B. West
A plethysm formula on the characteristic map of induced linear characters from \(U_n(\mathbb F_q)\) to \(GL(\mathbb F_q)\).
Zhi Chen
The number of Euler tours of random directed graphs
Páidí Creed
;
Mary Cryan
Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
Suho Oh
Balanced vertex decomposable simplicial complexes and their \(h\)-vectors
Jennifer Biermann
;
Adam Van Tuyl
Symmetry in Gardens of Eden
Christiaan Hartman
;
Marijn J. H. Heule
;
Kees Kwekkeboom
;
Alain Noels
Eigenvalue pairing in the response matrix for a class of network models with circular symmetry
Miriam Farber
;
Charles R Johnson
;
Wei Zhen
A characterization of graphs by codes from their incidence matrices
Peter Dankelmann
;
Jennifer D. Key
;
Bernardo G. Rodrigues
An inhomogeneous lambda-determinant
Philippe Di Francesco
Regularity of join-meet ideals of distributive lattices
Viviana Ene
;
Ayesha Asloob Qureshi
;
Asia Rauf
The spectral excess theorem for distance-biregular graphs.
Miquel Àngel Fiol
The combinatorics of interval vector polytopes
Matthias Beck
;
Jessica De Silva
;
Gabriel Dorfsman-Hopkins
;
Joseph Pruitt
;
Amanda Ruiz
Can colour-blind distinguish colour palettes?
Rafał Kalinowski
;
Monika Pilśniak
;
Jakub Przybyło
;
Mariusz Woźniak
Embedding cycles in finite planes
Felix Lazebnik
;
Keith E. Mellinger
;
Oscar Vega
A note on total and paired domination of Cartesian product graphs
K. Choudhary
;
S. Margulies
;
I. V. Hicks
The edit distance function and symmetrization
Ryan R. Martin
The adjacency matroid of a graph
Lorenzo Traldi
;
Robert Brijder
;
Hendrik Jan Hoogeboom
Greedy trees, subtrees and antichains
Eric Ould Dadah Andriantiana
;
Stephan Wagner
;
Hua Wang
Medial symmetry type graphs
Isabel Hubard
;
María del Río Francos
;
Alen Orbanić
;
Tomaž Pisanski
On sumsets of multisets in \(\mathbb{Z}_p^m\)
Kaisa Matomäki
Knots in collapsible and non-collapsible balls
Bruno Benedetti
;
Frank H. Lutz
Upper-bounding the \(k\)-colorability threshold by counting covers
Amin Coja-Oghlan
Involutions on standard Young tableaux and divisors on metric graphs
Rohit Agrawal
;
Gregg Musiker
;
Vladimir Sotirov
;
Fan Wei
Symmetric polynomials and symmetric mean inequalities
Karl Mahlburg
;
Clifford Smyth
Integral circulant Ramanujan graphs of prime power order
T. A. Le
;
J. W. Sander
On the size of Kakeya sets in finite vector spaces
Gohar Kyureghyan
;
Peter Müller
;
Qi Wang
Coloring 2-intersecting hypergraphs
Lucas Colucci
;
András Gyárfás
Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
Wei-Tian Li
;
Bor-Liang Chen
;
Kuo-Ching Huang
;
Ko-Wei Lih
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
Pawel Wocjan
;
Clive Elphick
On the relationship between pipe dreams and permutation words
Cameron Marcott
From heaps of matches to the limits of computability
Urban Larsson
;
Johan Wästlund
Product dimension of forests and bounded treewidth graphs
L. Sunil Chandran
;
Rogers Mathew
;
Deepak Rajendraprasad
;
Roohani Sharma
Enumerating finite racks, quandles and kei
Simon R. Blackburn
Shattering, graph orientations, and connectivity
László Kozma
;
Shay Moran
Delay colourings of cubic graphs
Agelos Georgakopoulos
Nordhaus-Gaddum theorem for the distinguishing chromatic number
Karen L. Collins
;
Ann Trenk
Self-avoiding walks and the Fisher transformation
Geoffrey Grimmett
;
Zhongyang Li
Oriented hypergraphs: introduction and balance
Lucas J. Rusnak
The size of edge-critical uniquely 3-colorable planar graphs
Naoki Matsumoto
A new statistic on the hyperoctahedral groups
Alexander Stasinski
;
Christopher Voll
Chains of length 2 in fillings of layer polyominoes
Mitch Phillipson
;
Catherine H. Yan
;
Jean Yeh
A note on the acquaintance time of random graphs
William B. Kinnersley
;
Dieter Mitsche
;
Paweł Prałat
Linked partitions and permutation tableaux
William Y.C. Chen
;
Lewis H. Liu
;
Carol J. Wang
Rational associahedra and noncrossing partitions
Drew Armstrong
;
Brendon Rhoades
;
Nathan Williams
A note on forbidding clique immersions
Matt DeVos
;
Jessica McDonald
;
Bojan Mohar
;
Diego Scheide
Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters
Wayne Barrett
;
Shaun M. Fallat
;
H. Tracy Hall
;
Leslie Hogben
On the characteristic polynomial of \(n\)-Cayley digraphs
Majid Arezoomand
;
Bijan Taeri
On Wilf equivalence for alternating permutations
Sherry H.F. Yan
The range of a random walk on a comb
János Pach
;
Gábor Tardos
Sommaire du
Fascicule no. 4
Metric dimension for random graphs
Béla Bollobás
;
Dieter Mitsche
;
Paweł Prałat
Repeated columns and an old chestnut
R. P. Anstee
;
Linyuan Lu
A criterion for the log-convexity of combinatorial sequences
Ernest X.W. Xia
;
Olivia X.M. Yao
Generalized spectral characterization of graphs revisited
Wei Wang
The Terwilliger algebra of the incidence graphs of Johnson geometry
Qian Kong
;
Benjian Lv
;
Kaishun Wang
Crossings and nestings in colored set partitions
Eric Marberg
Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\)
Susanna Fishel
;
Myrto Kallipoliti
;
Eleni Tzanaki
Maximum induced forests in graphs of bounded treewidth
Glenn G. Chappell
;
Michael J. Pelsmajer
Random cyclations
Nicholas Pippenger
Counting permutations modulo pattern-replacement equivalences for three-letter patterns
William Kuszmaul
A bipartite graph with non-unimodal independent set sequence
Arnab Bhattacharyya
;
Jeff Kahn
The complexity of generalized domino tilings
Igor Pak
;
Jed Yang
The number of fixed points of Wilf's partition involution
Stephan Wagner
New results on degree sequences of uniform hypergraphs
Sarah Behrens
;
Catherine Erbes
;
Michael Ferrara
;
Stephen G. Hartke
;
Benjamin Reiniger
;
Hannah Spinoza
;
Charles Tomlinson
An approximate vertex-isoperimetric inequality for \(r\)-sets
Demetres Christofides
;
David Ellis
;
Peter Keevash
Two layer 3D floor planning
Paul Horn
;
Gabor Lippner
Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
Nihal Gowravaram
;
Ravi Jagadeesan
Skew spectra of oriented bipartite graphs
A. Anuradha
;
R. Balakrishnan
;
Xiaolin Chen
;
Xueliang Li
;
Huishu Lian
;
Wasin So
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
Jan Goedgebeur
;
Stanisław P. Radziszowski
Proof of Sun's conjecture on the divisibility of certain binomial sums
Victor J. W. Guo
Separability of density matrices of graphs for multipartite systems
Chen Xie
;
Hui Zhao
;
Zhixi Wang
Cyclic decomposition of \(k\)-permutations and eigenvalues of the arrangement graphs
Bai Fan Chen
;
Ebrahim Ghorbani
;
Kok Bin Wong
Computational results on the traceability of oriented graphs of small order
Alewyn Burger
A bijection proving the Aztec diamond theorem by combing lattice paths
Frédéric Bosio
;
Marc A. A. van Leeuwen
Random walks on quasirandom graphs
Ben Barber
;
Eoin Long
Enumeration of specific classes of polycubes
Jean-Marc Champarnaud
;
Quentin Cohen-Solal
;
Jean-Philippe Dubernard
;
Hadrien Jeanne
Spectra of edge-independent random graphs
Linyuan Lu
;
Xing Peng
On the codegree density of complete 3-graphs and related problems
Victor Falgas-Ravry
Unique sequences containing no \(k\)-term arithmetic progressions
Tanbir Ahmed
;
Janusz Dybizbánski
;
Hunter Snevily
Enumeration of generalized BCI lambda-terms
Olivier Bodini
;
Danièle Gardy
;
Bernhard Gittenberger
;
Alice Jacquot
New aspects of regions whose tilings are enumerated by perfect powers
Tri Lai
Periodic coefficients and random Fibonacci sequences
Karyn McLellan
Sparse distance sets in the triangular lattice
Tanbir Ahmed
;
Hunter Snevily
Tree-like tableaux
Jean-Christophe Aval
;
Adrien Boussicault
;
Philippe Nadeau
Inequivalence of skew Hadamard difference sets and triple intersection numbers modulo a prime
Koji Momihara
A basis for the diagonally signed-symmetric polynomials
José Manuel Gómez
On the Betti numbers of some classes of binomial edge ideals
Sohail Zafar
;
Zohaib Zahid