Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 32 (2025)
Précédent
Sommaire du
Fascicule no. 1
The 3-dicritical semi-complete digraphs
Frédéric Havet
;
Florian Hörsch
;
Lucas Picasarri-Arrieta
On the asymptotic behavior for partitions separated by parity
Kathrin Bringmann
;
William Craig
;
Caner Nazaroglu
Counting occurrences of patterns in permutations
Andrew Conway
;
Anthony Guttmann
A refinement of and a companion to MacMahon's partition identity
Matthew Russell
Maximum spread of \(K_{s,t}\)-minor-free graphs
William Linz
;
Linyuan Lu
;
Zhiyu Wang
A constructive winning maker strategy in the maker-breaker \(C_4\)-game
Matthias Sowa
;
Anand Srivastav
On (shape-)Wilf-equivalence of certain sets of (partially ordered) patterns
Alexander Burstein
;
Tian Han
;
Sergey Kitaev
;
Philip B. Zhang
Long cycles in percolated expanders
Maurício Collares
;
Sahar Diskin
;
Joshua Erde
;
Michael Krivelevich
Sharp Szemerédi-Trotter constructions in the plane
Larry Guth
;
Olivine Silier
Piercing independent sets in graphs without large induced matching
Jiangdong Ai
;
Hong Liu
;
Zixiang Xu
;
Qiang Zhou
Kromatic quasisymmetric functions
Eric Marberg
Demazure crystals for flagged key polynomials
Jiayi Wen
Homological algebra of Nakayama algebras and 321-avoiding permutation
Eirini Chavli
;
Rene Marczinzik
Permanental inequalities for totally positive matrices
Mark Skandera
;
Daniel Soskin
The clairvoyant maître d'
Reed Acton
;
T. Kyle Petersen
;
Blake Shirman
;
Bridget Eileen Tenner
Generalized Ramsey numbers at the linear and quadratic thresholds
Patrick Bennett
;
Ryan Cushman
;
Andrzej Dudek
The linear \(q\)-hypergraph process
Sayok Chakravarty
;
Nicholas Spanier
On the quantum chromatic numbers of small graphs
Olivier Lalonde
Independent removable edges in cubic bricks
Fuliang Lu
;
Jianguo Qian
The maximum number of connected sets in regular graphs
Stijn Cambie
;
Jorik Jooken
;
Jan Goedgebeur
On the evolution of random integer compositions
David Bevan
;
Dan Threlfall
A proof of the \((n, k, t)\) conjectures
Stacie Baumann
;
Joseph Briggs
A note on uncountably chromatic graphs
Nathan Bowler
;
Max Pitz
New strongly regular graphs found via local search for partial difference sets
Andrew Brady
The number of edge colorings with small independence number and no monochromatic \(H\)
Xinyu Hu
;
Qizhong Lin
;
Jiaxi Nie
Graphs without a 3-connected subgraph are 4-colourable
Édouard Bonnet
;
Carl Feghali
;
Tung Nguyen
;
Alex Scott
;
Paul Seymour
;
Stéphan Thomassé
;
Nicolas Trotignon
On set representation of bounded degree hypergaphs
Ayush Basu
;
Griffin Johnston
;
Vojtěch Rödl
;
Marcelo Sales
Lower bounds on face numbers of polytopes with \(m\) facets
Joshua Hinman
Generalized crowns in linear \(r\)-graphs
Lin-Peng Zhang
;
Hajo Broersma
;
Ligong Wang
The minimum spectral radius of \(tP_3\)- or \(K_5\)-saturated graphs via the number of \(2\)-walks
Jiangdong Ai
;
Pei Liu
;
Suil O
;
Junxue Zhang
A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
Alexandr Kostochka
;
Ruth Luo
;
Grace McCourt
An interlacing property of the signless Laplacian of threshold graphs
Christoph Helmberg
;
Guilherme Porto
;
Guilherme Torres
;
Vilmar Trevisan
Some bounds on the threshold dimension of graphs
Mathew C. Francis
;
Atrayee Majumder
;
Rogers Mathew
The degree threshold for covering with all the connected \(3\)-graphs with \(3\) edges
Yue Ma
;
Xinmin Hou
;
Zhi Yin
Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs
Jie Han
;
Lin Sun
;
Guanghui Wang
Braces of perfect matching width 2
Archontia C. Giannopoulou
;
Meike Hatzel
;
Sebastian Wiederrecht
Structural Szemerédi-Trotter for lattices and their generalizations
Shival Dasu
;
Adam Sheffer
;
Junxuan Shen
Pascal's formulas and vector fields
Philippe Chassaing
;
Jules Flin
;
Alexis Zevio
A combinatorial interpretation of the noncommutative inverse Kostka matrix
Edward Allen
;
Sarah Katherine Mason
Ascent sequences avoiding a triple of length-3 patterns
David Callan
;
Toufik Mansour
Shellability of componentwise discrete polymatroids
Antonino Ficarra
Problems, proofs, and disproofs on the inversion number
Guillaume Aubian
;
Frédéric Havet
;
Florian Hörsch
;
Felix Kingelhoefer
;
Nicolas Nisse
;
Clément Rambaud
;
Quentin Vermande
Low rank groups of Lie type acting point- and line-primitively on finite generalised quadrangles
Vishnuram Arumugam
;
John Bamberg
;
Michael Giudici
A note on the invertibility of oriented graphs
Natalie Behague
;
Tom Johnston
;
Natasha Morrison
;
Shannon Ogden
The image of a tropical linear space
Joshua Mundinger
The construction of a class of presentations for Specht modules
Tamar Friedmann
On the minimum density of monotone subwords
Raphael Yuster
A special class of pure \(O\)-sequences
Tài Huy Hà
;
Takayuki Hibi
;
Fabrizio Zanello
The Norton-balanced condition for \(Q\)-polynomial distance-regular graphs
Kazumasa Nomura
;
Paul Terwilliger
Polynomial bounds for monochromatic tight cycle partition in \(r\)-edge-coloured \(K_n^{(k)}\)
Debmalya Bandyopadhyay
;
Allan Lo
Algebraic characterization of dendricity
France Gheeraert
;
Herman Goulet-Ouellet
;
Julien Leroy
;
Pierre Stas
Smoothed analysis of the Komlós conjecture: Rademacher noise
Elad Aigner-Horev
;
Dan Hefetz
;
Michael Trushkin
A combinatorial perspective on the noncommutative symmetric functions
Angela Hicks
;
Robert McCloskey
On commutative association schemes and associated (directed) graphs
Giusy Monzillo
;
Safet Penjić
Saturation of \(k\)-chains in the Boolean lattice
Ryan Martin
;
Nick Veldt
Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
Yizhe Ji
;
Wei Wang
;
Wei Wang
;
Hao Zhang
Sommaire du
Fascicule no. 2
What is a \(4\)-connected matroid?
Nick Brettell
;
Susan Jowett
;
James Oxley
;
Charles Semple
;
Geoff Whittle
Every signed planar graph of girth 5 has circular chromatic number strictly less than 4
Jiaao Li
;
Xueliang Li
;
Zhiqian Wang
Fusions of the tensor product of a strongly regular graph
Allen Herman
;
Neha Joshi
Rank functions and invariants of delta-matroids
Matt Larson
Signed circuit \(6\)-covers of signed \(K_4\)-minor-free graphs
You Lu
;
Rong Luo
;
Zhengke Miao
;
Cun-Quan Zhang
A three-regime theorem for flow-firing
Sarah Brauner
;
Galen Dorpalen-Barry
;
Selvi Kara
;
Caroline Klivans
;
Lisa Schneider
Realizability in Matoušek unique sink orientations: characterization and complexity gap
Bernd Gärtner
;
Simon Weber
;
Joel Widmer
On the order of \(P\)-strict promotion on \(\mathsf{V}\times [\ell]\)
Benjamin Adenbaum
On the order sequence of a group
Peter J. Cameron
;
Hiranya Kishore Dey
Reflection groups and quiver mutation: diagrammatics
Patrick Wegener
The skew immaculate Hecke poset and 0-Hecke modules
Nadia Lafrenière
;
Rosa Orellana
;
Anna Pun
;
Sheila Sundaram
;
Stephanie van Willigenburg
;
Tamsen Whitehead McGinley
Simplicial complexes and matroids with vanishing \(T^2\)
Alexandru Constantinescu
;
Patricia Klein
;
Thái Thành Nguyễn
;
Anurag Singh
;
Lorenzo Venturello
Graphs with large clique number whose second largest eigenvalue does not exceed \((\sqrt{5}-1)/2\)
Muhuo Liu
;
Chaohui Chen
;
Zoran Stanić
;
Haiying Shan
Turán colourings in off-diagonal Ramsey multiplicity
Joseph Hyde
;
Jae-baek Lee
;
Jonathan A. Noel
Randomized algorithms to generate hypergraphs with given degree sequences
Michela Ascolese
;
Matthias Lienau
;
Matthias Schulte
;
Anusch Taraz
List colorings of \(k\)-partite \(k\)-graphs
Abhishek Dhawan
Weighted tree games
Patrick Bennett
;
Alan Frieze
Generalized spectral characterization of signed trees
Yizhe Ji
;
Wei Wang
;
Hao Zhang
New structures and their applications to variants of zero forcing and propagation time
Leslie Hogben
;
Mark Hunnell
;
Kevin Liu
;
Houston Schuerger
;
Ben Small
;
Yaqi Zhang
New bounds on a generalization of Tuza's conjecture
Alex Parker
A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
Patrick Bennett
;
Andrzej Dudek
;
Sean English
Almost all 9-regular graphs have a modulo-5 orientation
Michelle Delcourt
;
Reaz Huq
;
Paweł Prałat
On the \(A_\alpha\)-index of \(C_4\)-free graphs with given order or size
Yuantian Yu
;
Shuchao Li
Grid minors and products
Vida Dujmović
;
Pat Morin
;
David Wood
;
David Worley
A new family of \((q^{4}+1)\)-tight sets with an automorphism group \(F_{4}(q)\)
Tao Feng
;
Weicong Li
;
Qing Xiang
Long cycles and spectral radii in planar graphs
Ping Xu
;
Lin Huiqiu
;
Longfei Fang
Avoidability beyond paths
Vladimir Gurvich
;
Matjaž Krnc
;
Martin Milanič
;
Mikhail Vyalyi
Edge cover through edge coloring
Guantao Chen
;
Songling Shan
Frozen colourings in \(2 K_2\)-free graphs
Manoj Belavadi
;
Kathie Cameron
;
Elias Hildred
On the hyperdeterminants of Steiner distance hypermatrices
Ya-Nan Zheng
3-cluster-free families of subspaces
Gabriel Currier
;
Shahriar Shahriari
Sparse vertex cutsets and the maximum degree
Stéphane Bessy
;
Johannes Rauch
;
Dieter Rautenbach
;
Uéverton S. Souza
A max-min problem on spectral radius and connectedness of graphs
Zhenzhen Lou
;
Changxiang He
Classification of vertex-transitive digraphs of order a product of two distinct primes via automorphism group
Ted Dobson
;
Ademir Hujdurović
;
Klavdija Kutnar
;
Joy Morris
Tangled paths: a random graph model from Mallows permutations
Jessica Enright
;
Kitty Meeks
;
William Pettersson
;
John Sylvester
The ascent lattice on Dyck paths
Jean-Luc Baril
;
Mireille Bousquet-Mélou
;
Sergey Kirgizov
;
Mehdi Naima
A generalization of conjugation of integer partitions
Seamus Albion
;
Theresia Eisenkölbl
;
Ilse Fischer
;
Moritz Gangl
;
Hans Höngesberg
;
Christian Krattenthaler
;
Martin Rubey
Detecting graphical and digraphical regular representations in groups of squarefree order
Joy Morris
;
Gabriel Verret
Bounds for greedy \(B_h\)-sets
Kevin O'Bryant
Degree deviation and spectral radius
Dieter Rautenbach
;
Florian Werner
On the off-diagonal unordered Erdős-Rado numbers
Igor Araujo
;
Dadong Peng
A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
Dermot McCarthy
;
Chris Monico
New bounds on families without large sunflowers
Peter Frankl
;
Jian Wang
Uniform recurrence in the Motzkin numbers and related sequences mod \(p\)
Nadav Kohen
How to get the random graph with non-uniform probabilities?
Leonardo Coregliano
;
Jarosław Swaczyna
;
Agnieszka Widz
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
Miklós Bóna
;
Stoyan Dimitrov
;
Gilbert Labelle
;
Yifei Li
;
Joseph Pappe
;
Andrés R. Vindas-Meléndez
;
Yan Zhuang
Generalized quaternion groups with the \(m\)-DCI property
Jinhua Xie
;
Yan-Quan Feng
;
Binzhou Xia
The Latin tableau conjecture
Timothy Y. Chow
;
Mark G. Tiefenbruck
Stability of Cayley graphs and Schur rings
Ademir Hujdurović
;
István Kovács
Lexicographic shellability of sects
Aram Bingham
;
Néstor Fernando Díaz Morera
Bijectivizing the PT-DT correspondence
Cruz Godar
;
Benjamin Young
The largest size of \((t, t+d, t+2d)\)-core partitions
Hyunsoo Cho
;
Kyeongjun Lee
;
Hayan Nam
A variable version of the quasi-kernel conjecture
Jiangdong Ai
;
Xiangzhou Liu
;
Fei Peng
Weak Bruhat interval modules of finite-type \(0\)-Hecke algebras and projective covers
Joshua Bardwell
;
Dominic Searles
The repetition threshold for ternary rich words
James Currie
;
Lucas Mol
;
Jarkko Peltomäki
Covering numbers of some irreducible characters of the symmetric group
Rijubrata Kundu
;
Velmurugan S
Sommaire du
Fascicule no. 3
Colouring complete multipartite and Kneser-type digraphs
Ararat Harutyunyan
;
Gil Puig i Surroca
Counting graph orientations with no directed triangles
Pedro Araújo
;
Fábio Botler
;
Guilherme Oliveira Mota
The complexity of the greedoid Tutte polynomial
Christopher Knapp
;
Steven Noble
On subdivisions of four blocks cycles with two non-consecutive blocks of length one in digraphs with large chromatic number
Darine Al-Mniny
;
Soukaina Zayat
Forbidden pairs for traceability of 2-connected graphs
Shipeng Wang
;
Liming Xiong
Pattern-avoiding modified ascent sequences
Giulio Cerbai
Rainbow common graphs must be forests
Yihang Sun
Characterizations of perfectly clustering words
Mélodie Lapointe
;
Christophe Reutenauer
On the fractional matching extendability of Cayley graphs of abelian groups
Boštjan Kuzman
;
Primož Šparl
Hindrance from a wasteful partial linkage
Attila Joó
De Bruijn sequences: from games to shift-rules to a proof of the Fredricksen-Kessler-Maiorana theorem
Gal Amram
;
Amir Rubin
;
Yotam Svoray
;
Gera Weiss
Isoperimetry in product graphs
Sahar Diskin
;
Wojciech Samotij
Flag-transitive point-primitive quasi-symmetric \(2\)-designs and exceptional groups of Lie type
Jianbing Lu
A lower bound on the saturation number and a strengthening for triangle-free graphs
Calum Buchanan
;
Puck Rombach
Clustered colouring of graph products
Rutger Campbell
;
J. Pascal Gollin
;
Kevin Hendrey
;
Thomas Lesgourgues
;
Bojan Mohar
;
Youri Tamitegama
;
Jane Tan
;
David R. Wood
On the number of monochromatic cliques in a graph
Deepak Bal
;
Jonathan Cutler
;
Luke Pebody
Thin edges in claw-free bricks
Jinxin Xue
;
Fuliang Lu
On Fourier coefficients of sets with small doubling
Ilya D. Shkredov
On card guessing games: limit law for one-time riffle shuffle
Markus Kuba
;
Alois Panholzer
Restricted van der Waerden theorem for nilprogressions
Sayan Goswami
Bakry-Émery and Ollivier Ricci curvature of Cayley graphs
David Cushing
;
Supanat Kamtue
;
Riikka Kangaslampi
;
Shiping Liu
;
Florentin Münch
;
Norbert Peyerimhoff
Alon's transmitting problem and multicolor Beck-Spencer Lemma
Norihide Tokushige
A new strategy for finding spanning trees without small degree stems
Michitaka Furuya
;
Shoichi Tsuchiya
Invariant equations in many variables
Tomasz Kościuszko
On the number of generalized numerical semigroups
Sean Li
Characterising 4-tangles through a connectivity property
Johannes Carmesin
;
Jan Kurkofka
A note on strong blocking sets and higgledy-piggledy sets of lines
Stefano Lia
;
Geertrui Van de Voorde
Cops and robber -- when capturing is not surrounding
Paul Jungeblut
;
Samuel Schneider
;
Torsten Ueckerdt
Paths, cycles and sprinkling in random hypergraphs
Oliver Cooley
Rainbow triangles sharing one common vertex or edge
Xiaozheng Chen
;
Bo Ning
Combinatorics of Castelnuovo-Mumford regularity of binomial edge ideals
Adam LaClair
Structure and growth of \(\mathbb{R}\)-Bonacci words
Sergey Dovgal
;
Sergey Kirgizov
\(s\)-stable Kneser graphs are Hamiltonian
Agustina V. Ledezma
;
Adrián Pastine
Bounded fractional intersecting families are linear in size
Niranjan Balachandran
;
Shagnik Das
;
Brahadeesh Sankarnarayanan
Creating spanning trees in Waiter-Client games
Grzegorz Adamski
;
Sylwia Antoniuk
;
Małgorzata Bednarska-Bzdęga
;
Dennis Clemens
;
Fabian Hamann
;
Yannick Mogge
Treewidth is NP-complete on cubic graphs
Hans Bodlaender
;
Édouard Bonnet
;
Lars Jaffke
;
Dušan Knop
;
Paloma Lima
;
Martin Milanič
;
Sebastian Ordyniak
;
Sukanya Pandey
;
Ondřej Suchý
A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor
Linsong Wei
;
Yuqi Xu
;
Weihua Yang
;
Yunxia Zhang
A note on directed analogues of the Sidorenko and forcing conjectures
Jacob Fox
;
Zoe Himwich
;
Nitya Mani
;
Yunkun Zhou
Some results on fractional vs. expectation thresholds
Thomas Fischer
;
Yury Person
A note on the map expansion of Jack polynomials
Houcine Ben Dali
Shotgun assembly of Linial-Meshulam model
Kartick Adhikari
;
Sukrit Chakraborty
LDP polygons and the number 12 revisited
Ulrike Bücking
;
Christian Haase
;
Karin Schaller
;
Jan-Hendrik de Wiljes
Star colouring and locally constrained graph homomorphisms
Cyriac Antony
;
Shalu M. A.
Enumerating 1324-avoiders with few inversions
Svante Linusson
;
Emil Verkama
Clique covers of complete graphs and piercing multitrack intervals
János Barát
;
András Gyárfás
;
Gábor N. Sárközy
Bounding the SNPR distance between two tree-child networks using generalised agreement forests
Steven Kelk
;
Simone Linz
;
Charles Semple
Descents and flag major index on conjugacy classes of colored permutation groups without short cycles
Kevin Liu
;
Mei Yin
Dimensions of compositions modulo a prime
Jia Huang
The multi-generating function for intervals in Young's lattice: some comments on a paper by Azam and Richmond
Jan Snellman
A note on the structure of locally finite planar quasi-transitive graphs
Ugo Giocanti
Cubic edge-transitive graphs of order \(2p^4\)
Xue Wang
;
Sejeong Bang
;
Jin-Xin Zhou
The free product of \(q\)-matroids
Gianira N. Alfarano
;
Eimear Byrne
;
Andrew Fulcher
A linear lower bound for the square energy of graphs
Saieed Akbari
;
Hitesh Kumar
;
Bojan Mohar
;
Shivaramakrishna Pragada
Universality in prelimiting tail behavior for regular subgraph counts in the Poisson regime
Mriganka Basu Roy Chowdhury
On co-edge-regular graphs with \(4\) distinct eigenvalues
Hong-Jun Ge
;
Jack H. Koolen
Sommaire du
Fascicule no. 4
Counting substructures and eigenvalues. II: Quadrilaterals
Bo Ning
;
Mingqing Zhai
Forbidden subgraphs and complete partitions
John Byrne
;
Michael Tait
;
Craig Timmons
On Vizing's problem for triangle-free graphs
Ross J. Kang
;
Matthieu Rosenfeld
Transitive cornerations in maps
Micael Toledo
;
Alejandra Ramos-Rivera
;
Primož Potočnik
;
Stephen Wilson
The partial search order problem
Robert Scheffler
Sketches, moves and partitions: counting regions of Catalan deformations of reflection arrangements
Priyavrat Deshpande
;
Krishna Menon
Graphs of bounded chordality
Aristotelis Chaniotis
;
Babak Miraftab
;
Sophie Spirkl
On the cop number of string graphs
Harmender Gahlawat
;
Sandip Das
Ratliff property of edge ideals of weighted oriented graphs
Arindam Banerjee
;
Kanoy Kumar Das
;
Pritam Roy
Invertibility in the misère multiverse
Alfie Davies
;
Vishal Yadav
The \(P\)-associahedron \(f\)-vector is a comparability invariant
Son Nguyen
;
Andrew Sack
Degree-similar graphs
Chris Godsil
;
Wanting Sun
A short proof of Seymour's 6-flow theorem
Matt DeVos
;
Kathryn Nurse
Strong odd colorings in graph classes of bounded expansion
Michał Pilipczuk
A spectral version of the theorem of Zykov and Erdős
Loujun Yu
;
Yuejian Peng
Hitting \(k\) primes by dice rolls
Noga Alon
;
Yaakov Malinovsky
;
Lucy Martinez
;
Doron Zeilberger
Transversal panconnectedness in graph collections
Wanting Sun
;
Guanghui Wang
;
Lan Wei
Abstract regular polytopes of finite irreducible Coxeter groups
Malcolm Hoong Wai Chen
;
Peter Rowley
Pattern avoidance and the fundamental bijection
Kassie Archer
;
Robert P. Laudone
Inequalities associated with the root sequences of \(P\)-recursive sequences
Zhongjie Li
The first Roe homology group of locally finite graphs
Rémi Bottinelli
;
Tom Kaiser
Equatorial flow triangulations of Gorenstein flow polytopes
Benjamin Braun
;
Alvaro Cornejo
Minimal cellular resolutions of path ideals
Trung Chau
;
Selvi Kara
;
Wang Kyle
Complement avoidance in binary words
James Currie
;
Ľubomíra Dvořáková
;
Pascal Ochem
;
Daniela Opočenská
;
Narad Rampersad
;
Jeffrey Shallit
Revisiting extremal graphs having no stable cutsets
Johannes Rauch
;
Dieter Rautenbach
Lattice structure for orientations of graphs
Jim Propp
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
Pierre Aboulker
;
Frédéric Havet
;
François Pirot
;
Juliette Schabanel
Sharp Szemerédi-Trotter constructions from arbitrary number fields
Gabriel Currier
Mock Alexander polynomials
Neslihan Gügümcü
;
Louis Kauffman
\(R(3, 10) \leqslant 41\)
Vigleik Angeltveit
Alternating paths in oriented graphs with large semidegree
Jozef Skokan
;
Mykhaylo Tyomkyn
Exponential odd-distance sets under the Manhattan metric
Alberto Espuny Díaz
;
Emma Hogan
;
Freddie Illingworth
;
Lukas Michel
;
Julien Portier
;
Jun Yan
A characterization of generalized cospectrality of rooted graphs with applications in graph reconstruction
Wei Wang
;
Wenqiang Wen
;
Songlin Guo
Equating inv-quinv formulas for the \(q\)-Whittaker and modified Hall-Littlewood functions
Aritra Bhattacharya
Propp's benzels and Lai's nearly symmetric hexagons with holes
Seok Hyun Byun
;
Mihai Ciucu
;
Yi-Lin Lee
Stability of transversal Hamilton cycles and paths
Yangyang Cheng
;
Katherine Staden
A conjecture on the Nordhaus-Gaddum product type inequality for Laplacian eigenvalue of a graph
Qi Chen
;
Ji-Ming Guo
;
Wen-Jun Li
;
Zhiwen Wang
On list extensions of the majority edge colourings
Paweł Pękała
;
Jakub Przybyło
Probabilistic \((m, n)\)-parking functions
Pamela Harris
;
Rodrigo Ribeiro
;
Mei Yin
Further Results on Latin Squares with Disjoint Subsquares using Rational Outline Squares
Tara Kemp
;
James G. Lefevre
Solving Maker-Breaker Games on 5-Uniform Hypergraphs is PSPACE-Complete
Finn Koepke
Equality on all #CSP Instances Yields Constraint Function Isomorphism via Interpolation and Intertwiners
Ben Young
Revisiting The Rédei-Berge Symmetric Functions via Matrix Algebra
John Irving
;
Mohamed Omar
Intervals in Dyck paths and the wreath conjecture
Jan Petr
;
Pavel Turek
Structure of Tight
$(k,0)$
-Stable Graphs
Dingding Dong
;
Sammy Luo
Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
Benjamin Testart
How Many Random Edges Make an Almost-Dirac Graph Hamiltonian?
Alberto Espuny Díaz
;
Richarlotte Valérà Razafindravola
Primeness of Generalized Parking Functions
Sam Armon
;
Joanne Beckford
;
Dillon Hanson
;
Naomi Krawzik
;
Olya Mandelshtam
;
Lucy Martinez
;
Catherine Yan
On the Erdős-Szekeres Problem for Convex Permutations and Orthogonally Convex Point Sets
Heather S. Blake
;
Stefan Felsner
;
Rimma Hämäläinen
;
Marcin Witkowski
A Uniform Bound on Almost Colour-Balanced Perfect Matchings in Colour-Balanced Complete Graphs
Lawrence Hollom
On Vertex-Girth-Regular Graphs: (Non-)Existence, Bounds and Enumeration
Robert Jajcay
;
Jorik Jooken
;
István Porupsánszki
Some orbits of a two-vertex stabilizer in a Grassmann graph
Ian Seong
On the Spectral Turán Problems for Bipartite Hypergraphs
Lusheng Fang
;
Guorong Gao
;
An Chang
;
Yuan Hou
Non-Trivial Squares and Sidorenko's Conjecture
Pranav Garg
;
Annie Raymond
;
Amanda Redlich
Turán Number for Bushes
Alexandr Kostochka
;
Zoltán Füredi
Asymptotic Analysis and Efficient Random Sampling of Directed Ordered Acyclic Graphs
Martin Pépin
;
Alfredo Viola
Word Length, Bias and Bijections in Penney's Ante
Matthew Drexel
;
Xuanshan Peng
;
Jacob Richey
Paths with two blocks in oriented graphs of large minimum semi-degree
Bin Chen
;
Xinmin Hou
;
Xinyu Zhou
Integral Ricci Curvature for Graphs
Xavier Ramos Olivé
A classification of
$Q$
-polynomial distance-regular graphs with girth
$6$
Štefko Miklavič
Changing almost perfect nonlinear functions on affine subspaces of small codimensions
Hiroaki Taniguchi
;
Alexandr Polujan
;
Alexander Pott
;
Razi Arshad
Infinite Families of Congruences Modulo 81 for Overpartitions with Restricted Odd Differences
Li Zhang
Improved Two-Colour Rado Numbers for Linear Equations with Certain Coefficients
Ishan Arora
;
Srashti Dwivedi
;
Amitabha Tripathi
Small Ramsey Numbers for Books, Wheels, and Generalizations
Bernard Lidický
;
Gweneth McKinley
;
Florian Pfender
;
Steven Van Overberghe
Extremal Number of Arborescences
Aditya Bandekar
;
Péter Csikvári
;
Benjamin Mascuch
;
Damján Tárkányi
;
Márton Telekes
;
Lilla Tóthmérész
On Faces and Hilbert Bases of Kostka Cones
Amanda Burcroff
Logical Limit Laws for Mallows Random Permutations
Tobias Müller
;
Fiona Skerman
;
Teun W. Verstraaten
Linear bounds on treewidth in terms of excluded planar minors
Jochen Pascal Gollin
;
Kevin Hendrey
;
Sang-il Oum
;
Bruce Reed
Covering the hypercube, the uncertainty principle, and an interpolation formula
Paata Ivanisvili
;
Ohad Klein
;
Roman Vershynin
Brun's inequality for a geometric lattice
M. Ram Murty
;
Sunil Naik