Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 24 (2017)
no. 2
Précédent
Suivant
Tome 24 (2017) no. 2
Sommaire
A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
Michael Severino
Chromatic symmetric functions of hypertrees
Jair Taylor
Counting outerplanar maps
Ivan Geffner
;
Marc Noy
Strong emergence of wave patterns on Kadanoff sandpiles
Kévin Perrot
;
Eric Rémila
Large cliques in sparse random intersection graphs
Mindaugas Bloznelis
;
Valentas Kurauskas
Small feedback vertex sets in planar digraphs
Louis Esperet
;
Laetitia Lemoine
;
Frédéric Maffray
A new bijective proof of Babson and Steingrímsson's conjecture
Joanna N. Chen
;
Shouxiao Li
Neighborhood reconstruction and cancellation of graphs
Richard H. Hammack
;
Cristina Mullican
On \(xD\)-generalizations of Stirling numbers and Lah numbers via graphs and rooks
Sen-Peng Eu
;
Tung-Shan Fu
;
Yu-Chang Liang
;
Tsai-Lien Wong
The coupling method for inhomogeneous random intersection graphs.
Katarzyna Rybarczyk
Juxtaposing Catalan permutation classes with monotone ones
Robert Brignall
;
Jakub Sliačan
Maximal partial spreads of polar spaces
Antonio Cossidente
;
Francesco Pavese
Forbidden pairs with a common graph generating almost the same sets
Shuya Chiba
;
Jun Fujisawa
;
Michitaka Furuya
;
Hironobu Ikarashi
On spherical designs of some harmonic indices
Yan Zhu
;
Eiichi Bannai
;
Etsuko Bannai
;
Kyoung-Tark Kim
;
Wei-Hsuan Yu
New results on \(k\)-independence of graphs
Shimon Kogan
On the maximum running time in graph bootstrap percolation
Béla Bollobás
;
Michał Przykucki
;
Oliver Riordan
;
Julian Sahasrabudhe
Three interactions of holes in two dimensional dimer systems
Tomack Gilmore
Infinite excursions of router walks on regular trees
Sebastian Müller
;
Tal Orenshtein
On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
Andrzej Grzesik
On the minimum number of monochromatic generalized Schur triples
Thotsaporn Thanatipanonda
;
Elaine Wong
A structural characterization for certifying Robinsonian matrices
Monique Laurent
;
Matteo Seminaroti
;
Shin-ichi Tanigawa
Double posets and the antipode of QSym
Darij Grinberg
Pretty good state transfer on circulant graphs
Hiranmoy Pal
;
Bikash Bhattacharjya
Quantum state transfer in coronas
Ethan Ackelsberg
;
Zachary Brehm
;
Ada Chan
;
Joshua Mundinger
;
Christino Tamon
Majority colourings of digraphs
Stephan Kreutzer
;
Sang-il Oum
;
Paul Seymour
;
Dominic van der Zypen
;
David R. Wood
Generating functions for inverted semistandard Young tableaux and generalized ballot numbers
Paul Drube
Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime
Jing Xu
Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm
Carsten Schneider
;
Robin Sulzgruber
Plurigraph coloring and scheduling problems
John Machacek
Enumeration of Fuss-Schröder paths
Suhyung An
;
JiYoon Jung
;
Sangwook Kim
A bound on partitioning clusters
Daniel Kane
;
Terence Tao
Counting racks of order \(n\)
Matthew Ashford
;
Oliver Riordan
Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
Nicola Durante
;
Alessandro Siciliano
A note on independence complexes of chordal graphs and dismantling
Michał Adamaszek
Internally perfect matroids
Aaron Dall
The threshold for jigsaw percolation on random graphs
Béla Bollobás
;
Oliver Riordan
;
Erik Slivken
;
Paul Smith
The rectangle covering number of random Boolean matrices
Mozhgan Pourmoradnasseri
;
Dirk Oliver Theis
Erdős-Ko-Rado type theorems for simplicial complexes
Seyed Amin Seyed Fakhari
Anti-van der Waerden numbers of 3-term arithmetic progression
Zhanar Berikkyzy
;
Alex Shulte
;
Michael Young
Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
Wayne Barrett
;
Shaun Fallat
;
H. Tracy Hall
;
Leslie Hogben
;
Jephian C.-H. Lin
;
Bryan L. Shader
Enumeration of standard Young tableaux of shifted strips with constant width
Ping Sun
New combinatorial formulas for cluster monomials of type \(A\) quivers
Kyungyong Lee
;
Li Li
;
Ba Nguyen
Convolution estimates and number of disjoint partitions
Paata Ivanisvili
Classification of \(Q\)-multiplicity-free skew Schur \(Q\)-functions
Christopher Schure
Latin squares with no transversals
Nicholas J. Cavenagh
;
Ian M. Wanless
Waiter-client and client-waiter colourability and \(k\)-SAT games
Wei En Tan
Graph realizations constrained by skeleton graphs
Péter L. Erdős
;
Stephen G. Hartke
;
Leo van Iersel
;
István Miklós
Forbidden families of minimal quadratic and cubic configurations
Attila Sali
;
Sam Spiro
Isotropic matroids. III: Connectivity
Robert Brijder
;
Lorenzo Traldi
Transversals and independence in linear hypergraphs with maximum degree two
Michael A. Henning
;
Anders Yeo
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
Cecilia Holmgren
;
Svante Janson
;
Matas Sileikis
Some properties of the Fibonacci sequence on an infinite alphabet
Jiemeng Zhang
;
Zhixiong Wen
;
Wen Wu
Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
Alex Scott
;
Paul Seymour