Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 26 (2019)
no. 4
Précédent
Suivant
Tome 26 (2019) no. 4
Sommaire
Statistical properties of lambda terms
Maciej Bendkowski
;
Olivier Bodini
;
Sergey Dovgal
Universality for random surfaces in unconstrained genus
Thomas Budzinski
;
Nicolas Curien
;
Bram Petri
Fractional domination game
Csilla Bujtas
;
Zsolt Tuza
Combinatorial specifications for juxtapositions of permutation classes
Robert Brignall
;
Jakub Sliačan
Vertex degree sums for matchings in 3-uniform hypergraphs
Yi Zhang
;
Yi Zhao
;
Mei Lu
The toucher-isolator game
Chris Dowden
;
Mihyun Kang
;
Mirjana Mikalački
;
Miloš Stojaković
On the weight of Berge-\(F\)-free hypergraphs
Sean English
;
Dániel Gerbner
;
Abhishek Methuku
;
Cory Palmer
Generalised Mycielski graphs and the Borsuk-Ulam theorem
Tobias Müller
;
Matěj Stehlík
Planar Ramsey graphs
Maria Axenovich
;
Ursula Schade
;
Carsten Thomassen
;
Torsten Ueckerdt
Collapsibility of simplicial complexes of hypergraphs
Alan Lew
Saturation games for odd cycles
Sam Spiro
On the rank of a random binary matrix
Colin Cooper
;
Alan Frieze
;
Wesley Pegden
An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
Alex Cameron
Shellability of posets of labeled partitions and arrangements defined by root systems
Emanuele Delucchi
;
Noriane Girard
;
Giovanni Paolini
Aperiodic two-dimensional words of small abelian complexity
Svetlana Puzynina
The cyclic sieving phenomenon on circular Dyck paths
Per Alexandersson
;
Svante Linusson
;
Samu Potka
When is the \(q\)-multiplicity of a weight a power of \(q\)?
Pamela E. Harris
;
Margaret Rahmoeller
;
Lisa Schneider
;
Anthony Simpson
Position sequences and a \(q\)-analogue for the modular hook length formula
Anthony Mendes
;
Sam Lindbloom-Airey
Pentagonal subdivision
Min Yan
Distributed coloring in sparse graphs with fewer colors
Pierre Aboulker
;
Marthe Bonamy
;
Nicolas Bousquet
;
Louis Esperet
A note on the connectivity of 2-polymatroid minors
Zachary Gershkoff
;
James Oxley
Permutational powers of a graph
Matteo Cavaleri
;
Daniele D'Angeli
;
Alfredo Donno
Combining extensions of the Hales-Jewett theorem with Ramsey theory in other structures
Neil Hindman
;
Dona Strauss
;
Luca Q. Zamboni
Cyclic triangle factors in regular tournaments
Lina Li
;
Theodore Molla
The Gorenstein property for projective coordinate rings of the moduli of parabolic \(\mathrm{SL}_2\)-principal bundles on a smooth curve
Theodore Faust
;
Christopher Manon
Choice functions in the intersection of matroids
Joseph Briggs
;
Minki Kim
The biclique covering number of grids
Krystal Guo
;
Tony Huynh
;
Marco Macchia
Uniform generation of spanning regular subgraphs of a dense graph
Pu Gao
;
Catherine Greenhill
On the twelve-point theorem for \(\ell\)-reflexive polygons
Dimitrios I. Dais
Homomesy in products of three chains and multidimensional recombination
Corey Vorland
On 2-connected hypergraphs with no long cycles
Zoltán Füredi
;
Alexandr Kostochka
;
Ruth Luo
A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
Claude Tardif
;
Xuding Zhu
Fractional factors, component factors and isolated vertex conditions in graphs
Roger Yu
;
Mikio Kano
;
Hongliang Lu
Tamari lattices for parabolic quotients of the symmetric group
Henri Mühle
;
Nathan Williams
A limit theorem for the six-length of random functional graphs with a fixed degree sequence
Kevin Leckey
;
Nick Wormald
Distinguishing graphs of maximum valence 3
Svenja Hüning
;
Wilfried Imrich
;
Judith Kloas
;
Hannah Schreber
;
Thomas W. Tucker
Connected chord diagrams and bridgeless maps
Julien Courtiel
;
Karen Yeats
;
Noam Zeilberger
Matching polytons
Martin Doležal
;
Jan Hladký
Crystals, semistandard tableaux and cyclic sieving phenomenon
Young-Tak Oh
;
Euiyong Park
Ramsey numbers of Berge-hypergraphs and related structures
Nika Salia
;
Casey Tompkins
;
Zhiyu Wang
;
Oscar Zamora
Fractional decompositions and the smallest-eigenvalue separation
Fiachra Knox
;
Bojan Mohar
The maximum number of cycles in a graph with fixed number of edges
Andrii Arman
;
Sergei Tsaturian
Cutting resilient networks -- complete binary trees
Xing Shi Cai
;
Cecilia Holmgren
Nearly neighbourly families of standard boxes
Jacek Bojarski
;
Andrzej Piotr Kisielewicz
;
Krzysztof Przesławski
Domination of the rectangular queen's graph
Sándor Bozóki
;
Péter Gál
;
István Marosi
;
William D. Weakley
Canonical forms for dihedral and symmetric groups
Robert Shwartz
Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels
Bernhard Gittenberger
;
Isabella Larcher
A new bijection between RNA secondary structures and plane trees and its consequences
Ricky Xiaofeng Chen
Nearly-regular hypergraphs and saturation of Berge stars
Bethany Austhof
;
Sean English
On the Schur function expansion of a symmetric quasi-symmetric function
Ira M. Gessel
The weighted Davenport constant of a group and a related extremal problem
Niranjan Balachandran
;
Eshita Mazumdar
Cumulative subtraction games
Gal Cohensius
;
Urban Larsson
;
Reshef Meir
;
David Wahlstedt
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
Shuya Chiba
;
Michitaka Furuya
;
Kenta Ozeki
;
Masao Tsugaki
;
Tomoki Yamashita
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Padraig Condon
;
Alberto Espuny Díaz
;
Daniela Kühn
;
Deryk Osthus
;
Jaehoon Kim