Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 21 (2014)
no. 4
Précédent
Suivant
Tome 21 (2014) no. 4
Sommaire
The optimal drawings of \(K_{5,n}\)
César Hernández-Vélez
;
Carolina Medina
;
Gelasio Salazar
Limits of Boolean functions on \(\mathbb{F}_p^n\)
Hamed Hatami
;
Pooya Hatami
;
James Hirst
Permutation reconstruction from differences
Marzio De Biasi
Isometric embeddings of half-cube graphs in half-spin Grassmannians
Mark Pankov
An extension of Turán's theorem, uniqueness and stability
Peter Allen
;
Julia Böttcher
;
Jan Hladký
;
Diana Piguet
Coxeter-Knuth graphs and a signed little map for type B reduced words
Sara Billey
;
Zachary Hamaker
;
Austin Roberts
;
Benjamin Young
Enumerating Hamiltonian cycles
Ville H. Pettersson
New infinite families of congruences modulo 8 for partitions with even parts distinct
Ernest X. W. Xia
Graph homomorphisms between trees
Péter Csikvári
;
Zhicong Lin
The range of a simple random walk on \(\mathbb{Z}\): an elementary combinatorial approach
Bernhard A. Moser
Operators of equivalent sorting power and related Wilf-equivalences
Michael Albert
;
Mathilde Bouvel
\(k\)-fold Sidon sets
Javier Cilleruelo
;
Craig Timmons
On sets with few intersection numbers in finite projective and affine spaces
Nicola Durante
Mutations of fake weighted projective spaces
Tom Coates
;
Samuel Gonshaw
;
Alexander Kasprzyk
;
Navid Nabijou
The Combinatorial Nullstellensätze revisited
Pete L. Clark
Decomposing labeled interval orders as pairs of permutations
Anders Claesson
;
Stuart A. Hannah
Chromatic bounds on orbital chromatic roots
Dae Hyun Kim
;
Alexander H. Mun
;
Mohamed Omar
Enumerating permutations by their run structure
Christopher J. Fewster
;
Daniel Siemssen
Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
Magnus Bordewich
;
Ross J. Kang
Schreier graphs of an extended version of the binary adding machine.
Daniele D'Angeli
On the subpartitions of the ordinary partitions. II
Byungchan Kim
;
Eunmi Kim
Turán problems on non-uniform hypergraphs
J. Travis Johnston
;
Linyuan Lu
Counting permutations by alternating descents
Ira M. Gessel
;
Yan Zhuang
Some spectral properties of uniform hypergraphs
Jiang Zhou
;
Lizhu Sun
;
Wenzhe Wang
;
Changjiang Bu
Avoiding 7-circuits in 2-factors of cubic graphs
Robert Lukoťka
On \(m\)-closed graphs
Leila Sharifan
;
Masoumeh Javanbakht
Schubert polynomials and \(k\)-Schur functions
Carolina Benedetti
;
Nantel Bergeron
Integer decomposition property of dilated polytopes
David A. Cox
;
Christian Haase
;
Takayuki Hibi
;
Akihiro Higashitani
A 64-dimensional counterexample to Borsuk's conjecture
Thomas Jenrich
;
Andries E. Brouwer
Shattering-extremal set systems of VC dimension at most 2
Tamás Mészáros
;
Lajos Rónyai
Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
Moshe Cohen
;
Mina Teicher
An abstraction of Whitney's broken circuit theorem
Klaus Dohmen
;
Martin Trinks
A combinatorial approach to Ebert's hat game with many colors
Uthaipon Tantipongpipat
Bruhat order on partial fixed point free involutions.
Mahir Bilen Can
;
Yonah Cherniavsky
;
Tim Twelbeck
Structure coefficients of the Hecke algebra of \((\mathcal{S}_{2n},\mathcal{B}_n)\)
Omar Tout
On floors and ceilings of the \(k\)-Catalan arrangement
Marko Thiel
Face-width of Pfaffian braces and polyhex graphs on surfaces
Dong Ye
;
Heping Zhang
The number of moves of the largest disc in shortest paths on Hanoi graphs
Simon Aumann
;
Katharina A.M. Götz
;
Andreas M. Hinz
;
Ciril Petr
A slight improvement to the colored Bárány's theorem
Zilin Jiang
A combinatorial proof for Cayley's identity
Markus Fulmek
The Ramsey numbers of paths versus wheels: a complete solution
Binlong Li
;
Bo Ning
Ramsey precompact expansions of homogeneous directed graphs
Jakub Jasiński
;
Claude Laflamme
;
Lionel Nguyen Van Thé
;
Robert Woodrow
Equidistributed statistics on matchings and permutations
Niklas Eriksen
;
Jonas Sjöstrand
Combinatorial nullstellensatz modulo prime powers and the parity argument
László Varga
On groups all of whose undirected Cayley graphs of bounded valency are integral
István Estélyi
;
István Kovács
Enumeration of tilings of quartered Aztec rectangles
Tri Lai
The game chromatic number of dense random graphs
Ralph Keusch
;
Angelika Steger
A superlocal version of Reed's conjecture
Katherine Edwards
;
Andrew D. King
Bell numbers modulo a prime number, traces and trinomials
Luis H. Gallardo
;
Olivier Rahavandrainy
The degree-diameter problem for circulant graphs of degree 8 and 9
Robert R. Lewis
Growth rates of geometric grid classes of permutations
David Bevan
Infinite graphs with finite 2-distinguishing cost
Debra Boutin
;
Wilfried Imrich
On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\)
Stefko Miklavic
;
Safet Penjic