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