Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 29 (2022)
Précédent
Suivant
Sommaire du
Fascicule no. 1
A central limit theorem for the two-sided descent statistic on Coxeter groups
Benjamin Brück
;
Frank Röttger
Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph
Asaf Shapira
Tight bounds on probabilistic zero forcing on hypercubes and grids
Natalie C. Behague
;
Trent G. Marbach
;
Paweł Prałat
Weierstrass sets on finite graphs
Alessio Borzì
An Ore-type condition for Hamiltonicity in tough graphs
Songling Shan
A new matroid lift construction and an application to group-labeled graphs
Zach Walsh
Regular graphs with many triangles are structured
Pim van der Hoorn
;
Gabor Lippner
;
Elchanan Mossel
The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
Bethany Austhof
;
Patrick Bennett
;
Nick Christo
On zero-sum spanning trees and zero-sum connectivity
Yair Caro
;
Adriana Hansberg
;
Josef Lauri
;
Christina Zarb
Rainbow paths and large rainbow matchings
Ron Aharoni
;
Eli Berger
;
Maria Chudnovsky
;
Shira Zerbib
Union-closed families with small average overlap densities
David Ellis
Hat guessing on books and windmills
Xiaoyu He
;
Yuzu Ido
;
Benjamin Przybocki
Quotients of uniform positroids
Carolina Benedetti
;
Anastasia Chavez
;
Daniel Tamayo Jiménez
Walks obeying two-step rules on the square lattice: full, half and quarter planes
Nicholas Beaton
An isoperimetric inequality for Hamming balls and local expansion in hypercubes
Zilin Jiang
;
Amir Yehudayoff
Slide multiplicity free key polynomials
Soojin Cho
;
Stephanie van Willigenburg
Coloring drawings of graphs
Christoph Hertrich
;
Felix Schröder
;
Raphael Steiner
New lower bounds on the size-Ramsey number of a path
Deepak Bal
;
Louis DeBiasio
Polynomials counting nowhere-zero chains in graphs
Martin Kochol
Solving static permutation mastermind using \(O(n \log n)\) queries
Maxime Larcher
;
Anders Martinsson
;
Angelika Steger
Perfect codes in Cayley sum graphs
Xuanlong Ma
;
Kaishun Wang
;
Yuefeng Yang
Random Van der Waerden theorem
Ohad Zohar
Cooperative conditions for the existence of rainbow matchings
Ron Aharoni
;
Joseph Briggs
;
Minho Cho
;
Jinha Kim
A combinatorial proof of a Schmidt type theorem of Andrews and Paule
Kathy Q. Ji
Generalized Dold sequences on partially-ordered sets
Grzegorz Graff
;
Jacek Gulgowski
;
Małgorzata Lebiedź
Independent sets in subgraphs of a shift graph
Andrii Arman
;
Vojtěch Rödl
;
Marcelo Tadeu Sales
Enumeration of Gelfand-Cetlin type reduced words
Yunhyung Cho
;
Jang Soo Kim
;
Eunjeong Lee
\(H\)-chromatic symmetric functions
Nancy Mae Eagles
;
Angèle M. Foley
;
Alice Huang
;
Elene Karangozishvili
;
Annan Yu
The density of fan-planar graphs
Michael Kaufmann
;
Torsten Ueckerdt
On the dichromatic number of surfaces
Pierre Aboulker
;
Frédéric Havet
;
Kolja Knauer
;
Clément Rambaud
Topology of augmented Bergman complexes
Elisabeth Bullock
;
Aidan Kelley
;
Victor Reiner
;
Kevin Ren
;
Gahl Shemy
;
Dawei Shen
;
Brian Sun
;
Zhichun Joy Zhang
The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling
C. Y. Amy Pang
On the zero forcing number and spectral radius of graphs
Wenqian Zhang
;
Jianfeng Wang
;
Weifan Wang
;
Shengjin Ji
Bohr neighborhoods in generalized difference sets
John T. Griesmer
The tree alternative conjecture under the topological minor relation
Jorge Bruno
;
Paul Szeptycki
Some remarks on combinatorial wall-crossing
Galyna Dobrovolska
Andrews-Beck type congruences for overpartitions
Eunmi Kim
Subgraph complementation and minimum rank
Calum Buchanan
;
Christopher Purcell
;
Puck Rombach
On pattern avoidance in matchings and involutions
Jonathan J. Fang
;
Zachary Hamaker
;
Justin M. Troyka
On the connection between Stirling numbers and Bessel numbers
David Stenlund
Tiling enumeration of hexagons with off-central holes
Tri Lai
Cutting a cake for infinitely many guests
Zsuzsanna Jankó
;
Attila Joó
A new family of algebraically defined graphs with small automorphism group
Felix Lazebnik
;
Vladislav Taranchuk
Snarks with resistance \(n\) and flow resistance \(2n\)
Imran Allie
;
Edita Máčajová
;
Martin Škoviera
Modular and fractional \(L\)-intersecting families of vector spaces
Rogers Mathew
;
Tapas Kumar Mishra
;
Ritabrata Ray
;
Shashank Srivastava
\(K_{r,s}\) graph bootstrap percolation
Erhan Bayraktar
;
Suman Chakraborty
Edge isoperimetric inequalities for powers of the hypercube
Cyrus Rashtchian
;
William Raynaud
On multisets, interpolated multiple zeta values and limit laws
Markus Kuba
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
Wojciech Nadara
;
Marcin Smulewicz
Sharp upper and lower bounds on a restricted class of convex characters
Steven Kelk
;
Ruben Meuwese
On 1-subdivisions of transitive tournaments
Jaehoon Kim
;
Hyunwoo Lee
;
Jaehyeon Seo
Ramsey numbers of fans and large books
Meng Liu
;
Yusheng Li
On explicit constructions of designs
Xizhi Liu
;
Dhruv Mubayi
Weighted words at degree two. II: Flat partitions, regular partitions, and application to level one perfect crystals
Isaac Konan
Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
Patrick Hompe
;
Sophie Spirkl
On well-connected sets of strings
Peter Frankl
;
János Pach
Treewidth of the generalized Kneser graphs
Ke Liu
;
Mengyu Cao
;
Mei Lu
Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
Jozefien D'haeseleer
;
Giovanni Longobardi
;
Ago-Erik Riet
;
Leo Storme
Points and lines configurations for perpendicular bisectors of convex cyclic polygons
Paul Melotti
;
Sanjay Ramassamy
;
Paul Thévenin
Full Text
Improved bounds for weak coloring numbers
Gwenaël Joret
;
Piotr Micek
Computing volumes of adjacency polytopes via Draconian sequences
Robert Davis
;
Tianran Chen
Another note on intervals in the Hales-Jewett theorem
Nina Kamčev
;
Christoph Spiegel
Uncountably many minimal hereditary classes of graphs of unbounded clique-width
Robert Brignall
;
Daniel Cocks
Sommaire du
Fascicule no. 2
Spectral radius, edge-disjoint cycles and cycles of the same length
Huiqiu Lin
;
Mingqing Zhai
;
Yanhua Zhao
Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
Xiaoling Dou
;
Hsien-Kuei Hwang
;
Chong-Yi Li
There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
Jack Koolen
;
Brhane Gebremichel
A \(q\)-multisum identity arising from finite chain ring probabilities
Jehanne Dousse
;
Robert Osburn
On the maximum of the weighted binomial sum \(2^{-r}\sum_{i=0}^r\binom{m}{i}\)
Stephen Glasby
;
Gerhard Paseman
Flip graphs of stacked and flag triangulations of the 2-sphere
Benjamin Burton
;
Basudeb Datta
;
Jonathan Spreer
The fractional chromatic number of generalized cones over graphs
Jialu Zhu
;
Xuding Zhu
An equivariant quantum Pieri rule for the Grassmannian on cylindric shapes
Anna Bertiger
;
Dorian Ehrlich
;
Elizabeth Milićević
;
Kaisa Taipale
Eigenvalues of Cayley graphs
Xiaogang Liu
;
Sanming Zhou
Diagonal hooks and a Schmidt-type partition identity
Shane Chern
;
Ae Ja Yee
Combinatorial perspectives on the crank and mex partition statistics
Brian Hopkins
;
James Sellers
;
Ae Ja Yee
On bipartite distance-regular Cayley graphs with small diameter
Edwin R. van Dam
;
Mojtaba Jazaeri
An area-depth symmetric \(q, t\)-Catalan polynomial
Joseph Pappe
;
Digjoy Paul
;
Anne Schilling
On a huge family of non-Schurian Schur rings
Akihide Hanaki
;
Takuto Hirai
;
Ilia Ponomarenko
Gamma-positivity for a refinement of median Genocchi numbers
Sen-Peng Eu
;
Tung-Shan Fu
;
Hsin-Hao Lai
;
Yuan-Hsun Lo
Hadamard diagonalizable graphs of order at most 36
Jane Breen
;
Steve Butler
;
Melissa Fuentes
;
Bernard Lidický
;
Michael Phillips
;
Alexander Riasanovksy
;
Sung-Yell Song
;
Ralihe Villagrán
;
Cedar Wiseman
;
Xiaohong Zhang
Chordal directed graphs are not \(\chi\)-bounded
Pierre Aboulker
;
Nicolas Bousquet
;
Rémi de Verclos
On sum sets and convex functions
Sophie Stevens
;
Audie Warren
Positivity of chromatic symmetric functions associated with Hessenberg functions of bounce number 3
Soojin Cho
;
Jaehyun Hong
On the subspace choosability in graphs
Dror Chawin
;
Ishay Haviv
Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
Maria Chudnovsky
;
Adam Kabela
;
Binlong Li
;
Petr Vrána
Covering symmetric sets of the Boolean cube by affine hyperplanes
S. Venkitesh
Degrees in link graphs of regular graphs
Itai Benjamini
;
John Haslegrave
Some combinatorial properties of skew Jack symmetric functions
Paolo Bravi
;
Jacopo Gandini
Size and structure of large \((s,t)\)-union intersecting families
Ali Taherkhani
Trees contained in every orientation of a graph
Tássio Naia
Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)
James Di
;
Erica Flapan
;
Spencer Johnson
;
Daniel Thompson
;
Christopher Tuffley
Integer colorings with no rainbow 3-term arithmetic progression
Xihe Li
;
Hajo Broersma
;
Ligong Wang
Rowmotion orbits of trapezoid posets
Quang Vu Dao
;
Julian Wellman
;
Calvin Yost-Wolff
;
Sylvester W. Zhang
Central limit theorem for the largest component of random intersection graph
Liang Dong
;
Zhishui Hu
Moduli spaces of codimension-one subspaces in a linear variety and their tropicalization
Philipp Jell
;
Hannah Markwig
;
Felipe Rincón
;
Benjamin Schröter
On maximal sum-free sets in abelian groups
Nathanaël Hassler
;
Andrew Treglown
Tree/endofunction bijections and concentration inequalities
Steven Heilman
Note on the number of balanced independent sets in the Hamming cube
Jinyoung Park
Turán number of disjoint triangles in 4-partite graphs
Jie Han
;
Yi Zhao
Minimum maximal matchings in cubic graphs
Wouter Cames van Batenburg
Simplicial dollar game
Jesse Kim
;
David Perkinson
The excluded minors for lattice path polymatroids
Joseph Bonin
;
Carolyn Chun
;
Tara Fife
A note on Möbius functions of upho posets
Sam Hopkins
Spectra of weighted uniform hypertrees
Jiang-Chao Wan
;
Yi Wang
;
Fu-Tao Hu
An extension of the Lindström-Gessel-Viennot theorem
Yi-Lin Lee
Shattering and more: Extending the complete object
R. P. Anstee
;
N. A. Nikov
Acyclic, star, and injective colouring: bounding the diameter
Christoph Brause
;
Petr Golovach
;
Barnaby Martin
;
Pascal Ochem
;
Daniël Paulusma
;
Siani Smith
Generalized rainbow Turán problems
Dániel Gerbner
;
Tamás Mészáros
;
Abhishek Methuku
;
Cory Palmer
On polynomials counting essentially irreducible maps
Timothy Budd
Reduced word enumeration, complexity, and randomization
Cara Monical
;
Benjamin Pankow
;
Alexander Yong
Concatenating bipartite graphs
Maria Chudnovsky
;
Patrick Hompe
;
Alex Scott
;
Paul Seymour
;
Sophie Spirkl
On the trivial \(T\)-module of a graph
Blas Fernández
;
Štefko Miklavič
A categorification for the signed chromatic polynomial
Zhiyun Cheng
;
Ziyi Lei
;
Yitian Wang
;
Yanguo Zhang
Queen domination of even square boards
William D. Weakley
An improved planar graph product structure theorem
Torsten Ueckerdt
;
David Wood
;
Wendy Yi
Factorially many maximum matchings close to the Erdős-Gallai bound
Stéphane Bessy
;
Johannes Pardey
;
Lucas Picasarri-Arrieta
;
Dieter Rautenbach
The number of \(k\)-dimensional corner-free subsets of grids
Younjin Kim
Dense Eulerian graphs are \((1, 3)\)-choosable
Huajing Lu
;
Xuding Zhu
On nilpotent orientably-regular maps of nilpotency class \(4\)
Wenqin Xu
;
Shaofei Du
;
Jin Ho Kwak
;
Jian Lei
;
Kaina Shi
Extremal graphs for a spectral inequality on edge-disjoint spanning trees
Sebastian M. Cioabă
;
Anthony Ostuni
;
Davin Park
;
Sriya Potluri
;
Tanay Wakhare
;
Wiseley Wong
Completely regular codes in Johnson and Grassmann graphs with small covering radii
Ivan Mogilnykh
Guessing numbers and extremal graph theory
Jo Martin
;
Puck Rombach
Sommaire du
Fascicule no. 3
On Denert's statistic
Angela Carnevale
;
Elena Tielker
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
Raphael Steiner
On a conjecture concerning shuffle-compatible permutation statistics
Lihong Yang
;
Sherry H.F. Yan
A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions
AJ Bu
Linear bounds for cycle-free saturation games
Sean English
;
Tomáš Masařík
;
Grace McCourt
;
Erin Meger
;
Michael S. Ross
;
Sam Spiro
Higher convexity and iterated second moment estimates
Peter Bradshaw
;
Brandon Hanson
;
Misha Rudnev
Lengths of irreducible and delicate words
Benjamin Przybocki
Connecting \(k\)-Naples parking functions and obstructed parking functions via involutions
Roger Tian
Searching for an intruder on graphs and their subdivisions
Anton Bernshteyn
;
Eugene Lee
Extremal rays of the equivariant Littlewood-Richardson cone
Joshua Kiers
Maximal chains in bond lattices
Shreya Ahirwar
;
Susanna Fishel
;
Parikshita Gya
;
Pamela Harris
;
Nguyen Pham
;
Andrés Vindas Meléndez
;
Dan Khanh Vo
A multiplicative property for zero-sums. II
David J. Grynkiewicz
;
Chao Liu
Generalizing parking functions with randomness
Melanie Tian
;
Enrique Treviño
Classical length-5 pattern-avoiding permutations
Nathan Clisby
;
Andrew R. Conway
;
Anthony J. Guttmann
;
Yuma Inoue
High-dimensional holeyominoes
Greg Malen
;
Fedor Manin
;
Érika Roldán
Upper triangular linear relations on multiplicities and the Stanley-Stembridge conjecture
Megumi Harada
;
Martha Precup
Every Steiner triple system contains almost spanning \(d\)-ary hypertree
Andrii Arman
;
Vojtěch Rödl
;
Marcelo Tadeu Sales
Minimum number of edges of polytopes with \(2d+2\) vertices
Guillermo Pineda-Villavicencio
;
Julien Ugon
;
David Yost
Coloring graph classes with no induced fork via perfect divisibility
T. Karthick
;
Jenny Kaufmann
;
Vaidy Sivaraman
Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs
Lauren Keough
;
Jamie Radcliffe
On distinct distances between a variety and a point set
Bryce McLaughlin
;
Mohamed Omar
Powers of Hamilton cycles of high discrepancy are unavoidable
Domagoj Bradač
Sorting by shuffling methods and a queue
Stoyan Dimitrov
Many faces of symmetric edge polytopes
Alessio D'Alì
;
Emanuele Delucchi
;
Mateusz Michałek
On the number of hyperedges in the hypergraph of lines and pseudo-discs
Chaya Keller
;
Balázs Keszegh
;
Dömötör Pálvölgyi
The root distributions of Ehrhart polynomials of free sums of reflexive polytopes
Masahiro Hachimori
;
Akihiro Higashitani
;
Yumi Yamada
Phase transition in cohomology groups of non-uniform random simplicial complexes
Oliver Cooley
;
Nicola Del Giudice
;
Mihyun Kang
;
Philipp Sprüssel
Plethysms of chromatic and Tutte symmetric functions
Logan Crew
;
Sophie Spirkl
Higgledy-piggledy sets in projective spaces of small dimension
Lins Denaux
Some remarks on even-hole-free graphs
Zi-Xia Song
Planar Turán numbers of cycles: a counterexample
Daniel W. Cranston
;
Bernard Lidický
;
Xiaonan Liu
;
Abhinav Shantanam
A unique characterization of spectral extrema for friendship graphs
Mingqing Zhai
;
Ruifang Liu
;
Jie Xue
On sequences in cyclic groups with distinct partial sums
Simone Costa
;
Stefano Della Fiore
;
M. A. Ollis
;
Sarah Z. Rovner-Frydman
A type \(B\) analogue of the category of finite sets with surjections
Nicholas Proudfoot
Contact Lie poset algebras
Vincent E. Coll Jr.
;
Nicholas W. Mayers
;
Nicholas Russoniello
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton
Narad Rampersad
;
Jeffrey Shallit
DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces
Vladimir N. Potapov
On the minimal sum of edges in a signed edge-dominated graph
Danila Cherkashin
;
Pavel Prozorov
On the local structure of oriented graphs -- a case study in flag algebras
Shoni Gilboa
;
Roman Glebov
;
Dan Hefetz
;
Nati Linial
;
Avraham Morgenstern
What convex geometries tell about shattering-extremal systems
Bogdan Chornomaz
Synchronizing times for \(k\)-sets in automata
Natalie Behague
;
Robert Johnson
A fourfold refined enumeration of alternating sign trapezoids
Hans Höngesberg
\(2\times n\) grids have unbounded anagram-free chromatic number
Saman Bazarghani
;
Paz Carmi
;
Vida Dujmović
;
Pat Morin
Bijective enumerations for symmetrized poly-Bernoulli polynomials
Minoru Hirose
;
Toshiki Matsusaka
;
Ryutaro Sekigawa
;
Hyuga Yoshizaki
Minimum-perimeter lattice animals and the constant-isomer conjecture
Gill Barequet
;
Gil Ben-Shachar
On the Turán number of the linear \(3\)-graph \(C_{13}\)
Chaoliang Tang
;
Hehui Wu
;
Shengtong Zhang
;
Zeyu Zheng
On completing partial Latin squares with prescribed diagonals
Lars Andersen
;
Stacie Baumann
;
Anthony Hilton
;
Chris Rodger
On certain edge-transitive bicirculants of twice odd order
István Kovács
;
János Ruff
Towards the small quasi-kernel conjecture
Alexandr V. Kostochka
;
Ruth Luo
;
Songling Shan
Unknotted cycles
Christopher Cornwell
;
Nathan McNew
A counterexample to the shuffle compatiblity conjecture
Ezgi Kantarcı Oğuz
Counting embeddings of rooted trees into families of rooted trees
Bernhard Gittenberger
;
Zbigniew Gołębiewski
;
Isabella Larcher
;
Małgorzata Sulkowska
Shellability of polyhedral joins of simplicial complexes and its application to graph theory
Kengo Okura
On Gröbner basis and Cohen-Macaulay property of closed path polyominoes
Carmelo Cisto
;
Francesco Navarra
;
Rosanna Utano
Maximum size of a graph with given fractional matching number
Tianlong Ma
;
Jianguo Qian
;
Chao Shi
Density maximizers of layered permutations
Adam Kabela
;
Daniel Král'
;
Jonathan A. Noel
;
Théo Pierron
Naruse hook formula for linear extensions of mobile posets
GaYee Park
Distinguishing number of universal homogeneous Urysohn metric spaces
A. Bonato
;
C. Laflamme
;
M. Pawliuk
;
N. Sauer
A simple proof of the Gan-Loh-Sudakov conjecture
Ting-Wei Chao
;
Zichao Dong
Perfect domination ratios of Archimedean lattices
Yunfan Zhao
;
John C Wierman
;
Thomas G. Marge
The ``Young'' and ``reverse'' dichotomy of polynomials
Sarah Mason
;
Dominic Searles
An irrational Turán density via hypergraph Lagrangian densities
Biao Wu
Special case of Rota's basis conjecture on graphic matroids
Shun-ichi Maezawa
;
Akiko Yazawa
On the performance of the depth first search algorithm in supercritical random graphs
Sahar Diskin
;
Michael Krivelevich
Cohen-Macaulay growing graphs
Safyan Ahmad
;
Fazal Abbas
;
Shamsa Kanwal
Simplices and regular polygonal tori in Euclidean Ramsey theory
Miltiadis Karamanlis
Sommaire du
Fascicule no. 4
Vizing's and Shannon's theorems for defective edge colouring
Pierre Aboulker
;
Guillaume Aubian
;
Chien-Chung Huang
The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Yongtao Li
;
Yuejian Peng
Degree and regularity of Eulerian ideals of hypergraphs
Jorge Neves
;
Gonçalo Varejão
Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
Alvaro Carbonero
;
Patrick Hompe
;
Benjamin Moore
;
Sophie Spirkl
LLT cumulants and graph coloring
Maciej Dołęga
;
Maciej Kowalski
Skew Schur polynomials and cyclic sieving phenomenon
So-Yeon Lee
;
Young-Tak Oh
Classification of cocovers in the double affine Bruhat order
Amanda Welch
Ramsey-type results for path covers and path partitions
Shuya Chiba
;
Michitaka Furuya
Colouring non-even digraphs
Marcelo Garlet Millani
;
Raphael Steiner
;
Sebastian Wiederrecht
Comparison of two convergence criteria for the variable-assignment lopsided Lovász local lemma
David Harris
Some unexpected properties of Littlewood-Richardson coefficients
Maxime Pelletier
;
Nicolas Ressayre
Frobenius allowable gaps of generalized numerical semigroups
Deepesh Singhal
;
Yuxin Lin
Loose cores and cycles in random hypergraphs
Oliver Cooley
;
Mihyun Kang
;
Julian Zalla
Improved bounds on a generalization of Tuza's conjecture
Abdul Basit
;
Daniel McGinnis
;
Henry Simmons
;
Matt Sinnwell
;
Shira Zerbib
Growth of replacements
Vuong Bui
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
Kolja Knauer
;
Hoang La
;
Petru Valicov
Crowns in linear \(3\)-graphs of minimum degree \(4\)
Alvaro Carbonero
;
Willem Fletcher
;
Jing Guo
;
András Gyárfás
;
Rona Wang
;
Shiyu Yan
On the Hamiltonian property hierarchy of 3-connected planar graphs
On-Hei Solomon Lo
Double generalized majorization
Marija Dodig
;
Marko Stosic
A cyclic analogue of Stanley's shuffling theorem
Kathy Ji
;
Dax T.X. Zhang
On the girth of three-dimensional algebraically defined graphs with multiplicatively separable functions
Alex M. Kodess
;
Brian G. Kronenthal
;
Tony W.H. Wong
Level-planarity: transitivity vs. even crossings
Guido Brückner
;
Ignaz Rutter
;
Peter Stumpf
Towards obtaining a 3-decomposition from a perfect matching
Oliver Bachtler
;
Sven O. Krumke
Random decompositions of Eulerian statistics
Alperen Özdemir
Pattern-avoiding ascent sequences of length 3
Andrew R. Conway
;
Miles Conway
;
Andrew Elvey Price
;
Anthony J. Guttmann
Multicolor Ramsey numbers for Berge cycles
Zachary DeStefano
;
Hannah Mahon
;
Frank Simutis
;
Michael Tait
Digital almost nets
Boris Bukh
;
Ting-Wei Chao
Doubly stochastic matrices and Schur-Weyl duality for partition algebras
Stephen Doty
The minimum number of spanning trees in regular multigraphs
Jakub Pekárek
;
Jean-Sébastien Sereni
;
Zelealem B. Yilma
Morphology of small snarks
Ján Mazák
;
Jozef Rajník
;
Martin Škoviera
Ordering circuits of matroids
Cameron Crenshaw
;
James Oxley
Preimages under the bubblesort operator
Mathilde Bouvel
;
Lapo Cioni
;
Luca Ferrari
The EKR-module property of pseudo-Paley graphs of square order
Shamil Asgarli
;
Sergey Goryainov
;
Huiqiu Lin
;
Chi Hoi Yip
The characterization of cones as pointsets with 3 intersection numbers
Dibyayoti Dhananjay Jena
On infinite, cubic, vertex-transitive graphs with applications to totally disconnected, locally compact groups
Arnbjörg Soffía Árnadóttir
;
Waltraud Lederle
;
Rögnvaldur G. Möller
Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
Sophie Rehberg
Length-four pattern avoidance in inversion sequences
Letong Hong
;
Rupert Li
Congruences for consecutive coefficients of Gaussian polynomials with crank statistics
Dennis Eichhorn
;
Lydia Engle
;
Brandt Kronholm
Hopf structures in the representation theory of direct products
Farid Aliniaeifard
;
Nathaniel Thiem
Most rigid representation and Cayley index of finitely generated groups
Paul-Henry Leemann
;
Mikael de la Salle
A linear hypergraph extension of Turán's theorem
Guorong Gao
;
An Chang
Some properties of the parking function poset
Bérénice Delcroix-Oger
;
Matthieu Josuat-Vergès
;
Lucas Randazzo
Pattern-functions, statistics, and shallow permutations
Yosef Berman
;
Bridget Eileen Tenner
Density of balanced 3-partite graphs without 3-cycles or 4-cycles
Zequn Lv
;
Mei Lu
;
Chunqiu Fang
The covering threshold of a directed acyclic graph by directed acyclic subgraphs
Raphael Yuster
A combinatorial characterization of extremal generalized hexagons
Bart De Bruyn
Weighted modulo orientations of graphs and signed graphs
Jianbing Liu
;
Miaomiao Han
;
Hong-Jian Lai