Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 20 (2013)
no. 2
Précédent
Suivant
Tome 20 (2013) no. 2
Sommaire
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Maurice Pouzet
;
Nicolas Marc Thiéry
Asymptotic lower bounds on circular chromatic index of snarks
Martin Mačaj
;
Ján Mazák
Maximal antichains of minimum size
Thomas Kalinowski
;
Uwe Leck
;
Ian T. Roberts
Coloring the cube with rainbow cycles
Dhruv Mubayi
;
Randall Stading
Pattern avoidance in matchings and partitions
Jonathan Bloom
;
Sergi Elizalde
Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
Alejandro H. Morales
;
Ekaterina A. Vassilieva
Erdős-Gyárfás conjecture for cubic planar graphs
Christopher Carl Heckman
;
Roi Krakovski
Counting families of mutually intersecting sets
A. E. Brouwer
;
C. F. Mills
;
W. H. Mills
;
A. Verbeek
The biased odd cycle game
Asaf Ferber
;
Roman Glebov
;
Michael Krivelevich
;
Hong Liu
;
Cory Palmer
;
Tomas Valla
;
Máté Vizer
Decomposition of triply rooted trees
William Y.C. Chen
;
Janet F.F. Peng
;
Harold R.L. Yang
A simple proof of an identity of Lacasse
Yidong Sun
Sisterhood in the Gale-Shapley matching algorithm
Yannai A. Gonczarowski
;
Ehud Friedgut
A combinatorial proof of an identity for the divisor generating function
Masanori Ando
Non-classical hyperplanes of \(\mathrm{DW}(5,q)\)
Bart De Bruyn
General lower bounds on maximal determinants of binary matrices
Richard P. Brent
;
Judy-anne H. Osborn
On optimality of designs with three distinct eigenvalues
M. R. Faghihi
;
E. Ghorbani
;
G. B. Khosrovshahi
;
S. Tat
New results in \(t\)-tone coloring of graphs
Daniel Cranston
;
Jaehoon Kim
;
William Kinnersley
An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
Yevgeniy Rudoy
On the skew spectra of Cartesian products of graphs
Cui Denglan
;
Hou Yaoping
Minimal covers of the Archimedean tilings. II.
Mark Mixer
;
Daniel Pellicer
;
Gordon Williams
On the Cartesian product of non well-covered graphs
Bert L Hartnell
;
Douglas F Rall
Circular Nim games
Matthieu Dufour
;
Silvia Heubach
Random lifts of graphs are highly connected
Marcin Witkowski
The capture time of the hypercube
Anthony Bonato
;
Przemysław Gordinowicz
;
Bill Kinnersley
;
Paweł Prałat
Hamilton saturated hypergraphs of essentially minimum size
Andrzej Ruciński
;
Andrzej Żak
Fixed point polynomials of permutation groups.
C. M. Harden
;
D. B. Penman
On the Shannon capacity of triangular graphs
Ashik Mathew Kizhakkepallathu
;
Patric RJ Östergård
;
Alexandru Popa
Excedance numbers for the permutations of type \(B\)
Alina F.Y. Zhao
Congruences for \(q\)-Lucas numbers
Hao Pan
On the rank of \(p\)-schemes
Fateme Raei Barandagh
;
Amir Rahnamai Barghi
Labeling the regions of the type \(C_n\) Shi arrangement
Karola Mészáros
Face numbers of centrally symmetric polytopes produced from Split graphs
Ragnar Freij
;
Matthias Henze
;
Moritz W. Schmitt
;
Günter M. Ziegler
Coupon collector problem for non-uniform coupons and random quotas
Nathan B. Shank
;
Hannah Yang
An extension theorem for terraces.
Matt Ollis
;
Devin Willmott
Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations
Andrei Asinowski
;
Gill Barequet
;
Mireille Bousquet-Mélou
;
Toufik Mansour
;
Ron Y. Pinter
Near packings of graphs
Andrzej Zak
On the number of nonequivalent propelinear extended perfect codes
Joaquim Borges
;
Ivan Yu. Mogilnykh
;
Josep Rifà
;
Faina I. Solov'eva
The number of rooted trees of given depth
Péter Pál Pach
;
Gabriella Pluhár
;
András Pongrácz
;
Csaba Szabó
Affine primitive groups and semisymmetric graphs
Hua Han
;
Zaiping Lu
On blow-ups and injectivity of quivers
Will Grilliette
;
Deborah E. Seacrest
;
Tyler Seacrest
Multivariate Fuss-Narayana polynomials and their application to random matrices
Romuald Lenczewski
;
Rafal Salapata
Integer points in knapsack polytopes and \(s\)-covering radius
Iskander Aliev
;
Martin Henk
;
Eva Linke
Which exterior powers are balanced?
Devlin Mallory
;
Abigail Raz
;
Christino Tamon
;
Thomas Zaslavsky
Generating and enumerating 321-avoiding and skew-merged simple permutations
Michael H. Albert
;
Vincent Vatter
Cores of vertex transitive graphs
David E. Roberson
On slowly percolating sets of minimal size in bootstrap percolation
Fabricio Benevides
;
Michał Przykucki
Graphs on affine and linear spaces and Deuber sets
David S. Gunderson
;
Hanno Lefmann
On the topology of the Cambrian semilattices.
Myrto Kallipoliti
;
Henri Mühle
On the maximum number of \(k\)-hooks of partitions of \(n\)
Anna R.B. Fan
;
Harold R.L. Yang
;
Rebecca T. Yu
Distinguishing maps. II: General case
Thomas W. Tucker
Generalized balanced tournament designs with block size four
Yeow Meng Chee
;
Han Mao Kiah
;
Chengmin Wang
Random graphs from a weighted minor-closed class
Colin McDiarmid
On the union complexity of diametral disks
Boris Aronov
;
Muriel Dulieu
;
Rom Pinchasi
;
Micha Sharir
On drawings and decompositions of 1-planar graphs
Július Czap
;
Dávid Hudák
Barred preferential arrangements
Connor Ahlbach
;
Jeremy Usatine
;
Nicholas Pippenger
Counting \(k\)-convex polyominoes
Anne Micheli
;
Dominique Rossin
Multiplicative partitions
Marc Chamberland
;
Colin Johnson
;
Alice Nadeau
;
Bingxi Wu
A combinatorial proof of an identity from Ramanujan's lost notebook
Lishuang Lin
;
Jian Liu
;
Yezhou Wang
Note on upper density of quasi-random hypergraphs
Vindya Bhat
;
Vojtěch Rödl
Vanishing of doubly symmetrized tensors
Andrew Berget
;
J. A. Dias da Silva
;
Amélia Fonseca
Modular Schur numbers
Jonathan Chappelon
;
María Pastora Revuelta Marchena
;
María Isabel Sanz Domínguez
On the Turán number of forests
Hong Liu
;
Bernard Lidicky
;
Cory Palmer
Integral Cayley multigraphs over abelian and Hamiltonian groups
Matt DeVos
;
Roi Krakovski
;
Bojan Mohar
;
Azhvan Sheikh Ahmady
Rooted \(K_4\)-minors
Ruy Fabila-Monroy
;
David R. Wood