Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 24 (2017)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Majority bootstrap percolation on \(G(n,p)\)
Cecilia Holmgren
;
Tomas Juškevičius
;
Nathan Kettle
Sidorenko's conjecture, colorings and independent sets
Péter Csikvári
;
Zhicong Lin
Flag bicolorings, pseudo-orientations, and double covers of maps
Hiroki Koike
;
Daniel Pellicer
;
Miguel Raggi
;
Steve Wilson
The polytope of \(k\)-star densities
Johannes Rauh
Abaci structures of \((s, ms\pm1)\)-core partitions
Rishi Nath
;
James A. Sellers
Pattern avoidance and Young tableaux
Zhousheng Mei
;
Suijie Wang
The extremal function for cycles of length \(\ell\) mod \(k\)
Benny Sudakov
;
Jacques Verstraete
Enumerating matroids of fixed rank
Rudi Pendavingh
;
Jorn van der Pol
Signed lozenge tilings
D. Cook II
;
Uwe Nagel
Mixed Ehrhart polynomials
Christian Haase
;
Martina Juhnke-Kubitzke
;
Raman Sanyal
;
Thorsten Theobald
Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation
Andrey Kuptsov
;
Eduard Lerner
;
Sofya Mukhamedjanova
An application of Hoffman graphs for spectral characterizations of graphs
Qianqian Yang
;
Aida Abiad
;
Jack H. Koolen
Rainbow matchings and rainbow connectedness
Alexey Pokrovskiy
On star forest ascending subgraph decomposition
Josep M. Aroca
;
Anna Lladó
The maximal order of hyper-(\(b\)-ary)-expansions
Michael Coons
;
Lukas Spiegelhofer
New feasibility conditions for directed strongly regular graphs
Sylvia A. Hobart
;
Jason Williford
On a permutation problem for finite abelian groups
Fan Ge
;
Zhi-Wei Sun
Partitioning random graphs into monochromatic components
Deepak Bal
;
Louis DeBiasio
(Total) domination in prisms
Jernej Azarija
;
Michael Henning
;
Sandi Klavžar
Permutations that destroy arithmetic progressions in elementary \(p\)-groups
Noam D. Elkies
;
Ashvin A. Swaminathan
Algebraic properties of chromatic roots
Peter J. Cameron
;
Kerri Morgan
Paths vs. stars in the local profile of trees
Éva Czabarka
;
László Székely
;
Stephan Wagner
Colorful subhypergraphs in uniform hypergraphs
Meysam Alishahi
On the number of \(r\)-matchings in a tree
Dong Yeap Kang
;
Jaehoon Kim
;
Younjin Kim
;
Hiu-Fai Law
Permanent index of matrices associated with graphs
Tsai-Lien Wong
;
Xuding Zhu
A general method to determine limiting optimal shapes for edge-isoperimetric inequalities
Ellen Veomett
;
Emmanuel Tsukerman
On the multicolor Ramsey number for 3-paths of length three
Tomasz Łuczak
;
Joanna Polcyn
Small subgraphs in the trace of a random walk
Michael Krivelevich
;
Peleg Michaeli
Symmetric graphs with respect to graph entropy
Seyed Saeed Changiz Rezaei
;
Ehsan Chiniforooshan
Rigged configurations for all symmetrizable types
Ben Salisbury
;
Travis Scrimshaw
Elliptic rook and file numbers
Michael J. Schlosser
;
Meesue Yoo
Anti-power prefixes of the Thue-Morse word
Colin Defant
Refining the hierarchies of classes of geometric intersection graphs
Sergio Cabello
;
Miha Jejčič
Rainbow Turán problems for paths and forests of stars
Daniel Johnston
;
Cory Palmer
;
Amites Sarkar
Strong games played on random graphs
Asaf Ferber
;
Pascal Pfister
Ramsey numbers of connected clique matchings
Barnaby Roberts
The three colour hat guessing game on cycle graphs
Witold Szczechla
A \(q\)-analog of Foulkes' conjecture
François Bergeron
Inversion generating functions for signed pattern avoiding permutations
Naiomi T. Cameron
;
Kendra Killpatrick
On bipartite cages of excess 4
Slobodan Filipovski
Minimal orbits of promotion
Kevin Purbhoo
;
Donguk Rhee
King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments
Kristóf Bérczi
;
Attila Joó
A lower bound on the diameter of the flip graph
Fabrizio Frati
Behavior of digital sequences through exotic numeration systems
Julien Leroy
;
Michel Rigo
;
Manon Stipulanti
Guessing numbers of odd cycles
Ross Atkins
;
Puck Rombach
;
Fiona Skerman
\(\delta\)-connectivity in random lifts of graphs
Shashwat Silas
Strongly connected multivariate digraphs
Yaokun Wu
;
Zeying Xu
;
Yinfeng Zhu
A note on non-\(\mathbb{R}\)-cospectral graphs
Fenjin Liu
;
Wei Wang
Lattices related to extensions of presentations of transversal matroids
Joseph E. Bonin
On the minimum length of linear codes over the field of 9 elements
Kazuki Kumegawa
;
Ysukasa Okazaki
;
Tatsuya Maruta
On KM-arcs in small Desarguesian planes
Peter Vandendriessche
On a vertex-minimal triangulation of \(\mathbb R \mathrm P^4\)
Sonia Balagopalan
On 1212-avoiding restricted growth functions
Zhicong Lin
;
Shishuo Fu
A square root map on Sturmian words
Jarkko Peltomäki
;
Markus A. Whiteland
On the number of non-zero elements of joint degree vectors
Éva Czabarka
;
Johannes Rauh
;
Kayvan Sadeghi
;
Taylor Short
;
László Székely
Colored triangulations of arbitrary dimensions are stuffed Walsh maps
Valentin Bonzom
;
Luca Lionni
;
Vincent Rivasseau
On the Schur expansion of Hall-Littlewood and related polynomials via Yamanouchi words
Austin Roberts
An inertial lower bound for the chromatic number of a graph
Clive Elphick
;
Pawel Wocjan
Forbidden Berge hypergraphs
R. P. Anstee
;
Santiago Salazar
On \(q\)-quasiadditive and \(q\)-quasimultiplicative functions
Sara Kropf
;
Stephan Wagner
Transitive avoidance games
J. Robert Johnson
;
Imre Leader
;
Mark Walters
On the smallest non-trivial tight sets in Hermitian polar spaces
Jan De Beule
;
Klaus Metsch
A note on the weak Dirac conjecture
Zeye Han
Dinv and area
Adriano Garsia
;
Guoce Xin
On the queue-number of graphs with bounded tree-width
Veit Wiechert
Sommaire du
Fascicule no. 2
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
Sommaire du
Fascicule no. 3
On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
Jan Kynčl
;
Zuzana Patáková
\(T\)-joins in infinite graphs
Attila Joó
Ideals and quotients of diagonally quasi-symmetric functions
Shu Xiao Li
The spectral gap of graphs arising from substring reversals
Fan Chung
;
Josh Tobin
Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
Andrzej Ruciński
;
Eliza Jackowska
;
Joanna Polcyn
Bounds for distinguishing invariants of infinite graphs
Wilfried Imrich
;
Rafał Kalinowski
;
Monika Pilśniak
;
Mohammad Hadi Shekarriz
Bijection between oriented maps and weighted non-oriented maps
Agnieszka Czyżewska-Jankowska
;
Piotr Śniady
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
Aurélie Lagoutte
Analysis of the gift exchange problem
Moa Apagodu
;
David Applegate
;
N. J. A. Sloane
;
Doron Zeilberger
A Hopf algebraic approach to Schur function identities
Karen Yeats
On the number of solutions in random hypergraph 2-colouring
Felicia Rassmann
Kazhdan-Lusztig polynomials of thagomizer matroids
Katie R. Gedeon
Sorting via chip-firing
Sam Hopkins
;
Thomas McConville
;
James Propp
Expanders with superquadratic growth
Antal Balog
;
Oliver Roche-Newton
;
Dmitry Zhelezov
Orthogonal trades in complete sets of MOLS
Nicholas Cavenagh
;
Diane Donovan
;
Fatih Demirkale
On the structure of the power graph and the enhanced power graph of a group
Ghodratollah Aalipour
;
Saieed Akbari
;
Peter J. Cameron
;
Reza Nikandish
;
Farzad Shaveisi
Coincidences between characters to hook partitions and 2-part partitions on families arising from 2-regular classes
Christine Bessenrodt
Unified Hanani-Tutte theorem
Radoslav Fulek
;
Jan Kynčl
;
Dömötör Pálvölgyi
New constructions of self-complementary Cayley graphs
Lei Wang
;
Cai Heng Li
;
Yin Liu
;
Ci Xuan Wu
Uniform mixing on Cayley graphs
Chris Godsil
;
Hanmeng Zhan
Tail positive words and generalized coinvariant algebras
Brendon Rhoades
;
Andrew Timothy Wilson
Uniform mixing and association schemes
Chris Godsil
;
Natalie Mullin
;
Aidan Roy
Disjoint difference families from Galois rings
Koji Momihara
Top degree part in \(b\)-conjecture for unicellular bipartite maps
Maciej Dołęga
Frankl's conjecture for subgroup lattices
Alireza Abdollahi
;
Russ Woodroofe
;
Gjergji Zaimi
A note on intersecting hypergraphs with large cover number
P. E. Haxell
;
A. D. Scott
On some Euler-Mahonian distributions
Angela Carnevale
Counting Lyndon factors
Amy Glen
;
Jamie Simpson
;
W. F. Smyth
Beyond degree choosability
Daniel W. Cranston
;
Landon Rabern
Quasi-Eulerian hypergraphs
Amin Bahmanian
;
Mateja Šajna
The total acquisition number of random geometric graphs
Ewa Infeld
;
Dieter Mitsche
;
Paweł Prałat
On \(t\)-common list-colorings
Hojin Choi
;
Young Soo Kwon
Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
Hamid Maarouf
Multidimensional lower density versions of Plünnecke's inequality
Kamil Bulinski
Lower bounds on words separation: are there short identities in transformation semigroups?
Andrei A. Bulatov
;
Olga Karpova
;
Arseny M. Shur
;
Konstantin Startsev
Counting gluings of octahedra
Valentin Bonzom
;
Luca Lionni
New upper bound for sums of dilates
Albert Bush
;
Yi Zhao
A note on sparse supersaturation and extremal results for linear homogeneous systems
Christoph Spiegel
A dual Ramsey theorem for permutations
Dragan Mašulović
Tomaszewski's problem on randomly signed sums: breaking the 3/8 barrier
Ravi B. Boppana
;
Ron Holzman
Fair splitting of colored paths
Meysam Alishahi
;
Frédéric Meunier
Connected even factors in the square of essentially 2-edge-connected graph
Jan Ekstein
;
Baoyindureng Wu
;
Liming Xiong
Enumeration of chord diagrams without loops and parallel chords
Evgeniy Krasko
;
Alexander Omelchenko
Nice restrictions of reflection arrangements
Tilman Möller
;
Gerhard Röhrle
Vertex-addition strategy for domination-like invariants
Michitaka Furuya
;
Naoki Matsumoto
On a special class of hyper-permutahedra
Geir Agnarsson
Do triangle-free planar graphs have exponentially many 3-colorings?
Zdeněk Dvořák
;
Jean-Sébastien Sereni
Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\)
Mitchel T. Keller
;
Stephen J. Young
A note on the rainbow connection of random regular graphs
Michael Molloy
Promotion of increasing tableaux: frames and homomesies
Oliver Pechenik
Crystal analysis of type \(C\) Stanley symmetric functions
Graham Hawkes
;
Kirill Paramonov
;
Anne Schilling
Internally fair factorizations and internally fair holey factorizations with prescribed regularity
Aras Erzurumluoğlu
;
Chris A. Rodger
Note on the union-closed sets conjecture
Abigail Raz
Large monochromatic components in edge colored graphs with a minimum degree condition
András Gyárfás
;
Gábor Sárközy
Application of Smirnov words to waiting time distributions of runs
Uta Freiberg
;
Clemens Heuberger
;
Helmut Prodinger
Stability for vertex cycle covers
József Balogh
;
Frank Mousset
;
Jozef Skokan
Majority choosability of digraphs
Marcin Anholcer
;
Bartłomiej Bosek
;
Jarosław Grytczuk
Group actions on partitions
Byungchan Kim
Non-flat regular polytopes and restrictions on chiral polytopes
Gabe Cunningham
Perfect fractional matchings in \(k\)-out hypergraphs
Pat Devlin
;
Jeff Kahn
Rational Dyck paths in the non relatively prime case
Eugene Gorsky
;
Mikhail Mazin
;
Monica Vazirani
Asymptotic behavior of odd-even partitions
Min-Joo Jang
Unimodal permutations and almost-increasing cycles
Kassie Archer
;
L.-K. Lauderdale
Relative difference sets partitioned by cosets
Peter J. Dukes
;
Alan C.H. Ling
A conjecture of Norine and Thomas for abelian Cayley graphs
Fuliang Lu
;
Lianzhu Zhang
Pruned double Hurwitz numbers
Marvin Anas Hahn
Sommaire du
Fascicule no. 4
The gonality sequence of complete graphs
Filip Cools
;
Marta Panizzut
Minimum cuts of distance-regular digraphs
Saleh Ashkboos
;
Gholamreza Omidi
;
Fateme Shafiei
;
Khosro Tajbakhsh
A major-index preserving map on fillings
Per Alexandersson
;
Mehtaab Sawhney
Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
Evan Chen
Disproof of a conjecture of Neumann-Lara
Bernardo Llano
;
Mika Olsen
A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer
Yuchen Pei
A short proof of Moll's minimal conjecture
Lun Lv
Local resilience for squares of almost spanning cycles in sparse random graphs
Andreas Noever
;
Angelika Steger
Smaller subgraphs of minimum degree \(k\)
Frank Mousset
;
Andreas Noever
;
Nemanja Škorić
Fair representation in the intersection of two matroids
Ron Aharoni
;
Eli Berger
;
Dani Kotlar
;
Ran Ziv
The universal Gröbner basis of a binomial edge ideal
Mourtadha Badiane
;
Isaac Burke
;
Emil Sköldberg
On stacked triangulated manifolds
Basudeb Datta
;
Satoshi Murai
Longest monotone subsequences and rare regions of pattern-avoiding permutations
Neal Madras
;
Gökhan Yıldırım
A chip-firing game on the product of two graphs and the tropical Picard group
Alexander Lazar
Even cycles and even 2-factors in the line graph of a simple graph
Arrigo Bonisoli
;
Simona Bonvicini
Quantum walks on generalized quadrangles
Chris Godsil
;
Krystal Guo
;
Tor G. J. Myklebust
Covers of D-type Artin groups
Meirav Amram
;
Robert Shwartz
;
Mina Teicher
Matching and independence complexes related to small grids
Benjamin Braun
;
Wesley K. Hough
Perfect matchings of trimmed Aztec rectangles
Tri Lai
Linear chord diagrams with long chords
Everett Sullivan
Large cuts with local algorithms on triangle-free graphs
Juho Hirvonen
;
Joel Rybicki
;
Stefan Schmid
;
Jukka Suomela
Maximum size of a family of pairwise graph-different permutations
Louis Golowich
;
Chiheon Kim
;
Richard Zhou
Cover \(k\)-uniform hypergraphs by monochromatic loose paths
Changhong Lu
;
Rui Mao
;
Bing Wang
;
Ping Zhang
Induced Ramsey-type results and binary predicates for point sets
Martin Balko
;
Jan Kynčl
;
Stefan Langerman
;
Alexander Pilz
Orbits of antichains in certain root posets
Chao-Ping Dong
;
Suijie Wang
Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability
Thomas Mahoney
Eulerian polynomials, Stirling permutations of the second kind and perfect matchings
Shi-Mei Ma
;
Yeong-Nan Yeh
A step towards Yuzvinsky's conjecture
Isidoro Gitler
;
Enrique Reyes
;
Francisco Javier Zaragoza Martínez
Neighborhood growth dynamics on the Hamming plane
Janko Gravner
;
David Sivakoff
;
Erik Slivken
Avoidability of formulas with two variables
Pascal Ochem
;
Matthieu Rosenfeld
Antimagic orientation of biregular bipartite graphs
Songling Shan
;
Xiaowei Yu
A note on chromatic number and induced odd cycles
Baogang Xu
;
Gexin Yu
;
Xiaoya Zha
A cycle of maximum order in a graph of high minimum degree has a chord
Daniel J. Harvey
On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
Craig Timmons
A Euclidean Ramsey result in the plane
Sergei Tsaturian
Note on a Ramsey theorem for posets with linear extensions
Andrii Arman
;
Vojtěch Rödl
Disjoint cycles of different lengths in graphs and digraphs
Julien Bensmail
;
Ararat Harutyunyan
;
Ngoc Khang Le
;
Binlong Li
;
Nicolas Lichiardopol
Self-avoiding walks and amenability
Geoffrey Grimmett
;
Zhongyang Li
On the connectivity of graphs in association schemes
Brian G. Kodalen
;
William J. Martin
On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
Zoltán Király
;
Lilla Tóthmérész