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