Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 25 (2018)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Graphical Mahonian statistics on words
Amy Grady
;
Svetlana Poznanović
Linear polychromatic colorings of hypercube faces
Evan Chen
On Ehrhart polynomials of lattice triangles
Johannes Hofscheier
;
Benjamin Nill
;
Dennis Öberg
Improved bounds for the Graham-Pollak problem for hypergraphs
Imre Leader
;
Ta Sheng Tan
Bounds on parameters of minimally nonlinear patterns
P. A. CrowdMath
The \(r\)-matching sequencibility of complete graphs
Adam Mammoliti
Equidistributions of Mahonian statistics over pattern avoiding permutations
Nima Amini
On parking functions and the zeta map in types \(B\), \(C\) and \(D\)
Robin Sulzgruber
;
Marko Thiel
The structure of delta-matroids with width one twists
Carolyn Chun
;
Rhiannon Hall
;
Criel Merino
;
Iain Moffatt
;
Steven D Noble
\((q,t)\)-characters of Kirillov-Reshetikhin modules of type \(A_r\) as quantum cluster variables
Bolor Turmunkh
Undesired parking spaces and contractible pieces of the noncrossing partition link
Michael Dougherty
;
Jon McCammond
Some new groups which are not CI-groups with respect to graphs
Ted Dobson
Nonexistence of certain singly even self-dual codes with minimal shadow
Stefka Bouyuklieva
;
Masaaki Harada
;
Akihiro Munemasa
The cycle polynomial of a permutation group
Peter J. Cameron
;
Jason Semeraro
Two-vertex generators of Jacobians of graphs
David Brandfonbrener
;
Pat Devlin
;
Netanel Friedenberg
;
Yuxuan Ke
;
Steffen Marcus
;
Henry Reichard
;
Ethan Sciamma
A large set of torus obstructions and how they were discovered
Wendy Myrvold
;
Jennifer Woodcock
Full Text
Kirillov's unimodality conjecture for the rectangular Narayana polynomials
Herman Z. Q. Chen
;
Arthur L. B. Yang
;
Philip B. Zhang
Toggling independent sets of a path graph
Michael Joseph
;
Tom Roby
Chip-firing on trees of loops
Sameer Kailasa
;
Vivian Kuperberg
;
Nicholas Wawrykow
Zero sum partition of abelian groups into sets of the same order and its applications
Sylwia Cichacz
A rational Catalan formula for \((m,3)\)-Hikita polynomials
Ryan Kaliszewski
;
Debdut Karmakar
A flag Whitney number formula for matroid Kazhdan-Lusztig polynomials
Max Wakefield
Parabolic double cosets in Coxeter groups
Sara C. Billey
;
Matjaž Konvalinka
;
T. Kyle Petersen
;
William Slofstra
;
Bridget E. Tenner
Generalized non-crossing partitions and buildings
Julia Heller
;
Petra Schwer
Likelihood orders for the \(p\)-cycle walks on the symmetric group
Megan Bernstein
The \(Z\)-polynomial of a matroid
Nicholas Proudfoot
;
Yuan Xu
;
Ben Young
Fully packed loop configurations: polynomiality and nested arches
Florian Aigner
A refined count of Coxeter element reflection factorizations
Elise delMas
;
Thomas Hameister
;
Victor Reiner
An arithmetic property of moments of the \(\beta\)-Hermite ensemble and certain map enumerators
Amol Aggarwal
Cubic graphs and related triangulations on orientable surfaces
Wenjie Fang
;
Mihyun Kang
;
Michael Moßhammer
;
Philipp Sprüssel
Context-free grammars for several polynomials associated with Eulerian polynomials
Shi-Mei Ma
;
Jun Ma
;
Yeong-Nan Yeh
;
Bao-Xuan Zhu
Lecture Hall partitions and the affine hyperoctahedral group
Christopher R. H. Hanusa
;
Carla D. Savage
Fixed points of the evacuation of maximal chains on fuss shapes
Sen-Peng Eu
;
Tung-Shan Fu
;
Hsiang-Chun Hsu
;
Yu-Pei Huang
Symmetries of unlabelled planar triangulations
Mihyun Kang
;
Philipp Sprüssel
Burling graphs, chromatic number, and orthogonal tree-decompositions
Stefan Felsner
;
Gwenaël Joret
;
Piotr Micek
;
William T. Trotter
;
Veit Wiechert
Conserved quantities of Q-systems from dimer integrable systems
Panupong Vichitkunakorn
\(q\)-Stirling identities revisited
Yue Cai
;
Richard Ehrenborg
;
Margaret Readdy
Almost tiling of the Boolean lattice with copies of a poset
István Tomon
Non-classical hyperplanes of finite thick dual polar spaces
Bart De Bruyn
The existence of a path-factor without small odd paths
Yoshimi Egawa
;
Michitaka Furuya
Obstructions to combinatorial formulas for plethysm
Thomas Kahle
;
Mateusz Michałek
The Cayley isomorphism property for Cayley maps
Mikhail Muzychuk
;
Gábor Somlai
The orthomorphism graph \(\mathcal{L}_3(q)\)
Anthony B. Evans
Operads of finite posets
Frédéric Fauvet
;
Loïc Foissy
;
Dominique Manchon
Partitioning sparse graphs into an independent set and a forest of bounded degree
François Dross
;
Mickael Montassier
;
Alexandre Pinlou
On the stability of independence polynomials
Jason I. Brown
;
Ben Cameron
Coloring cross-intersecting families
Danila Cherkashin
Eulerian numbers associated with arithmetical progressions
José L. Ramírez
;
Sergio N. Villamarin
;
Diego Villamizar
On the minimum size of an identifying code over all orientations of a graph
Nathann Cohen
;
Frédéric Havet
A Brooks type theorem for the maximum local edge connectivity
Michael Stiebitz
;
Bjarne Toft
A better lower bound on average degree of online \(k\)-list-critical graphs
Landon Rabern
On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11
Štefko Miklavič
Upper bound on the circular chromatic number of the plane
Konstanty Junosza-Szaniawski
A classification of Motzkin numbers modulo 8
Ying Wang
;
Guoce Xin
On almost-planar graphs
Guoli Ding
;
Joshua Fallon
;
Emily Marshall
Extremal numbers for directed hypergraphs with two edges
Alex Cameron
Core partitions with distinct parts
Huan Xiong
A combinatorial proof of a formula of Biane and Chapuy
Sinho Chewi
;
Venkat Anantharam
Equivalence of edge bicolored graphs on surfaces
Oliver T. Dasbach
;
Heather M. Russell
On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes
Brent Holmes
On repetition thresholds of caterpillars and trees of bounded degree
Borut Lužar
;
Pascal Ochem
;
Alexandre Pinlou
Induced 2-degenerate subgraphs of triangle-free planar graphs
Zdeněk Dvořák
;
Tom Kelly
On the extremal Betti numbers of binomial edge ideals of block graphs
Jürgen Herzog
;
Giancarlo Rinaldo
Periods of Ehrhart coefficients of rational polytopes
Tyrrell B. McAllister
;
Hélène O. Rochais
Connected order ideals and \(P\)-partitions
Ben P. Zhou
Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
Sanjay Ramassamy
Covering a graph with cycles of length at least 4
Hong Wang
Rook placements and Jordan forms of upper-triangular nilpotent matrices
Martha Yip
Symmetric chain decompositions of products of posets with long chains
Stefan David
;
Hunter Spink
;
Marius Tiba
Piercing axis-parallel boxes
Maria Chudnovsky
;
Sophie Spirkl
;
Shira Zerbib
A characterization of Hermitian varieties as codewords
Angela Aguglia
;
Daniele Bartoli
;
Leo Storme
;
Zsuzsa Weiner
Constraining the clustering transition for colorings of sparse random graphs
Michael Anastos
;
Alan Frieze
;
Wesley Pegden
Finding balance: split graphs and related classes
Karen L. Collins
;
Ann N. Trenk
Every plane graph is facially-non-repetitively \(C\)-choosable
Grzegorz Gutowski
Sommaire du
Fascicule no. 2
Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
Liying Kang
;
Lele Liu
;
Erfang Shan
Eigenvalue bounds for the signless \(p\)-Laplacian
Elizandro Max Borba
;
Uwe Schwerdtfeger
Residual \(q\)-Fano planes and related structures
Tuvi Etzion
;
Niv Hooker
On the poset and asymptotics of Tesler matrices
Jason O'Neill
Hamilton circles in Cayley graphs
Babak Miraftab
;
Tim Rühmann
On the existence of Frobenius digraphical representations
Pablo Spiga
Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4
Qingying Deng
;
Xian'an Jin
;
Fengming Dong
;
Eng Guan Tay
A new approach for examining \(q\)-Steiner systems
Tuvi Etzion
Clique trees of infinite locally finite chordal graphs
Christoph Hofer-Temmel
;
Florian Lehner
Vertex-transitive direct products of graphs
Richard H. Hammack
;
Wilfried Imrich
Hypergraph saturation irregularities
Natalie C. Behague
On vertex-disjoint paths in regular graphs
Jie Han
A new upper bound for cancellative pairs
Barnabás Janzer
Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
Jacob Fox
;
Lisa Sauermann
On the smallest snarks with oddness 4 and connectivity 2
Jan Goedgebeur
Bipartite Ramsey numbers for graphs of small bandwidth
Lili Shen
;
Qizhong Lin
;
Qinghai Liu
On Bergeron's positivity problem for \(q\)-binomial coefficients
Fabrizio Zanello
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
Victor Falgas-Ravry
;
Allan Lo
Counting compositions over finite abelian groups
Zhicheng Gao
;
Andrew MacFie
;
Qiang Wang
Anagram-free graph colouring
Tim E. Wilson
;
David R. Wood
A generalization of Erdős' matching conjecture
Christos Pelekis
;
Israel Rocha
Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
George F. McNulty
Chromatic index, treewidth and maximum degree
Henning Bruhn
;
Laura Gellert
;
Richard Lang
Deferred on-line bipartite matching
Jakub Kozik
;
Grzegorz Matecki
Semiregular automorphisms in vertex-transitive graphs of order \(3p^2\)
Dragan Marušič
Edge reconstruction of the Ihara zeta function
Gunther Cornelissen
;
Janne Kool
Avoiding fractional powers over the natural numbers
Lara Pudwell
;
Eric Rowland
An easy subexponential bound for online chain partitioning
Bartłomiej Bosek
;
H. A. Kierstead
;
Tomasz Krawczyk
;
Grzegorz Matecki
;
Matthew E. Smith
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
Necessary conditions for Schur-maximality
Foster Tom
;
Stephanie van Willigenburg
Paths and cycles in random subgraphs of graphs with large minimum degree
Stefan Ehard
;
Felix Joos
The extremal function and Colin de Verdière graph parameter
Rose McCarty
A new upper bound on the game chromatic index of graphs
Ralph Keusch
Defective 3-paintability of planar graphs
Grzegorz Gutowski
;
Ming Han
;
Tomasz Krawczyk
;
Xuding Zhu
Convex geometries are extremal for the generalized Sauer-Shelah bound
Bogdan Chornomaz
Symmetries of shamrocks. II: Axial shamrocks
Mihai Ciucu
Nonempty intersection of longest paths in \(2K_2\)-free graphs
Gili Golan
;
Songling Shan
On two-sided gamma-positivity for simple permutations
Ron M. Adin
;
Eli Bagno
;
Estrella Eisenberg
;
Shulamit Reches
;
Moriah Sigron
Bispindles in strongly connected digraphs with large chromatic number
Nathann Cohen
;
Frédéric Havet
;
William Lochet
;
Raul Lopes
Flows in signed graphs with two negative edges
Edita Rollová
;
Michael Schubert
;
Eckhard Steffen
Hultman elements for the hyperoctahedral groups
Alexander Woo
On a conjecture regarding permutations which destroy arithmetic progressions
Mehtaab Sawhney
;
David Stoner
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
Frank Duque
;
Hernán González-Aguilar
;
César Hernández-Vélez
;
Jesús Leaños
;
Carolina Medina
Toward the Schur expansion of Macdonald polynomials
Sami Assaf
Maximal planar subgraphs of fixed girth in random graphs
Manuel Fernández
;
Nicholas Sieger
;
Michael Tait
A note on not-4-list colorable planar graphs
Margit Voigt
;
Arnfried Kemnitz
Binary covering arrays on tournaments
Elizabeth Maltais
;
Lucia Moura
;
Mike Newman
On the adjacency spectra of hypertrees
Gregory J. Clark
;
Joshua N. Cooper
On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian or cyclic
Ted Dobson
A note on the expected length of the longest common subsequences of two i.i.d. random permutations
Christian Houdré
;
Chen Xu
Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
Jang Soo Kim
;
U-Keun Song
Homogeneous 3-dimensional permutation structures
Samuel Braunfeld
Relaxations of \(\mathrm{GF}(4)\)-representable matroids
Ben Clark
;
James Oxley
;
Stefan H.M. van Zwam
On super-strong Wilf equivalence classes of permutations
Demetris Hadjiloucas
;
Ioannis Michos
;
Christina Savvidou
On rainbow Hamilton cycles in random hypergraphs
Andrzej Dudek
;
Sean English
;
Alan Frieze
Extending perfect matchings to Gray codes with prescribed ends
Petr Gregor
;
Tomáš Novotný
;
Riste Škrekovski
Sommaire du
Fascicule no. 3
Extension from precoloured sets of edges
Katherine Edwards
;
António Girão
;
Jan van den Heuvel
;
Ross J. Kang
;
Gregory J. Puleo
;
Jean-Sébastien Sereni
Defining the \(q\)-analogue of a matroid
Relinde Jurrius
;
Ruud Pellikaan
Hamilton cycles in infinite cubic graphs
Max F. Pitz
Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
Thomas F. Bloom
;
Anita Liebenau
Proper distinguishing colorings with few colors for graphs with girth at least 5
Daniel W. Cranston
Parallel enumeration of triangulations
Charles Jordan
;
Michael Joswig
;
Lars Kastner
Crystals and Schur \(P\)-positive expansions
Seung-Il Choi
;
Jae-Hoon Kwon
Primary decomposition of ideals of lattice homomorphisms
Leila Sharifan
;
Ali Akbar Estaji
;
Ghazaleh Malekbala
On arc-transitive metacyclic covers of graphs with order twice a prime
Zhaohong Huang
;
Jiangmin Pan
Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
Ivailo Hartarsky
Random enriched trees with applications to random graphs
Benedikt Stufler
Countable Menger's theorem with finitary matroid constraints on the ingoing edges
Attila Joó
Hamiltonicity in locally finite graphs: two extensions and a counterexample
Karl Heuer
EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
Thomas Selig
;
Jason P. Smith
;
Einar Steingrímsson
A note on intervals in the Hales-Jewett theorem
Imre Leader
;
Eero Räty
On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
Megumi Asada
;
Ryan Chen
;
Florian Frick
;
Frederick Huang
;
Maxwell Polevy
;
David Stoner
;
Ling Hei Tsang
;
Zoe Wellner
On different ``middle parts'' of a tree
Heather Smith
;
László Székely
;
Hua Wang
;
Shuai Yuan
On the strong chromatic index of sparse graphs
Philip DeOrsey
;
Michael Ferrara
;
Nathan Graber
;
Stephen G. Hartke
;
Luke L. Nelsen
;
Eric Sullivan
;
Sogol Jahanbekam
;
Bernard Lidický
;
Derrick Stolee
;
Jennifer White
Full Text
Sets with few differences in abelian groups
Mitchell Lee
The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
Andrew Elvey Price
;
Muhammad Adib Surani
;
Sanming Zhou
Quasiregular matroids
S. R. Kingan
Hypertopes with tetrahedral diagram
Domenico Catalano
;
M. Elisa Fernandes
;
Isabel Hubard
;
Dimitri Leemans
Universal layered permutations
Michael Albert
;
Michael Engen
;
Jay Pantone
;
Vincent Vatter
Reconfiguration on nowhere dense graph classes
Sebastian Siebertz
Monops, monoids and operads: the combinatorics of Sheffer polynomials
Miguel A. Méndez
;
Rafael Sánchez Lamoneda
On graphs whose flow polynomials have real roots only
Fengming Dong
Excluding hooks and their complements
Krzysztof Choromanski
;
Dvir Falik
;
Anita Liebenau
;
Viresh Patel
;
Marcin Pilipczuk
Cubic edge-transitive bi-\(p\)-metacirculants
Yan-Li Qin
;
Jin-Xin Zhou
Linear bound for majority colourings of digraphs
Fiachra Knox
;
Robert Šámal
Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids
Alan J. Cain
;
António Malheiro
Strong chromatic index of graphs with maximum degree four
Mingfang Huang
;
Michael Santana
;
Gexin Yu
Domination and fractional domination in digraphs
Ararat Harutyunyan
;
Tien-Nam Le
;
Alantha Newman
;
Stéphan Thomasse
Vertex covering with monochromatic pieces of few colours
Marlo Eugster
;
Frank Mousset
Quasirandomness in hypergraphs
Elad Aigner-Horev
;
David Conlon
;
Hiệp Hàn
;
Yury Person
;
Mathias Schacht
Note on the multicolour size-Ramsey number for paths
Andrzej Dudek
;
Paweł Prałat
Increasing the minimum distance of codes by twisting
Marzieh Akbari
;
Neil I. Gillespie
;
Cheryl E. Praeger
An orthosymplectic Pieri rule
Anna Stokke
Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
Johannes Carmesin
Pentagon contact representations
Stefan Felsner
;
Hendrik Schrezenmaier
;
Raphael Steiner
Non-fringe subtrees in conditioned Galton-Watson trees
Xing Shi Cai
;
Svante Janson
A notion of inversion number associated to certain quiver flag varieties
Lucas Fresse
Powerful sets: a generalisation of binary matroids
Graham E. Farr
;
Andrew Y.Z. Wang
The Turán polytope
Annie Raymond
Hamilton cycles in sparse robustly expanding digraphs
Allan Lo
;
Viresh Patel
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Yi Zhang
;
Yi Zhao
;
Mei Lu
Diagrams and essential sets for signed permutations
David Anderson
Lattice points and simultaneous core partitions
Paul Johnson
On the rank and periodic rank of finite dynamical systems
Maximilien Gadouleau
Forbidden subposet problems for traces of set families
Dániel Gerbner
;
Balázs Patkós
;
Máté Vizer
A Sundaram type bijection for \(\mathrm{SO}(3)\): vacillating tableaux and pairs of standard Young tableaux and orthogonal Littlewood-Richardson tableaux
Judith Jagenteufel
The diachromatic number of digraphs
Gabriela Araujo-Pardo
;
Juan José Montellano-Ballesteros
;
Mika Olsen
;
Christian Rubio-Montiel
Sommaire du
Fascicule no. 4
Generating asymptotics for factorially divergent sequences
Michael Borinsky
Reflexive graphs with near unanimity but no semilattice polymorphisms
Mark Siggers
On robust colorings of Hamming-distance graphs
Isaiah Harney
;
Heide Gluesing-Luerssen
Cohomology classes of interval positroid varieties and a conjecture of Liu
Brendan Pawlowski
Random planar maps and graphs with minimum degree two and three
Marc Noy
;
Lander Ramos
Polynomiality of certain average weights for oscillating tableaux
Guo-Niu Han
;
Huan Xiong
Counting proper colourings in 4-regular graphs via the Potts model
Ewan Davies
Planar transitive graphs
Matthias Hamann
Coboundary categories and local rules
Bruce W. Westbury
The largest pure partial planes of order 6 have size 25
Yibo Gao
Constant terms of near-Dyson polynomials
Alexey Gordeev
Linear dependence between hereditary quasirandomness conditions
Xiaoyu He
The matching polynomials and spectral radii of uniform supertrees
Li Su
;
Liying Kang
;
Honghai Li
;
Erfang Shan
A new perspective on the average mixing matrix
Gabriel Coutinho
;
Chris Godsil
;
Krystal Guo
;
Hanmeng Zhan
On the clique number of a strongly regular graph
Gary R. W. Greaves
;
Leonard H. Soicher
Flip posets of Bruhat intervals
Saúl A. Blanco
Shuffle-compatible permutation statistics. II: The exterior peak set
Darij Grinberg
On the diameter of tree associahedra
Jean Cardinal
;
Stefan Langerman
;
Pablo Pérez-Lantero
Unique rectification in \(d\)-complete posets: towards the \(K\)-theory of Kac-Moody flag varieties
Rahul Ilango
;
Oliver Pechenik
;
Michael Zlatin
On the Schur positivity of \(\Delta_{e_{2}} e_n[X]\)
Qiu Dun
;
Jeffrey B. Remmel
;
Emily Sergel
;
Guoce Xin
Using symbolic computation to prove nonexistence of distance-regular graphs
Janoš Vidali
Infinite graphical Frobenius representations
Mark E. Watkins
Bounds for matchings in nonabelian groups
Will Sawin
Analogies between the crossing number and the tangle crossing number
Robin Anderson
;
Shuliang Bai
;
Fidel Barrera-Cruz
;
Éva Czabarka
;
Giordano Da Lozzo
;
Natalie L. F. Hobson
;
Jephian C.-H. Lin
;
Austin Mohr
;
Heather C. Smith
;
László A. Székely
;
Hays Whitlatch
\(\lambda\)-Euler's difference table for colored permutations
Bin Han
Counting partitions of a fixed genus
Robert Cori
;
Gábor Hetyei
On upper transversals in 3-uniform hypergraphs
Michael A. Henning
;
Anders Yeo
Inverse Perron values and connectivity of a uniform hypergraph
Changjiang Bu
;
Haifeng Li
;
Jiang Zhou
Density of monochromatic infinite paths
Allan Lo
;
Nicolás Sanhueza-Matamala
;
Guanghui Wang
Transversals, plexes, and multiplexes in iterated quasigroups
Anna Taranenko
An algebra associated with a flag in a subspace lattice over a finite field and the quantum affine algebra
Yuta Watanabe
On the union complexity of families of axis-parallel rectangles with a low packing number
Chaya Keller
;
Shakhar Smorodinsky
Path choosability of planar graphs
Glenn G. Chappell
;
Chris Hartman
On the number of connected sets in bounded degree graphs
Kustaa Kangas
;
Petteri Kaski
;
Janne H. Korhonen
;
Mikko Koivisto
Uniquely \(K_r^{(k)}\)-saturated hypergraphs
András Gyárfás
;
Stephen G. Hartke
;
Charles Viss
Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
Andrew McDowell
;
Richard Mycroft
Random numerical semigroups and a simplicial complex of irreducible semigroups
Jesus De Loera
;
Christopher O'Neill
;
Dane Wilburne
A Sauer-Shelah-Perles lemma for sumsets
Zeev Dvir
;
Shay Moran
Degenerate Turán problems for hereditary properties
Vladimir Nikiforov
;
Michael Tait
;
Craig Timmons
A new lower bound for the size of an affine blocking set
Maarten De Boeck
;
Geertrui Van de Voorde
\((k,\lambda)\)-anti-powers and other patterns in words
Amanda Burcroff
Cyclic sieving, necklaces, and branching rules related to Thrall's problem
Connor Ahlbach
;
Joshua P. Swanson
A family of partially ordered sets with small balance constant
Evan Chen
Combinatorial interpretations of the Kreweras triangle in terms of subset tuples
Ange Bigeni
Graph families with constant distance determinant
Yen-Jen Cheng
;
Jephian C.-H. Lin
Coloring chains for compression with uncertain priors
Noah Golowich
Enumerations, forbidden subgraph characterizations, and the split-decomposition
Maryam Bahrani
;
Jérémie Lumbroso
Independent sets in the union of two Hamiltonian cycles
Ron Aharoni
;
Daniel Soltész
Bandwidth of graphs resulting from the edge clique covering problem
Konrad Engel
;
Sebastian Hanisch
Distribution of coefficients of rank polynomials for random sparse graphs
Dmitry Jakobson
;
Calum MacRury
;
Sergey Norin
;
Lise Turner
Boxicity, poset dimension, and excluded minors
Louis Esperet
;
Veit Wiechert
Random Kneser graphs and hypergraphs
Andrey Kupavskii
Theta-vexillary signed permutations
Jordan Lambert
Measures of edge-uncolorability of cubic graphs
M. A. Fiol
;
G. Mazzuoccolo
;
E. Steffen
Minimal obstructions for partial representations of interval graphs
Pavel Klavik
;
Maria Saumell
Clique colourings of geometric graphs
Colin McDiarmid
;
Dieter Mitsche
;
Pawel Prałat
On certain combinatorial expansions of the Legendre-Stirling numbers
Shi-Mei Ma
;
Jun Ma
;
Yeong-Nan Yeh
Lozenge tilings of a halved hexagon with an array of triangles removed from the boundary. II
Tri Lai
Hypergraph coverings and their zeta functions
Deqiong Li
;
Yaoping Hou
Spectral and combinatorial properties of some algebraically defined graphs
Sebastian M. Cioabă
;
Felix Lazebnik
;
Shuying Sun
Ramsey-Turán numbers for semi-algebraic graphs
Jacob Fox
;
János Pach
;
Andrew Suk
Centroidal localization game
Bartłomiej Bosek
;
Przemysław Gordinowicz
;
Jarosław Grytczuk
;
Nicolas Nisse
;
Joanna Sokół
;
Małgorzata Śleszyńska-Nowak
Signed cycle double covers
Lingsheng Shi
;
Zhang Zhang
A two-sided analogue of the Coxeter complex
T. Kyle Petersen
Partial characterization of graphs having a single large Laplacian eigenvalue
L. Emilio Allem
;
Antonio Cafure
;
Ezequiel Dratman
;
Luciano N. Grippo
;
Martín D. Safe
;
Vilmar Trevisan
Minimal multiple blocking sets
Anurag Bishnoi
;
Sam Mattheus
;
Jeroen Schillewaert