Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 31 (2024)
no. 4
Précédent
Suivant
Tome 31 (2024) no. 4
Sommaire
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