Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 31 (2024)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Integer decomposition property of polytopes
Sharon Robins
Triangles and subgraph probabilities in random regular graphs
Pu Gao
Convexity, squeezing, and the Elekes-Szabó theorem
Oliver Roche-Newton
;
Elaine Wong
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
Manu Basavaraju
;
L. Sunil Chandran
;
Mathew Francis
;
Ankur Naskar
Critical groups of arithmetical structures on star graphs and complete graphs
Kassie Archer
;
Alexander Diaz-Lopez
;
Darren Broderick Glass
;
Joel Louwsma
Abelian sandpiles on Sierpiński gasket graphs
Robin Kaiser
;
Ecaterina Sava-Huss
;
Yuwen Wang
A note on Ramsey numbers involving large books
Meng Liu
;
Yusheng Li
Weak Heffter arrays and biembedding graphs on non-orientable surfaces
Simone Costa
;
Lorenzo Mella
;
Anita Pasotti
On extended boundary sequences of morphic and Sturmian words
Michel Rigo
;
Manon Stipulanti
;
Markus Whiteland
Weighted projections of alternating sign matrices: Latin-like squares and the ASM polytope
Cian O'Brien
Power of \(k\) choices in the semi-random graph process
Paweł Prałat
;
Harjas Singh
Topology of complements of skeletons
Rowan Rowlands
A comparison of Integer partitions based on smallest part
Damanvir Singh Binner
;
Amarpreet Rattan
The virtual cactus group and Littelmann paths
Jacinta Torres
Matroid lifts and representability
Daniel Irving Bernstein
;
Zach Walsh
New hereditary and mutation-invariant properties arising from forks
Tucker Ervin
An embedding of the skein action on set partitions into the skein action on matchings
Jesse Kim
Incidences of cubic curves in finite fields
Audie Warren
On some extremal and probabilistic questions for tree posets
Balázs Patkós
;
Andrew Treglown
Generating new partition identities via a generalized continued fraction algorithm
Wael Baalbaki
;
Thomas Garrity
Balanced nontransitive dice: existence and probability
Dohyeon Kim
;
Ringi Kim
;
Wonjun Lee
;
Yuhyeon Lim
;
Yoojin So
Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
Pierre Aboulker
;
Quentin Vermande
Bijection between trees in Stanley character formula and factorizations of a cycle
Karolina Trokowska
;
Piotr Śniady
An upper bound for the number of rectangulations of a planar point set
Hannah Ashbach
;
Kiki Pichini
Spectral extremal problem on disjoint color-critical graphs
Xingyu Lei
;
Shuchao Li
Spanning tree bounds for grid graphs
Kristopher Tapp
Hurwitz orbits on reflection factorizations of parabolic quasi-Coxeter elements
Theo Douvropoulos
;
Joel Brewster Lewis
Extremal results for graphs avoiding a rainbow subgraph
Zhen He
;
Peter Frankl
;
Ervin Győri
;
Zequn Lv
;
Nika Salia
;
Casey Tompkins
;
Kitti Varga
;
Xiutao Zhu
Generalized splines on graphs with two labels and polynomial splines on cycles
Portia Anderson
;
Jacob P. Matherne
;
Julianna Tymoczko
Binding number, \(k\)-factor and spectral radius of graphs
Dandan Fan
;
Huiqiu Lin
Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues
Wen-Jun Li
;
Ji-Ming Guo
A nearly finitary matroid that is not \(k\)-nearly finitary
Patrick Tam
Piercing all translates of a set of axis-parallel rectangles
Adrian Dumitrescu
;
Josef Tkadlec
Alon-Boppana-type bounds for weighted graphs
Alexander Polyanskii
;
Rynat Sadykov
A strengthening and an efficient implementation of Alon-Tarsi list coloring method
Zdeněk Dvořák
Some identities involving \(q\)-Stirling numbers of the second kind in type B
Mingjian Ding
;
Jiang Zeng
Wreath products and projective system of non-Schurian association schemes
Makoto Matsumoto
;
Kento Ogawa
The critical groups of Adinkras up to 2-rank of Cayley graphs
Chi Ho Yuen
Hamiltonian intervals in the lattice of binary paths
I. Tasoulas
;
K. Manes
;
A. Sapounakis
Degree factors with red-blue coloring of regular graphs
Michitaka Furuya
;
Mikio Kano
Wiener indices of minuscule lattices
Colin Defant
;
Valentin Féray
;
Philippe Nadeau
;
Nathan Williams
A discrete variation of the Littlewood-Offord problem
Hossein Esmailian
;
Ebrahim Ghorbani
Sharp degree bounds for fake weighted projective spaces
Andreas Bäuerle
On the concentration of the chromatic number of random graphs
Erlang Surya
;
Lutz Warnke
Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision
Rong Chen
;
Yidong Zhou
Logarithms of Catalan generating functions: a combinatorial approach
Sabine Jansen
;
Leonid Kolesnikov
Cores of partitions in rectangles
Arvind Ayyer
;
Shubham Sinha
Demazure product of permutations and hopping
Tina Li
;
Suho Oh
;
Edward Richmond
;
Grace Yan
;
Kimberly You
The zonotopal algebra of the broken wheel graph and its generalization
Sarah B. Brodsky
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31
Araya Makoto
;
Masaaki Harada
;
Tonchev Vladimir
Bidding combinatorial games
Prem Kant
;
Urban Larsson
;
Ravi K. Rai
;
Akshay V. Upasany
A spectral extremal problem on non-bipartite triangle-free graphs
Yongtao Li
;
Lihua Feng
;
Yuejian Peng
Enumeration of sets of mutually orthogonal Latin rectangles
Gerold Jäger
;
Klas Markström
;
Lars-Daniel Öhman
;
Denys Shcherbak
Cobiased graphs: single-element extensions and elementary quotients of graphic matroids
Daniel Slilaty
;
Thomas Zaslavsky
Reflect-push methods. I: Two dimensional techniques
Nikola Kuzmanovski
;
Jamie Radcliffe
Poset structure concerning cylindric diagrams
Takeshi Suzuki
;
Kento Nakada
;
Yoshitaka Toyosawa
The largest crossing number of tanglegrams
Éva Czabarka
;
Junsheng Liu
;
László Székely
Spectral radius of graphs with given size and odd girth
Zhenzhen Lou
;
Lu Lu
;
Xueyi Huang
Schnyder woods and Alon-Tarsi number of planar graphs
Jakub Kozik
;
Bartosz Podkanowicz
An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
Masahiro Sanka
;
Songling Shan
The squish map and the \(\mathrm{SL}_2\) double dimer model
Leigh Foster
;
Benjamin Young
Bounding mean orders of sub-\(k\)-trees of \(k\)-trees
Stijn Cambie
;
Bradley McCoy
;
Stephan Wagner
;
Corrine Yap
Interlacing property of a family of generating polynomials over Dyck paths
Bo Wang
;
Candice X.T. Zhang
Crystal isomorphisms and Mullineux involution. II
Nicolas Jacon
;
Cédric Lecouvey
Parabolic Tamari lattices in linear type \(B\)
Wenjie Fang
;
Henri Mühle
;
Jean-Christophe Novelli
On symmetric bi-Cayley graphs of prime valency on nonabelian simple groups
Ran Ju
;
Jing jian Li
;
Zai ping Lu
Highly connected graphs have highly connected spanning bipartite subgraphs
Raphael Yuster
An asymptotically sharp bound on the maximum number of independent transversals
Jake Ruotolo
;
Kevin Wang
;
Fan Wei
On disjunctive Rado numbers for some sets of equations
A. Dileep
;
Jai Moondra
;
Amitabha Tripathi
On the anti-Ramsey threshold for non-balanced graphs
Pedro Araújo
;
Taísa Martins
;
Letícia Mattos
;
Walner Mendonça
;
Luiz Moreira
;
Guilherme O. Mota
Sommaire du
Fascicule no. 2
Partial alternating sign matrix bijections and dynamics
Dylan Heuer
Flag-transitive, point-imprimitive 2-designs and direct products of symmetric groups
Jianfu Chen
;
Shenglin Zhou
;
Jiaxin Shen
A 2-stable family of triple systems
Yixiao Zhang
;
Jianfeng Hou
;
Heng Li
Improved bounds for cross-Sperner systems
Natalie Behague
;
Akina Kuperus
;
Natasha Morrison
;
Ashna Wright
An extremal graph problem on a grid and an isoperimetric problem for polyominoes
Andrew Vince
Cubic graphs with colouring defect 3
Ján Karabáš
;
Edita Máčajová
;
Roman Nedela
;
Martin Škoviera
A generalization of the dual immaculate quasisymmetric functions in partially commutative variables
Spencer Daugherty
Proof of a conjecture of Nath and Sellers on simultaneous core partitions
Yetong Sha
;
Huan Xiong
Hardinian arrays
Robert Dougherty-Bliss
;
Manuel Kauers
Line-transitive point-imprimitive linear spaces with Fang-Li parameter \(\mathrm{gcd}(k, r)\) at most \(12\)
Wenya Hao
;
Haiyan Guan
;
Yajie Wang
The Ramsey numbers of squares of paths and cycles
Domenico Mergoni Cecchelli
;
Peter Allen
;
Jozef Skokan
;
Barnaby Roberts
Independent dominating sets in planar triangulations
Fábio Botler
;
Cristina G. Fernandes
;
Juan Gutiérrez
Metric dimension of a direct product of three complete graphs
Briana Foster-Greenwood
;
Christine Uhl
A remark on continued fractions for permutations and D-permutations with a weight \(-1\) per cycle
Bishal Deb
;
Alan D. Sokal
Ordered unavoidable sub-structures in matchings and random matchings
Andrzej Dudek
;
Jarosław Grytczuk
;
Andrzej Ruciński
The \(k\)-XORSAT threshold revisited
Amin Coja-Oghlan
;
Mihyun Kang
;
Lena Krieg
;
Maurice Rolvien
Hamilton cycles in the line graph of a random hypergraph
Katarzyna Rybarczyk
Outer strong blocking sets
Gianira N. Alfarano
;
Martino Borello
;
Alessandro Neri
Robinson-Schensted-Knuth superinsertion and super Frobenius formulae
Deke Zhao
Combinatorics and representation theory of special cases of Chern plethysm
Nathaniel Libman
;
Gidon Orelowitz
Labelled well-quasi-order in juxtapositions of permutation classes
Robert Brignall
Colored unavoidable patterns and balanceable graphs
Matt Bowen
;
Adriana Hansberg
;
Amanda Montejano
;
Alp Müyesser
On ordered Ramsey numbers of matchings versus triangles
Martin Balko
;
Marian Poljak
On optimal point sets determining distinct triangles
Eyvindur Palsson
;
Edward Yu
On the (non-)existence of tight distance-regular graphs: a local approach
Jack Koolen
;
Jae-Ho Lee
;
Shuang-Dong Li
;
Yun-Han Li
;
Xiaoye Liang
;
Ying-Ying Tan
Decompositions of unit hypercubes and the reversion of a generalized Möbius series
Yu Hin (Gary) Au
Central limit theorems via analytic combinatorics in several variables
Stephen Melczer
;
Tiadora Ruza
The Bhargava greedoid as a Gaussian elimination greedoid
Darij Grinberg
Critical exponent of binary words with few distinct palindromes
L’ubomı́ra Dvořáková
;
Pascal Ochem
;
Daniela Opočenská
Infinite families of \((q^2+1)\)-tight sets of quadrics with an automorphism group \(\mathrm{PSp}(n, q), n=4, 6\)
Antonio Cossidente
Classification of cubic tricirculant nut graphs
Ivan Damnjanović
;
Nino Bašić
;
Tomaž Pisanski
;
Arjana Žitnik
Spectral Turán-type problems on cancellative hypergraphs
Zhenyu Ni
;
Lele Liu
;
Liying Kang
Improved bounds concerning the maximum degree of intersecting hypergraphs
Peter Frankl
;
Jian Wang
Spectral extremal results on trees
Longfei Fang
;
Huiqiu Lin
;
Jinlong Shu
;
Zhiyuan Zhang
Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
Andrii Arman
;
Andriy Bondarenko
;
Andriy Prymak
;
Danylo Radchenko
On kernels of descent statistics
William Clark
;
Yan Zhuang
Strong Erdős-Hajnal properties in chordal graphs
Minho Cho
;
Andreas Holmsen
;
Jinha Kim
;
Minki Kim
Vertex and edge orbits in nut graphs
Nino Bašić
;
Patrick W. Fowler
;
Tomaž Pisanski
Constructing graphs with no independent transversals
Penny Haxell
;
Ronen Wdowinski
On semi-restricted rock, paper, scissors
Svante Janson
Coarse geometry of quasi-transitive graphs beyond planarity
Louis Esperet
;
Ugo Giocanti
Pósa-type results for Berge hypergraphs
Nika Salia
BE-diperfect digraphs with stability number two
Caroline A. de Paula Silva
;
Cândida Nunes da Silva
;
Orlando Lee
Two graph games
David Chodounský
;
Jindřich Zapletal
Asymptotic bounds for the number of closed and privileged words
Daniel Gabrić
A note on lenses in arrangements of pairwise intersecting circles in the plane
Rom Pinchasi
Nowhere-zero 3-flows in signed planar graphs
Jiaao Li
;
Yulai Ma
;
Zhengke Miao
;
Yongtang Shi
;
Weifan Wang
Matroids arising from nested sequences of flats in projective and affine geometries
Matthew Mizell
;
James Oxley
The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
Zhicheng Gao
On triangle-free graphs maximizing embeddings of bipartite graphs
Dmitriy Gorovoy
;
Andrzej Grzesik
;
Justyna Jaworska
Bounded-degree planar graphs do not have bounded-degree product structure
Vida Dujmović
;
Gwenaël Joret
;
Piotr Micek
;
Pat Morin
;
David Wood
Quasi-random Boolean functions
Nicholas Sieger
;
Fan Chung
Rotation systems and simple drawings in surfaces
Rosna Paul
;
Gelasio Salazar
;
Alexandra Weinberger
Gröbner bases for increasing sequences
Gábor Hegedüs
;
Lajos Rónyai
Local rainbow colorings for various graphs
Xinbu Cheng
;
Zixiang Xu
Quantitative Helly-type theorems via hypergraph chains
Attila Jung
Hamilton powers of Eulerian digraphs
Enrico Colón
;
John Urschel
4-Chromatic graphs have at least four cycles of length 0 mod 3
Sean Kim
;
Michael Picollelli
Bender-Knuth involutions for types \(\mathrm{B}\) and \(\mathrm{C}\)
Álvaro Gutiérrez
New bounds for the same-type lemma
Boris Bukh
;
Alexey Vasileuski
Sommaire du
Fascicule no. 3
A Hall-type condition for path covers in bipartite graphs
Mikhail Lavrov
;
Jennifer Vandenbussche
A short proof of Kahn-Kalai conjecture
Phuc Tran
;
Van Vu
Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding
Christian Bean
;
Émile Nadeau
;
Jay Pantone
;
Henning Ulfarsson
Note on the spectra of Steiner distance hypermatrices
Joshua Cooper
;
Zhibin Du
Foot-sorting for socks
Colin Defant
;
Noah Kravitz
On the matchings-Jack and hypermap-Jack conjectures for labelled matchings and star maps
Andrei L. Kanunnikov
;
Valentin V. Promyslov
;
Ekaterina A. Vassilieva
Spectral extremal graphs without intersecting triangles as a minor
Xiaocong He
;
Yongtao Li
;
Lihua Feng
Hankel determinants of \(q\)-Stirling numbers
Yue Cai
;
Ting Yang
Hopf algebras from poset growth models
Karen Yeats
;
Stav Zalel
Extreme values of permutation statistics
Philip Dörr
;
Thomas Kahle
An extension of Stanley's symmetric acyclicity theorem to signed graphs
Oscar Coppola
;
Jake Huryn
;
Michael Reilly
The \(s\)-weak order and \(s\)-permutahedra. II: The combinatorial complex of pure intervals
Cesar Ceballos
;
Viviane Pons
A discrete Marstrand type slicing theorem with the mass dimension
Aritro Pathak
A note on the maximum number of \(k\)-powers in a finite word
Shuo Li
;
Jakub Pachocki
;
Jakub Radoszewski
Constructing maximal pipedreams of double Grothendieck polynomials
Chen-An Chou
;
Tianyi Yu
Online size Ramsey numbers: odd cycles vs connected graphs
Grzegorz Adamski
;
Małgorzata Bednarska-Bzdęga
The geometry and combinatorics of some Hessenberg varieties related to the permutohedral variety
Jan-Li Lin
Polyharmonic functions in the quarter plane
Andreas Nessmann
On the number of partitions of \(n\) into exactly \(m\) parts whose even parts are distinct
Dhanasin Namphaisaal
;
Teerapat Srichan
Computing excluded minors for classes of matroids representable over partial fields
Nick Brettell
;
Rudi Pendavingh
The combinatorics behind the leading Kazhdan-Lusztig coefficients of braid matroids
Alice L.L. Gao
;
Nicholas James Proudfoot
;
Arthur L.B. Yang
;
Zhong-Xue Zhang
Degree sequences of triangular multigraphs
John Talbot
;
Jun Yan
Turán-type problems on \([a, b]\)-factors of graphs, and beyond
Yifang Hao
;
Shuchao Li
New equidistributions on plane trees and decompositions of \(132\)-avoiding permutations
Zi-Wei Bai
;
Ricky X. F. Chen
On the maximum spread of planar and outerplanar graphs
Zelong Li
;
William Linz
;
Linyuan Lu
;
Zhiyu Wang
The stochastic sandpile model on complete graphs
Thomas Selig
Automorphism groups of Cayley graphs generated by general transposition sets
Dion Gijswijt
;
Frank de Meijer
On the Hopf algebra of noncommutative symmetric functions in superspace
Diego Arcis
;
Camilo González
;
Sebastián Márquez
Cats in cubes
Noah Kravitz
;
Noga Alon
Subgraph games in the semi-random graph process and its generalization to hypergraphs
Natalie Behague
;
Trent Marbach
;
Paweł Prałat
;
Andrzej Ruciński
Forbidden subgraphs restricting vertices of degree two in a spanning tree
Michitaka Furuya
;
Shoichi Tsuchiya
Congruence properties modulo powers of \(2\) for \(4\)-regular partitions
Julia Q. D. Du
;
Dazhao Tang
Minimum degree threshold for \(H\)-factors with high discrepancy
Domagoj Bradač
;
Micha Christoph
;
Lior Gishboliner
A localized approach to generalized Turán problems
Rachel Kirsch
;
JD Nir
Improved lower bound for Frankl's union-closed sets conjecture
Ryan Alweiss
;
Brice Huang
;
Mark Sellke
Sommaire du
Fascicule no. 4
Combinatorics of \((m, n)\)-word lattices
Henri Mühle
Word-representable graphs: orientations, posets, and bounds
Zion Hefty
;
Paul Horn
;
Colby Muir
;
Andrew Owens
Stabilities for non-uniform \(t\)-intersecting families
Yongtao Li
;
Biao Wu
Cyclotomic generating functions
Sara Billey
;
Joshua Swanson
The bright side of simple heuristics for the TSP
Alan Frieze
;
Wesley Pegden
Thresholds for patterns in random permutations with a given number of inversions
David Bevan
;
Dan Threlfall
Random generation of subgroups of the modular group with a fixed isomorphism type
Frédérique Bassino
;
Cyril Nicaud
;
Pascal Weil
On the threshold for Szemerédi's theorem with random differences
Jop Briët
;
Davi Castro-Silva
Cyclic orderings of paving matroids
Sean McGuinness
Hamiltonians of bipartite walks
Qiuting Chen
;
Chris Godsil
;
Mariia Sobchuk
;
Hanmeng Zhan
Semidefinite programming bounds for spherical three-distance sets
Wei-Hsuan Yu
;
Feng-Yuan Liu
A counterexample to directed-KKL
Quentin Dubroff
;
Shivam Nadimpalli
;
Bhargav Narayanan
Combinatorics of double Grothendieck polynomials
Graham Hawkes
Walker-breaker games on \(G_{n, p}\)
Dennis Clemens
;
Pranshu Gupta
;
Yannick Mogge
On the intersecting family process
Alan Frieze
;
Patrick Bennett
;
Andrew Newman
;
Wesley Pegden
Two classes of posets with real-rooted chain polynomials
Christos A. Athanasiadis
;
Theo Douvropoulos
;
Katerina Kalampogia-Evangelinou
Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
Longfei Fang
;
Mingqing Zhai
;
Huiqiu Lin
The algebraic multiplicity of the spectral radius of a uniform hypertree
Lixiang Chen
;
Changjiang Bu
Some locally Kneser graphs
Andries Brouwer
The enriched \(q\)-monomial basis of the quasisymmetric functions
Darij Grinberg
;
Ekaterina Vassilieva
Layered subgraphs of the hypercube
Natalie Behague
;
Imre Leader
;
Natasha Morrison
;
Kada Williams
The chromatic symmetric function of a graph centred at a vertex
Farid Aliniaeifard
;
Victor Wang
;
Stephanie van Willigenburg
From quasi-symmetric to Schur expansions with applications to symmetric chain decompositions and plethysm
Rosa Orellana
;
Franco Saliola
;
Anne Schilling
;
Mike Zabrocki
Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
Nathalie Aubrun
;
Nicolás Bitar
On the \(Q\)-polynomial property of the full bipartite graph of a Hamming graph
Blas Fernández
;
Roghayeh Maleki
;
Štefko Miklavič
;
Giusy Monzillo
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
Florian Hörsch
;
Lucas Picasarri-Arrieta
Permutations that separate close elements, and rectangle packings in the torus
Simon R. Blackburn
;
Tuvi Etzion
On an induced version of Menger's theorem
Kevin Hendrey
;
Sergey Norin
;
Raphael Steiner
;
Jérémie Turcotte
On the \(cd\)-index for alternating descents
Qiongqiong Pan
;
Cheng Qian
Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach
Mahya Ghandehari
;
Teddy Mishura
Modified ascent sequences and Bell numbers
Giulio Cerbai
Dual bipartite \(Q\)-polynomial distance-regular graphs and dual uniform structures
Giusy Monzillo
Polynomial removal lemma for ordered matchings
Lior Gishboliner
;
Borna Šimić
Simplicial complexes with many facets are vertex decomposable
Anton Dochtermann
;
Ritika Nair
;
Jay Schweig
;
Adam Van Tuyl
;
Russ Woodroofe
Bootstrap percolation in strong products of graphs
Boštjan Brešar
;
Jaka Hedžet
Orientation of convex sets
Péter Ágoston
;
Gábor Damásdi
;
Balázs Keszegh
;
Dömötör Pálvölgyi
Polynomial invariants for rooted trees related to their random destruction
Fabian Burghart
Improved lower bounds for Queen's Domination via an exactly-solvable relaxation
Archit Karandikar
;
Akashnil Dutta
Non-standard binary representations and the Stern sequence
Katie Anders
;
Madeline Locus Dawsey
;
Rajat Gupta
;
Joseph Vandehey
Strong greedoid structure of \(r\)-removed \(P\)-orderings
Dmitrii Krachun
;
Rozalina Mirgalimova
A new presentation for Specht modules with distinct parts
Tamar Friedmann
;
Philip J. Hanlon
;
Michelle L. Wachs
Phylogenetic trees defined by at most three characters
Katharina Huber
;
Simone Linz
;
Vincent Moulton
;
Charles Semple
On the algebra generated by three commuting matrices: combinatorial cases
Matthew Satriano
;
Ron Cherny
;
Yohan Song
The group permanent determines the finite abelian group
Mao-sheng Li
;
Hanbin Zhang
Super multiset RSK and a mixed multiset partition algebra
Alexander Wilson
Toggleability spaces of fences
Alec Mertin
;
Svetlana Poznanović
Keller properties for integer tilings
Benjamin Bruce
;
Izabella Łaba
A note on graphs of \(k\)-colourings
Emma Hogan
;
Alex Scott
;
Youri Tamitegama
;
Jane Tan
A note on Hamilton decompositions of even-regular multigraphs
Vincent Pfenninger
The number of spanning trees in 4-regular simple graphs
Jean-Sébastien Sereni
;
Zelealem B. Yilma
On density conditions for transversal trees in multipartite graphs
Leila Badakhshian
;
Victor Falgas-Ravry
;
Maryam Sharifzadeh
On the minimum size of linear sets
Sam Adriaensen
;
Paolo Santonastaso
Bounds on the lettericity of graphs
Sean Mandrick
;
Vincent Vatter
On a new \((21_4)\) polycyclic configuration
Leah Wrenn Berman
;
Gábor Gévay
;
Tomaž Pisanski
Extremal graphs for the suspension of edge-critical graphs
Jianfeng Hou
;
Heng Li
;
Qinghou Zeng
Graph product structure for \(h\)-framed graphs
Michael A. Bekos
;
Giordano Da Lozzo
;
Petr Hliněný
;
Michael Kaufmann
New bounds for odd colourings of graphs
Tianjiao Dai
;
Qiancheng Ouyang
;
François Pirot
The Nevo-Santos-Wilson spheres are shellable
Yirong Yang
Finite \(s\)-geodesic-transitive digraphs
Wei Jin
\((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
Pierre Aboulker
;
Guillaume Aubian
;
Pierre Charbit
;
Stéphan Thomassé
Mixed dimer configuration model in Type \(D\) cluster algebras. II: Beyond the acyclic case
Libby Farrell
;
Gregg Musiker
;
Kayla Wright
An infinite family of connected 1-factorisations of complete 3-uniform hypergraphs
Barbara Maenhaut
;
Jeremy Mitchell
;
Anna Puskás
Compatible split systems on a multiset
Vincent Moulton
;
Guillaume Scholz
Circumference, minimum degree and clique number
Long-Tu Yuan
A complete solution for a nontrivial ruleset with entailing moves
Urban Larsson
;
Richard Nowakowski
;
Carlos Pereira Santos
On generalised majority edge-colourings of graphs
Paweł Pękała
;
Jakub Przybyło
The rational number game
Nathan Bowler
;
Florian Gut
\(K_r\)-saturated graphs and the two families theorem
Asier Calbet
A characterization of one-element commutation classes
Ricardo Mamede
;
José Luis Santos
;
Diogo Soares
Directed graphs without rainbow stars
Dániel Gerbner
;
Andrzej Grzesik
;
Cory Palmer
;
Magdalena Prorok
The minimum number of maximal independent sets in twin-free graphs
Stijn Cambie
;
Stephan Wagner
On a question of Erdős and Gimbel on the cochromatic number
Annika Heckel
Weak Bruhat interval modules for genomic Schur functions
Young-Hun Kim
;
Semin Yoo
Thresholds, expectation thresholds and cloning
Tomasz Przybyłowski
;
Oliver Riordan
Coloring hypergraphs from random lists
Carl Johan Casselgren
Graphs with arbitrary Ramsey number and connectivity
Isabel Ahme
;
Alexander Scott
The lexicographically least binary rich word achieving the repetition threshold
James D. Currie
;
Narad Rampersad
An \(A_\alpha\)-spectral version of the Bhattacharya-Friedland-Peled conjecture
Yuantian Yu
;
Xianya Geng
;
Shuchao Li
Online Ramsey numbers of ordered paths and cycles
Felix Christian Clemen
;
Emily Heath
;
Mikhail Lavrov
On blocking sets of the tangent lines to a nonsingular quadric in \(\mathrm{PG}(3,q), q\) prime
Bart De Bruyn
;
Francesco Pavese
;
Puspendu Pradhan
;
Binod Kumar Sahoo