Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 30 (2023)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Generalizing cographs to 2-cographs
James Oxley
;
Jagdeep Singh
Counting Baxter matrices
George Spahn
Saturation for small antichains
Irina Ðanković
;
Maria-Romina Ivan
Rank-metric lattices
Giuseppe Cotardo
;
Alberto Ravagnani
Flagged Schur polynomial duality via a lattice path bijection
Eoghan McDowell
Decompositions of augmented Bergman complexes
R. Amzi Jeffs
Spanning configurations and representation stability
Brendan Pawlowski
;
Eric Ramos
;
Brendon Rhoades
Small sets in union-closed families
David Ellis
;
Maria-Romina Ivan
;
Imre Leader
Min-cost-flow preserving bijection between subgraphs and orientations
Izhak Elmaleh
;
Ohad N. Feldheim
Bijection between increasing binary trees and rook placements on double staircases
Bishal Deb
The matching process and independent process in random regular graphs and hypergraphs
Deepak Bal
;
Patrick Bennett
Typical values of extremal-weight combinatorial structures with independent symmetric weights
Yun Cheng
;
Yixue Liu
;
Tomasz Tkocz
;
Albert Xu
Towards Lehel's conjecture for 4-uniform tight cycles
Allan Lo
;
Vincent Pfenninger
Hanani-Tutte for radial planarity. II
Radoslav Fulek
;
Michael Pelsmajer
;
Marcus Schaefer
On chromatic symmetric homology and planarity of graphs
Azzurra Ciliberti
;
Luca Moci
A result on large induced subgraphs with prescribed residues in bipartite graphs
Zachary Hunter
Finding large expanders in graphs: from topological minors to induced subgraphs
Baptiste Louf
;
Fiona Skerman
Long induced paths in minor-closed graph classes and beyond
Claire Hilaire
;
Jean-Florent Raymond
Smaller embeddings of partial \(k\)-star decompositions
Ajani De Vas Gunasekara
;
Daniel Horsley
Spectral extremal graphs for disjoint cliques
Zhenyu Ni
;
Jing Wang
;
Liying Kang
On a characterization of lattice cubes via discrete isoperimetric inequalities
David Iglesias
;
Eduardo Lucas
The equivalence of two inequalities for quasisymmetric designs
Andries Brouwer
Cooperative colorings of forests
Peter Bradshaw
Lenart's bijection via bumpless pipe dreams
Adam Gregory
;
Zachary Hamaker
A new construction of strongly regular graphs with parameters of the complement symplectic graph
Vladislav V. Kabanov
Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
Clemens Heuberger
;
Sarah J. Selkirk
;
Stephan Wagner
On permutations avoiding partially ordered patterns defined by bipartite graphs
Sergey Kitaev
;
Artem Pyatkin
A tableau formula for vexillary Schubert polynomials in type \(C\)
Tomoo Matsumura
The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
Nicholas J. Williams
Multitrees in random graphs
Alan Frieze
;
Wesley Pegden
Degree 2 Boolean functions on Grassmann graphs
Jan De Beule
;
Jozefien D'haeseleer
;
Ferdinand Ihringer
;
Jonathan Mannaert
Non-empty intersection of longest paths in \(H\)-free graphs
James A. Long Jr.
;
Kevin G. Milans
;
Andrea Munaro
The apparent structure of dense Sidon sets
Sean Eberhard
;
Freddie Manners
Generalized Turán problems for \(K_{2,t}\)
Dániel Gerbner
Unbalanced spanning subgraphs in edge labeled complete graphs
Stéphane Bessy
;
Johannes Pardey
;
Lucas Picasarri-Arrieta
;
Dieter Rautenbach
A characterization of two-dimensional Buchsbaum matching complexes
Bennet Goeckner
;
Fran Herr
;
Legrand Jones
;
Rowan Rowlands
Constructions and restrictions for balanced splittable Hadamard matrices
Jonathan Jedwab
;
Shuxing Li
;
Samuel Simon
Graphs with at most one generalized cospectral mate
Wei Wang
;
Wei Wang
;
Tao Yu
Stability of Woodall's theorem and spectral conditions for large cycles
Binlong Li
;
Bo Ning
On five types of crucial permutations with respect to monotone patterns
Sergey Avgustinovich
;
Sergey Kitaev
;
Anna Taranenko
A bijective proof of a generalization of the non-negative crank-odd mex identity
Isaac Konan
Majority edge-colorings of graphs
Felix Bock
;
Rafał Kalinowski
;
Johannes Pardey
;
Monika Pilśniak
;
Dieter Rautenbach
;
Mariusz Woźniak
On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
Zuwen Luo
;
Kexiang Xu
Properly colored Hamilton cycles in Dirac-type hypergraphs
Sylwia Antoniuk
;
Nina Kamčev
;
Andrzej Ruciński
An upper bound for the circumference of a 3-connected binary matroid
Manoel Lemos
;
James Oxley
The number of quasi-trees in fans and wheels
Criel Merino
A homomorphic polynomial for oriented graphs
Sandip Das
;
Sumitava Ghosh
;
Swathy Prabhu
;
Sagnik Sen
The balancing number and generalized balancing number of some graph classes
Antoine Dailly
;
Laura Eslava
;
Adriana Hansberg
;
Denae Ventura
The Davenport constant of the group \(C_2^{r-1} \oplus C_{2k}\)
Kevin Zhao
Doubled patterns with reversal and square-free doubled patterns
Antoine Domenech
;
Pascal Ochem
Subgraph densities in \(K_r\)-free graphs
Andrzej Grzesik
;
Ervin Győri
;
Nika Salia
;
Casey Tompkins
Combinatorics on bounded free Motzkin paths and its applications
Hyunsoo Cho
;
JiSun Huh
;
Hayan Nam
;
Jaebum Sohn
Monochromatic paths in 2-edge-coloured graphs and hypergraphs
Maya Stein
Balancing connected colourings of graphs
Freddie Illingworth
;
Emil Powierski
;
Alex Scott
;
Youri Tamitegama
Junta threshold for low degree Boolean functions on the slice
Yuval Filmus
Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats
Nacho López
;
Arnau Messegué
;
Josep M. Miret
Small graphs and hypergraphs of given degree and girth
Grahame Erskine
;
James Tuite
Sommaire du
Fascicule no. 2
Proof of a conjecture involving derangements and roots of unity
Han Wang
;
Zhi-Wei Sun
Enumeration of perfect matchings of the Cartesian products of graphs
Wei Li
;
Yao Wang
Bounds on half graph orders in powers of sparse graphs
Marek Sokołowski
Perfect colorings of the infinite square grid: coverings and twin colors
Denis Krotov
Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
Federico Romaniello
;
Jean Paul Zerafa
The \(h\)-polynomial and the rook polynomial of some polyominoes
Manoj Kummini
;
Dharm Veer
A new feasibility condition for the AT4 family
Zheng-Jiang Xia
;
Jae-Ho Lee
;
Jack H. Koolen
Combinatorial derived matroids
Ragnar Freij-Hollanti
;
Relinde Jurrius
;
Olga Kuznetsova
On the \(q\)-analogue of Pólya's theorem
Alin Bostan
;
Sergey Yurkevich
Tight bound for the number of distinct palindromes in a tree
Paweł Gawrychowski
;
Tomasz Kociumaka
;
Wojciech Rytter
;
Tomasz Waleń
Some arithmetic properties of Pólya's urn
José L. Fernández
;
Pablo Fernández
A splitter theorem for elastic elements in 3-connected matroids
George Drummond
;
Charles Semple
Impartial hypergraph games
Nándor Sieben
Spectral radius conditions for the rigidity of graphs
Dandan Fan
;
Xueyi Huang
;
Huiqiu Lin
On enumeration and entropy of ribbon tilings
Yinsong Chen
;
Vladislav Kargin
On the generating function for intervals in Young's lattice
Faqruddin Ali Azam
;
Edward Richmond
Enumeration of corner polyhedra and 3-connected Schnyder labelings
Éric Fusy
;
Erkan Narmanli
;
Gilles Schaeffer
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
Patrick Arras
Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy
Tom Johnston
Infinite families of hypertopes from centrally symmetric polytopes
Claudio Alexandre Piedade
A note on long cycles in sparse random graphs
Michael Anastos
Mixed dimer configuration model in type D cluster algebras
Gregg Musiker
;
Kayla Wright
On the spectral radius of minimally 2-(edge)-connected graphs with given size
Zhenzhen Lou
;
Gao Min
;
Qiongxiang Huang
Estimating global subgraph counts by sampling
Svante Janson
;
Valentas Kurauskas
The Park-Pham theorem with optimal convergence rate
Tolson Bell
A Cantor-Bendixson rank for siblings of trees
Davoud Abdi
The number of occurrences of patterns in a random tree or forest permutation
Svante Janson
The complexity of the matroid homomorphism problem
Cheolwon Heo
;
Hyobin Kim
;
Siggers Mark
Combinatorial constructions of generating functions of cylindric partitions with small profiles into unrestricted or distinct parts
Kağan Kurşungöz
;
Halime Ömrüuzun Seyrek
Generating \(I\)-eigenvalue free threshold graphs
Luiz Emilio Allem
;
Elismar R. Oliveira
;
Fernando Tura
Behaviour of the normalized depth function
Antonino Ficarra
;
Jürgen Herzog
;
Takayuki Hibi
Characterizing planar tanglegram layouts and applications to edge insertion problems
Kevin Liu
Generalized Riemann functions, their weights, and the complete graph
Nicolas Folinsbee
;
Joel Friedman
Edge and pair queries-random graphs and complexity
Dariusz Dereniowski
;
Przemysław Gordinowicz
;
Paweł Prałat
Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
Chunqiu Fang
;
Ervin Győri
;
Chuanqi Xiao
;
Jimeng Xiao
Generalized Alder-type partition inequalities
Liam Armstrong
;
Bryan Ducasse
;
Thomas Meyer
;
Holly Swisher
Induced subgraphs and path decompositions
Robert Hickingbotham
Rooted prism-minors and disjoint cycles containing a specified edge
J.P. Costalonga
;
T.J. Reid
;
H. Wu
An algebraic formulation of hypergraph colorings
Michael Krul
;
Luboš Thoma
On the minimum bisection of random 3-regular graphs
Lyuben Lichev
;
Dieter Mitsche
Cyclic descents, matchings and Schur-positivity
Ron M Adin
;
Yuval Roichman
Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
Tara Abrishami
;
Maria Chudnovsky
;
Sepehr Hajebi
;
Sophie Spirkl
Maximal degree subposets of \(\nu\)-Tamari lattices
Aram Dermenjian
The \(h^\ast\)-polynomial of the order polytope of the zig-zag poset
Jane Ivy Coons
;
Seth Sullivant
Perfect matching complexes of honeycomb graphs
Margaret Bayer
;
Marija Jelić Milutinović
;
Julianne Vega
On the running time of hypergraph bootstrap percolation
Jonathan A. Noel
;
Arjun Ranganathan
On counting double centralizers of symmetric groups
Zhipeng Lu
Towards \(3n-4\) in groups of prime order
Vsevolod F. Lev
;
Oriol Serra
Hadamard matrices related to projective planes
Hadi Kharaghani
;
Sho Suda
Solutions to seven and a half problems on tilings
Bojan Bašić
;
Aleksa Džuklevski
;
Anna Slivková
Random cubic planar maps
Michael Drmota
;
Marc Noy
;
Clément Requilé
;
Juanjo Rué
Cyclic products and optimal traps in cyclic birth and death chains
Mark Holmes
;
Alexander E. Holroyd
;
Alejandro Ramírez
How many cliques can a clique cover cover?
Pavel Shuldiner
;
R. Wayne Oldford
Monk's rule for Demazure characters of the general linear group
Sami Assaf
;
Danjoseph Quijada
A tropical count of real bitangents to plane quartic curves
Alheydis Geiger
;
Marta Panizzut
On the chromatic number in the stochastic block model
Mikhail Isaev
;
Mihyun Kang
Numerical semigroups, polyhedra, and posets. III: Minimal presentations and face dimension
Tara Gomes
;
Christopher O'Neill
;
Eduardo Torres Davila
Sommaire du
Fascicule no. 3
Graphs of linear growth have bounded treewidth
Rutger Campbell
;
Marc Distel
;
J. Pascal Gollin
;
Daniel J. Harvey
;
Kevin Hendrey
;
Robert Hickingbotham
;
Bojan Mohar
;
David Wood
On the location of chromatic zeros of series-parallel graphs
Ferenc Bencs
;
Jeroen Huijben
;
Guus Regts
\(P\)-polynomial weakly distance-regular digraphs
Qing Zeng
;
Yuefeng Yang
;
Kaishun Wang
Bijective proofs of Monk's rule for Schubert and double Schubert polynomials with bumpless pipe dreams
Daoji Huang
Rowmotion on 321-avoiding permutations
Ben Adenbaum
;
Sergi Elizalde
Tree automata and pigeonhole classes of matroids. II
Daryl Funk
;
Dillon Mayhew
;
Mike Newman
Component behaviour and excess of random bipartite graphs near the critical point
Tuan Do
;
Joshua Erde
;
Mihyun Kang
;
Michael Missethan
Extremal independent set reconfiguration
Nicolas Bousquet
;
Bastien Durain
;
Théo Pierron
;
Stéphan Thomassé
Graphs isomorphisms under edge-replacements and the family of amoebas
Yair Caro
;
Adriana Hansberg
;
Amanda Montejano
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
Michael Anastos
;
David Fabian
;
Alp Müyesser
;
Tibor Szabó
The lexicographically least square-free word with a given prefix
Siddharth Berera
;
Andrés Gómez-Colunga
;
Joey Lakerdas-Gayle
;
John López
;
Mauditra Matin
;
Daniel Roebuck
;
Eric Rowland
;
Noam Scully
;
Juliet Whidden
Graph rigidity properties of Ramanujan graphs
Sebastian Cioabă
;
Sean Dewar
;
Georg Grasegger
;
Xiaofeng Gu
Hypermaps over non-abelian simple groups and strongly symmetric generating sets
Andrea Lucchini
;
Pablo Spiga
Ramsey numbers of large even cycles and fans
Chunlin You
;
Qizhong Lin
Bounds and extremal graphs for total dominating identifying codes
Florent Foucaud
;
Tuomo Lehtilä
Combinatorics of centers of 0-Hecke algebras in type \(A\)
Sebastian König
Balanced edge-colorings avoiding rainbow cliques of size four
Felix Clemen
;
Adam Zsolt Wagner
Probabilistic parking functions
Irfan Durmić
;
Alex Han
;
Pamela E. Harris
;
Rodrigo Ribeiro
;
Mei Yin
Inversion sequences avoiding a triple of patterns of 3 letters
David Callan
;
Vít Jelínek
;
Toufik Mansour
Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions
Johannes Carmesin
;
Tsvetomir Mihaylov
Bounding branch-width
Susan Jowett
;
Jasmine Lulani Kaulamatoa
;
Geoff Whittle
A further extension of Rödl's theorem
Tung Nguyen
Distribution of external branch lengths in Yule histories
Filippo Disanto
;
Michael Fuchs
Ramsey numbers with prescribed rate of growth
Matías Pavez-Signé
;
Simón Piga
;
Nicolás Sanhueza-Matamala
On the limit of the positive \(\ell\)-degree Turán problem
Oleg Pikhurko
A pentagonal number theorem for tribone tilings
Jesse Kim
;
James Propp
The generalized Frobenius problem via restricted partition functions
Kevin Woods
A combinatorial proof of Buryak-Feigin-Nakajima
Eve Vidalis
Irreducible subcube partitions
Yuval Filmus
;
Edward A. Hirsch
;
Sascha Kurz
;
Ferdinand Ihringer
;
Artur Riazanov
;
Alexander V. Smal
;
Marc Vinyals
The maximum hook length of \(d\)-distinct simultaneous core partitions
Ethan Pesikoff
;
Benjamin Przybocki
;
Janabel Xia
Extended double covers and homomorphism bounds of signed graphs
Florent Foucaud
;
Reza Naserasr
;
Rongxing Xu
Cut vertices in random planar maps
Michael Drmota
;
Marc Noy
;
Benedikt Stufler
Bounding generalized coloring numbers of planar graphs using coin models
Jesper Nederlof
;
Michał Pilipczuk
;
Karol Węgrzycki
An \(A_{\alpha}\)-spectral Erdős-Sós theorem
Ming-Zhu Chen
;
Shuchao Li
;
Zhao-Ming Li
;
Yuantian Yu
;
Xiao-Dong Zhang
Quantum continuants, quantum rotundus and triangulations of annuli
Ludivine Leclere
;
Sophie Morier-Genoud
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\)
Linda Cook
;
Tomáš Masařík
;
Marcin Pilipczuk
;
Amadeus Reinald
;
Uéverton S. Souza
Sommaire du
Fascicule no. 4
On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
Josse van Dobben de Bruyn
;
Dion Gijswijt
Improved pyrotechnics: closer to the burning number conjecture
Paul Bastide
;
Marthe Bonamy
;
Anthony Bonato
;
Pierre Charbit
;
Shahin Kamali
;
Théo Pierron
;
Mikaël Rabie
A curious identity arising from Stirling's formula and saddle-point method on two different contours
Hsien-Kuei Hwang
Lower bounds for the Turán densities of daisies
David Ellis
;
Dylan King
On \(3\)-uniform hypergraphs avoiding a cycle of length four
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
;
Nika Salia
;
Casey Tompkins
Planar graphs with the maximum number of induced 6-cycles
Michael Savery
Permutations with few inversions
Anders Claesson
;
Atli Fannar Franklín
;
Einar Steingrímsson
A bijection between evil-avoiding and rectangular permutations
Katherine Tung
Ninth variation of classical group characters of type A-D and Littlewood identities
Mikhail Goltsblat
Generalization of Markov Diophantine equation via generalized cluster algebra
Yasuaki Gyoda
;
Kodai Matsushita
Face posets of tropical polyhedra and monomial ideals
Georg Loho
;
Ben Smith
Edge separators for graphs excluding a minor
Gwenaël Joret
;
William Lochet
;
Michał T. Seweryn
On Rödl's theorem for cographs
Lior Gishboliner
;
Asaf Shapira
Weak (2, 3)-decomposition of planar graphs
Ming Han
;
Xuding Zhu
The degree and codegree threshold for linear triangle covering in 3-graphs
Yuxuan Tang
;
Yue Ma
;
Xinmin Hou
Irregularity of graphs respecting degree bounds
Dieter Rautenbach
;
Florian Werner
Generalized Heawood numbers
Wolfgang Kühnel
Weak degeneracy of planar graphs and locally planar graphs
Ming Han
;
Tao Wang
;
Jianglin Wu
;
Huan Zhou
;
Xuding Zhu
Three new refined Arnold families
Sen-Peng Eu
;
Louis Kao
Off-diagonally symmetric domino tilings of the Aztec diamond
Yi-Lin Lee
On sequences without short zero-sum subsequences
Xiangneng Zeng
;
Pingzhi Yuan
On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
Igor Araujo
;
József Balogh
;
Haoran Luo
Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor
Jorn van der Pol
Separating the online and offline DP-chromatic numbers
Peter Bradshaw
Counterexamples to the characterisation of graphs with equal independence and annihilation number
Michaela Hiller
A bijection between \(K\)-Kohnert diagrams and reverse set-valued tableaux
Jianping Pan
;
Tianyi Yu
Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture
Jakub Przybyło
;
Fan Wei
Finding large rainbow trees in colourings of \(K_{n, n}\)
Julian Matthes
A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph
Kenta Ozeki
;
Masao Tsugaki
An action of the cactus group on shifted tableau crystals
Inês Rodrigues
Improved lower bounds for multiplicative square-free sequences
Péter Pál Pach
;
Máté Vizer
Semi-restricted rock, paper, scissors
Sam Spiro
;
Erlang Surya
;
Ji Zeng
RSK tableaux and the weak order on fully commutative permutations
Emily Gunawan
;
Jianping Pan
;
Heather M. Russell
;
Bridget Tenner
On eventually periodic sets as minimal additive complements
Fan Zhou
Weisfeiler-Leman indistinguishability of graphons
Jan Böker
Polynomial extension of the stronger central sets theorem
Sayan Goswami
;
Lorenzo Luperi Baglini
;
Sourav Kanti Patra
On hierarchically closed fractional intersecting families
Niranjan Balachandran
;
Srimanta Bhattacharya
;
Krishn Kher
;
Rogers Mathew
;
Brahadeesh Sankarnarayanan
The number of polyiamonds is supermultiplicative
Vuong Bui
Some exact results for non-degenerate generalized Turán problems
Dániel Gerbner
Chromatic polynomials of 2-edge-coloured graphs
Iain Beaton
;
Danielle Cox
;
Christopher Duffy
;
Nicole Zolkavich
Roots of descent polynomials and an algebraic inequality on hook lengths
Pakawut Jiradilok
;
Thomas McConville
Nearly Gorenstein polytopes
Thomas Hall
;
Max Kölbl
;
Koji Matsushita
;
Sora Miyashita
Powersum bases in quasisymmetric functions and quasisymmetric functions in non-commuting variables
Anthony Lazzeroni
Tropical moduli spaces of rational graphically stable curves
Andy Fry
Bounds on area involving lattice size
Jenya Soprunova