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