Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 28 (2021)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Extremal trees with fixed degree sequence
Eric O. D. Andriantiana
;
Valisoa Razanajatovo Misanantenaina
;
Stephan Wagner
Conditions for a bigraph to be super-cyclic
Alexandr Kostochka
;
Mikhail Lavrov
;
Ruth Luo
;
Dara Zirlin
On the spectra of general random mixed graphs
Dan Hu
;
Hajo Broersma
;
Jiangyou Hou
;
Shenggui Zhang
Avoidability of palindrome patterns
Pascal Ochem
;
Matthieu Rosenfeld
The component counts of random injections
Dudley Stark
A polynomial time algorithm to find the star chromatic index of trees
Behnaz Omoomi
;
Elham Roshanbin
;
Marzieh Vahid Dastjerdi
Extending perfect matchings to Hamiltonian cycles in line graphs
Marién Abreu
;
John Baptist Gauci
;
Domenico Labbate
;
Giuseppe Mazzuoccolo
;
Jean Paul Zerafa
Display sets of normal and tree-child networks
Janosch Döcker
;
Simone Linz
;
Charles Semple
Hirzebruch-type inequalities viewed as tools in combinatorics
Piotr Pokora
Monochromatic components in edge-coloured graphs with large minimum degree
Hannah Guggiari
;
Alex Scott
Non-separating planar graphs
Hooman R. Dehkordi
;
Graham Farr
Root cones and the resonance arrangement
Samuel C. Gutekunst
;
Karola Mészáros
;
T. Kyle Petersen
On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs
Zi-Xia Song
;
Jingmei Zhang
Circuit covers of signed Eulerian graphs
Bo Bao
;
Rong Chen
;
Genghua Fan
Classifications of \(\Gamma\)-colored \(d\)-complete posets and upper \(P\)-minuscule Borel representations
Michael Strayer
The non-commuting, non-generating graph of a nilpotent group
Peter Cameron
;
Saul Freedman
;
Colva Roney-Dougal
Birational rowmotion and Coxeter-motion on minuscule posets
Soichi Okada
Towards degree distribution of a duplication-divergence graph model
Krzysztof Turowski
;
Wojciech Szpankowski
Graphs with no induced \(K_{2,t}\)
Freddie Illingworth
Minimum-weight combinatorial structures under random cost-constraints
Alan Frieze
;
Wesley Pegden
;
Gregory B. Sorkin
;
Tomasz Tkocz
The threshold for the full perfect matching color profile in a random coloring of random graphs
Debsoumya Chakraborti
;
Mihir Hasabnis
A randomly weighted minimum spanning tree with a random cost constraint
Alan Frieze
;
Tomasz Tkocz
All minor-minimal apex obstructions with connectivity two
Adam S. Jobson
;
André E. Kézdy
Limit densities of patterns in permutation inflations
Tanya Khovanova
;
Eric Zhang
The \(k\)-cut model in deterministic and random trees
Gabriel Berzunza
;
Xing Shi Cai
;
Cecilia Holmgren
Many cliques with few edges
Rachel Kirsch
;
A. J. Radcliffe
Prisoners, rooms, and light switches
Daniel M. Kane
;
Scott Duke Kominers
Domino tilings of cylinders: connected components under flips and normal distribution of the twist
Nicolau C. Saldanha
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
Andrzej Grzesik
;
Tereza Klimošová
;
Marcin Pilipczuk
;
Michał Pilipczuk
An introduction to supersymmetric cluster algebras
Li Li
;
James Mixco
;
B. Ransingh
;
Ashish K. Srivastava
The smallest matroids with no large independent flat
Peter Nelson
;
Sergey Norin
Inequalities for doubly nonnegative functions
Alexander Sidorenko
The size of the giant joint component in a binomial random double graph
Mark Jerrum
;
Tamás Makai
Coloring the \(n\)-smooth numbers with \(n\) colors
Andrés Eduardo Caicedo
;
Thomas A. C. Chartier
;
Péter Pál Pach
Cycle decompositions of complete digraphs
A. C. Burgess
;
P. Danziger
;
M. T. Javed
Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs
Songling Shan
Refined counting of core partitions into \(d\)-distinct parts
Hannah Burson
;
Simone Sisneros-Thiry
;
Armin Straub
De Finetti lattices and magog triangles
Andrew Beveridge
;
Ian Calaway
;
Kristin Heysse
Classification of toric log del Pezzo surfaces with few singular points
Yusuke Suyama
Supersaturation, counting, and randomness in forbidden subposet problems
Dániel Gerbner
;
Dániel T. Nagy
;
Balázs Patkós
;
Máté Vizer
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
Martin Milanič
;
Nevena Pivač
On prime-valent symmetric Cayley graphs of finite simple groups
Jing Jian Li
;
Jicheng Ma
On the strong Hanani-Tutte theorem
Hooman R. Dehkordi
;
Graham Farr
Largest component and node fault tolerance for grids
Jakub Przybyło
;
Andrzej Żak
Algebraic properties of the coordinate ring of a convex polyomino
Claudia Andrei
On Ramsey-minimal infinite graphs
Jordan Barrett
;
Valentino Vito
On the combinatorics of symmetrized poly-Bernoulli numbers
Beáta Bényi
;
Toshiki Matsusaka
Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization
P. Mark Kayll
;
Esmaeil Parsa
Determining the circular flow number of a cubic graph
Robert Lukoťka
Regularity and the Gorenstein property of \(L\)-convex polyominoes
Viviana Ene
;
Jürgen Herzog
;
Ayesha Asloob Qureshi
;
Francesco Romeo
Shannon capacity and the categorical product
Gábor Simonyi
Generalized Catalan numbers from hypergraphs
Paul E. Gunnells
Skeleton ideals of certain graphs, standard monomials and spherical parking functions
Chanchal Kumar
;
Gargi Lather
;
Sonica
\(k\)-pop stack sortable permutations and \(2\)-avoidance
Murray Elder
;
Yoong Kuan Goh
Induced Ramsey number for a star versus a fixed graph
Maria Axenovich
;
Izolda Gorgol
Symmetric polynomials in the symplectic alphabet and the change of variables \(z_j = x_j + x_j^{-1}\)
Per Alexandersson
;
Luis Angel González-Serrano
;
Egor Maximenko
;
Mario Alberto Moctezuma-Salazar
On self-Mullineux and self-conjugate partitions
Ana Bernal
The Sprague-Grundy functions of saturations of misère Nim
Yuki Irie
On the maximum number of integer colourings with forbidden monochromatic sums
Hong Liu
;
Maryam Sharifzadeh
;
Katherine Staden
Some instances of homomesy among ideals of posets
Shahrzad Haddadan
Sommaire du
Fascicule no. 2
A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
José Aliste-Prieto
;
Logan Crew
;
Sophie Spirkl
;
José Zamora
Prolific permutations
Michael Albert
;
Murray Tannock
A note on transitive union-closed families
James Aaronson
;
David Ellis
;
Imre Leader
Forbidding \(K_{2,t}\) traces in triple systems
Ruth Luo
;
Sam Spiro
Algorithmically distinguishing irreducible characters of the symmetric group
Timothy Y. Chow
;
Jennifer Paulhus
Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude
Julien Courtiel
;
Andrew Elvey Price
;
Irène Marcovici
Almost intersecting families
Peter Frankl
;
Andrey Kupavskii
Restricted extension of sparse partial edge colorings of complete graphs
Carl Johan Casselgren
;
Lan Anh Pham
The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
Jaehoon Kim
;
Sang-il Oum
Ramsey theory for layered semigroups
Jordan Mitchell Barrett
Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
Kasper Szabo Lyngsie
;
Liang Zhong
Grundy domination of forests and the strong product conjecture
Kayla Bell
;
Keith Driscoll
;
Elliot Krop
;
Kimber Wolff
Almost simple groups of Lie type and symmetric designs with \(\lambda\) prime
Seyed Hassan Alavi
;
Mohsen Bayat
;
Ashraf Daneshkhah
Coloring problems on bipartite graphs of small diameter
Victor A. Campos
;
Guilherme C.M. Gomes
;
Allen Ibiapina
;
Raul Lopes
;
Ignasi Sau
;
Ana Silva
The top-degree part in the matchings-Jack conjecture
Adam Burchardt
Almost all permutation matrices have bounded saturation functions
Jesse Geneson
A note on complex-4-colorability of signed planar graphs
Arnfried Kemnitz
;
Margit Voigt
The Graham-Knuth-Patashnik recurrence: symmetries and continued fractions
Jesús Salas
;
Alan D. Sokal
Characters and chromatic symmetric functions
Mark Skandera
Square-free graphs with no induced fork
Maria Chudnovsky
;
Shenwei Huang
;
T. Karthick
;
Jenny Kaufmann
Two maps on affine type \(A\) crystals and Hecke algebras
Nicolas Jacon
On the sizes of bipartite 1-planar graphs
Yuanqiu Huang
;
Zhangdong Ouyang
;
Fengming Dong
A note on the Erdős-Szekeres theorem in two dimensions
Lyuben Lichev
Answers to two questions on the DP color function
Jeffrey A. Mudrock
;
Seth Thomason
Diameter three orientability of bipartite graphs
Bin Chen
;
An Chang
Random perturbation of sparse graphs
Max Hahn-Klimroth
;
Giulia Maesaka
;
Yannick Mogge
;
Samuel Mohr
;
Olaf Parczyk
Extension of Gyárfás-Sumner conjecture to digraphs
Pierre Aboulker
;
Pierre Charbit
;
Reza Naserasr
Rank selection and depth conditions for balanced simplicial complexes
Brent Holmes
;
Justin Lyle
Symplectic keys and Demazure atoms in type \(C\)
João Miguel Santos
Norton algebras of the Hamming graphs via linear characters
Jia Huang
Majority colorings of sparse digraphs
Michael Anastos
;
Ander Lamaison
;
Raphael Steiner
;
Tibor Szabó
Squarefree powers of edge ideals of forests
Nursel Erey
;
Takayuki Hibi
Betti numbers of weighted oriented graphs
Beata Casiday
;
Selvi Kara
A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
Tomasz Schoen
Tomaszewski's problem on randomly signed sums, revisited
Ravi B. Boppana
;
Harrie Hendriks
;
Martien C.A. van Zuijlen
Hidden words statistics for large patterns
Svante Janson
;
Wojciech Szpankowski
Note on long paths in Eulerian digraphs
Charlotte Knierim
;
Maxime Larcher
;
Anders Martinsson
A geometric and combinatorial exploration of Hochschild lattices
Camille Combe
Elastic elements in 3-connected matroids
George Drummond
;
Zach Gershkoff
;
Susan Jowett
;
Charles Semple
;
Jagdeep Singh
On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs
Grace M. X. Li
;
Arthur L. B. Yang
A new upper bound on extremal number of even cycles
Zhiyang He
Large monochromatic components in almost complete graphs and bipartite graphs
Zoltán Füredi
;
Ruth Luo
A generalization of Stiebitz-type results on graph decomposition
Qinghou Zeng
;
Chunlei Zu
Circular chromatic number of signed graphs
Reza Naserasr
;
Zhouningxin Wang
;
Xuding Zhu
Lattice polytopes from Schur and symmetric Grothendieck polynomials
Margaret Bayer
;
Bennet Goeckner
;
Su Ji Hong
;
Tyrrell McAllister
;
McCabe Olsen
;
Casey Pinckney
;
Julianne Vega
;
Martha Yip
On the intersection distribution of degree three polynomials and related topics
Gohar Kyureghyan
;
Shuxing Li
;
Alexander Pott
Structure and colour in triangle-free graphs
N. R. Aravind
;
Stijn Cambie
;
Wouter Cames van Batenburg
;
Rémi de Joannis de Verclos
;
Ross J. Kang
;
Viresh Patel
The normalized matching property in random and pseudorandom bipartite graphs
Niranjan Balachandran
;
Deepanshu Kush
Asymptotics of 3-stack-sortable permutations
Colin Defant
;
Andrew Elvey Price
;
Anthony Guttmann
Hopf algebra structure of generalized quasi-symmetric functions in partially commutative variables
Adam Doliwa
Channels, billiards, and perfect matching 2-divisibility
Grant T. Barkley
;
Ricky Ini Liu
Sommaire du
Fascicule no. 3
Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths
Gaspard Ohlmann
The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
Klaus Metsch
A discrete Morse perspective on knot projections and a generalised clock theorem
Daniele Celoria
;
Naya Yerolemou
Forbidden subgraphs of power graphs
Pallabi Manna
;
Peter J. Cameron
;
Ranjit Mehatari
On automorphisms of direct products of Cayley graphs on abelian groups
Dave Witte Morris
A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
Darij Grinberg
;
Fedor Petrov
Half-graphs, other non-stable degree sequences, and the switch Markov chain
Péter L. Erdős
;
Ervin Győri
;
Tamás Róbert Mezei
;
István Miklós
;
Dániel Soltész
A generalization of the Bollobás set pairs inequality
Jason O'Neill
;
Jacques Verstraete
Linear compactness and combinatorial bialgebras
Eric Marberg
Connector-breaker games on random boards
Dennis Clemens
;
Laurin Kirsch
;
Yannick Mogge
Representing graphs as the intersection of cographs and threshold graphs
Daphna Chacko
;
Mathew C. Francis
Minimal automaton for multiplying and translating the Thue-Morse set
Émilie Charlier
;
Célia Cisternino
;
Adeline Massuir
Partitions and the maximal excludant
Shane Chern
Crossings and nestings over some Motzkin objects and \(q\)-Motzkin numbers
Paul M. Rakoyomamonjy
;
Sandrataniaina R. Andriantsoa
Transition matrices between Young's natural and seminormal representations
Sam Armon
;
Tom Halverson
A note on restricted online Ramsey numbers of matchings
Vojtěch Dvořák
Duality pairs and homomorphisms to oriented and unoriented cycles
Santiago Guzmán-Pro
;
César Hernández-Cruz
Permutations avoiding certain partially-ordered patterns
Kai Ting Keshia Yap
;
David Wehlau
;
Imed Zaguia
Variations on twins in permutations
Andrzej Dudek
;
Jarosław Grytczuk
;
Andrzej Ruciński
A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts
Acadia Larsen
Enumeration of planar constellations with an alternating boundary
Jérémie Bouttier
;
Ariane Carrance
Laplacian fractional revival on graphs
Ada Chan
;
Bobae Johnson
;
Mengzhen Liu
;
Malena Schmidt
;
Zhanghan Yin
;
Hanmeng Zhan
On the independent set sequence of a tree
Abdul Basit
;
David Galvin
Rainbow pancyclicity in graph systems
Yangyang Cheng
;
Guanghui Wang
;
Yi Zhao
On asymmetric colourings of claw-free graphs
Wilfried Imrich
;
Rafał Kalinowski
;
Monika Pilśniak
;
Mariusz Woźniak
Perron and Frobenius meet Carathéodory
Márton Naszódi
;
Alexandr Polyanskii
An upper bound for the size of \(s\)-distance sets in real algebraic sets
Gábor Hegedüs
;
Lajos Rónyai
Nearly Gorenstein rings arising from finite graphs
Takayuki Hibi
;
Dumitru I. Stamate
Packing of mixed hyperarborescences with flexible roots via matroid intersection
Florian Hörsch
;
Zoltán Szigeti
Up- and down-operators on Young's lattice
Ricky Liu
;
Christian Smith
An order on circular permutations
Antoine Abram
;
Nathan Chapelier-Laget
;
Christophe Reutenauer
On the \(P_3\)-hull number of Kneser graphs
Luciano N. Grippo
;
Adrián Pastine
;
Pablo Torres
;
Mario Valencia-Pabon
;
Juan C. Vera
The geometric kernel of integral circulant graphs
J. W. Sander
The unit acquisition number of binomial random graphs
Konstantinos Georgiou
;
Somnath Kundu
;
Paweł Prałat
A note on repeated degrees of line graphs
Shimon Kogan
Spectra of random regular hypergraphs
Ioana Dumitriu
;
Yizhe Zhu
On the joint distribution of descents and signs of permutations
Jason Fulman
;
Gene B. Kim
;
Sangchul Lee
;
T. Kyle Petersen
Stability of stretched root systems, root posets and shards
Will Dana
Bounds on antipodal spherical designs with few angles
Zhiqiang Xu
;
Zili Xu
;
Wei-Hsuan Yu
Counting parabolic double cosets in symmetric groups
Thomas Browning
Permutation reconstruction from a few large patterns
Maria João Gouveia
;
Erkko Lehtonen
Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
Shuliang Bai
;
Linyuan Lu
Eckhoff's problem on convex sets in the plane
Adam S. Jobson
;
André E. Kézdy
;
Jenő Lehel
On finite subnormal Cayley graphs
Shu Jiao Song
The linkedness of cubical polytopes: the cube
Hoa T. Bui
;
Guillermo Pineda-Villavicencio
;
Julien Ugon
Spectral extremal results for hypergraphs
Yuan Hou
;
An Chang
;
Joshua Cooper
The index and spectrum of Lie poset algebras of types B, C, and D
Vincent Coll
;
Nicholas W. Mayers
;
Nicholas Russoniello
Transversals, near transversals, and diagonals in iterated groups and quasigroups
Anna A. Taranenko
Explicit Pieri inclusions
Markus Hunziker
;
John A. Miller
;
Mark Sepanski
Sharp minimum degree conditions for the existence of disjoint theta graphs
Emily Marshall
;
Michael Santana
Tight bounds on the clique chromatic number
Gwenaël Joret
;
Piotr Micek
;
Bruce Reed
;
Michiel Smid
On the maximum diameter of \(k\)-colorable graphs
Éva Czabarka
;
Inne Singgih
;
László A. Székely
A consecutive Lehmer code for parabolic quotients of the symmetric group
Wenjie Fang
;
Henri Mühle
;
Jean-Christophe Novelli
Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
Tomack Gilmore
Partitioning permutations into monotone subsequences
David Wärn
Mating of discrete trees and walks in the quarter-plane
Philippe Biane
Planar lattice subsets with minimal vertex boundary
Radhika Gupta
;
Ivan Levcovitz
;
Alexander Margolis
;
Emily Stark
Discrete quantitative nodal theorem
László Lovász
Quickly proving Diestel's normal spanning tree criterion
Max Pitz
Completing partial transversals of Cayley tables of Abelian groups
Jaromy Kuhl
;
Donald McGinn
;
Michael William Schroeder
Sommaire du
Fascicule no. 4
The rotor-routing torsor and the Bernardi torsor disagree for every non-planar ribbon graph
Changxin Ding
The Bernardi formula for nontransitive deformations of the braid arrangement
Ankit Bisain
;
Eric Hanson
Edge-disjoint branchings in temporal digraphs
Victor Campos
;
Raul Lopes
;
Andrea Marino
;
Ana Silva
The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
Changhong Lu
;
Long-Tu Yuan
;
Ping Zhang
Jones' conjecture in subcubic graphs
Marthe Bonamy
;
François Dross
;
Tomáš Masařík
;
Andrea Munaro
;
Wojciech Nadara
;
Marcin Pilipczuk
;
Michał Pilipczuk
Two results on Ramsey-Turán theory
Meng Liu
;
Yusheng Li
Normal polytopes and ellipsoids
Joseph Gubeladze
Removahedral congruences versus permutree congruences
Doriann Albertin
;
Vincent Pilaud
;
Julian Ritter
Counting non-crossing permutations on surfaces of any genus
Norman Do
;
Jian He
;
Daniel V. Mathews
The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
Karen Meagher
;
A. Sarobidy Razafimahatratra
Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
Jozefien D'haeseleer
;
Ferdinand Ihringer
;
Jonathan Mannaert
;
Leo Storme
Characterizations of the \(G_2(4)\) and \(L_3(4)\) near octagons
Bart De Bruyn
A graph theory of rook placements
Kenneth Barrese
Some applications of Wagner's weighted subgraph counting polynomial
Ferenc Bencs
;
Péter Csikvári
;
Guus Regts
Zero-sum squares in bounded discrepancy \(\{-1,1\}\)-matrices
Alma R. Arévalo
;
Amanda Montejano
;
Edgardo Roldán-Pensado
Matching complexes of \(3 \times n\) grid graphs
Shuchita Goyal
;
Samir Shukla
;
Anurag Singh
Principal specialization of dual characters of flagged Weyl modules
Karola Mészáros
;
Avery St. Dizier
;
Arthur Tanjaya
Toppling on permutations with an extra chip
Arvind Ayyer
;
Beáta Bényi
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
Matthieu Rosenfeld
Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
Zhen He
;
Mei Lu
A characteristic polynomial for the transition probability matrix of correlated random walks on a graph
Takashi Komatsu
;
Norio Konno
;
Iwao Sato
Improved packings of \(n(n - 1)\) unit squares in a square
M. Z. Arslanov
;
S. A. Mustafin
;
Z. K. Shangitbayev
On factors of independent transversals in \(k\)-partite graphs
Raphael Yuster
Bell polynomials and nonlinear inverse relations
Wenchang Chu
Transversals and bipancyclicity in bipartite graph families
Peter Bradshaw
Resolutions of convex geometries
Domenico Cantone
;
Jean-Paul Doignon
;
Alfio Giarlotta
;
Stephen Watson
Popular differences for right isosceles triangles
Vjekoslav Kovač
Transitive avoidance games on boards of odd size
Matthias Gehnen
;
Eberhard Triesch
Bijections for faces of the Shi and Catalan arrangements
Duncan Levear
Asymptotic properties of random unlabelled block-weighted graphs
Benedikt Stufler
Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes
Preston Cranford
;
Anton Dochtermann
;
Evan Haithcock
;
Joshua Marsh
;
Suho Oh
;
Anna Truman
Generalized planar Turán numbers
Ervin Győri
;
Addisu Paulos
;
Nika Salia
;
Casey Tompkins
;
Oscar Zamora
On bipartite distinct distances in the plane
Surya Mathialagan
Paths of length three are \(K_{r+1}\)-Turán-good
Kyle Murphy
;
JD Nir
Cycles in color-critical graphs
Benjamin R. Moore
;
Douglas B. West
On the number of sum-free triplets of sets
Igor Araujo
;
József Balogh
;
Ramon I. Garcia
Generalizations and strengthenings of Ryser's conjecture
Louis DeBiasio
;
Yigal Kamel
;
Grace McCourt
;
Hannah Sheats
Twenty Vertex model and domino tilings of the Aztec triangle
Philippe Di Francesco
The exact linear Turán number of the sail
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
Diameters of cocircuit graphs of oriented matroids: an update
Ilan Adler
;
Jesús A. De Loera
;
Steven Klee
;
Zhenyang Zhang
A survey of the Hadamard maximal determinant problem
Patrick Browne
;
Ronan Egan
;
Fintan Hegarty
;
Padraig Ó Catháin
\(r\)-critical numbers of natural intervals
Marcel Herzog
;
Gil Kaplan
;
Arieh Lev
;
Romina Zigdon
On automorphisms of the double cover of a circulant graph
Ademir Hujdurović
;
Đorđe Mitrović
;
Dave Witte Morris
A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids
Kyungyong Lee
;
George D. Nasr
;
Jamie Radcliffe
Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
Xiaoye Liang
;
Ying-Ying Tan
;
Jack Koolen
Integral mixed Cayley graphs over abelian groups
Monu Kadyan
;
Bikash Bhattacharjya
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Manuel Aprile
;
Samuel Fiorini
;
Tony Huynh
;
Gwenaël Joret
;
David R. Wood
A combinatorial bijection on di-sk trees
Shishuo Fu
;
Zhicong Lin
;
Yaling Wang
Automorphisms and some geodesic properties of ortho-Grassmann graphs
Mark Pankov
;
Krzysztof Petelczyc
;
Mariusz Źynel
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Brahadeesh Sankarnarayanan
;
Niranjan Balachandran
Periodic solutions of one-dimensional cellular automata with uniformly chosen random rules
Janko Gravner
;
Xiaochen Liu
Pattern avoidance over a hypergraph
Benjamin Gunby
;
Maxwell Fishelson
Regarding two conjectures on clique and biclique partitions
Dhruv Rohatgi
;
John C. Urschel
;
Jake Wellens
Combinatorial game distributions of Steiner systems
Yuki Irie
A new algorithm for embedding plane graphs at fixed vertex locations
Marcus Schaefer