Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 19 (2012)
no. 1
Précédent
Suivant
Tome 19 (2012) no. 1
Sommaire
Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
Andrew Lazowski
;
Stephen M. Shea
On Euclidean designs and potential energy
Tsuyoshi Miezaki
;
Makoto Tagami
On harmonious colouring of trees
A. Aflaki
;
S. Akbari
;
K.J. Edwards
;
D.S. Eskandani
;
M. Jamaali
;
H. Ravanbod
On the upper tail of counts of strictly balanced subgraphs
Matas Šileikis
Local-to-global principles for the hitting sequence of a rotor walk
Giuliano Pezzolo Giacaglia
;
Lionel Levine
;
James Propp
;
Linda Zayas-Palmer
A basis of finite and infinite sets with small representation function
Artūras Dubickas
Descents of permutations in a Ferrers board
Chunwei Song
;
Catherine Yan
An improved inequality related to Vizing's conjecture
Stephen Suen
;
Jennifer Tarr
The \({1/k}\)-Eulerian polynomials
Carla D. Savage
;
Gopal Viswanathan
Anti-codes in terms of Berlekamp's switching game
Uwe Schauz
Partitions, Kostka polynomials and pairs of trees
Eliana Zoque
Kaleidoscopical configurations in \(G\)-spaces
Taras Banakh
;
Oleksandr Petrenko
;
Igor Protasov
;
Sergiy Slobodianiuk
Flag \(f\)-vectors of three-colored complexes
Andrew Frohmader
\(h\)-vectors of small matroid complexes
Jesús A. De Loera
;
Yvonne Kemper
;
Steven Klee
Domination reliability
Klaus Dohmen
;
Peter Tittmann
Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
Luis Serrano
;
Christian Stump
Propagation connectivity of random hypergraphs
Amin Coja-Oghlan
;
Mikael Onsjö
;
Osamu Watanabe
Pandiagonal sudokus
Walter Klotz
;
Torsten Sander
The smallest one-realization of a given set
Ping Zhao
;
Kefeng Diao
;
Kaishun Wang
Rainbow connection number and connectivity
Xueliang Li
;
Sujuan Liu
;
L. Sunil Chandran
;
Rogers Mathew
;
Deepak Rajendraprasad
Generating trees and pattern avoidance in alternating permutations
Joel Brewster Lewis
The positive minimum degree game on sparse graphs
József Balogh
;
András Pluhár
On Ryser's conjecture
P. E. Haxell
;
A. D. Scott
A note on random \(k\)-SAT for moderately growing \(k\)
Jun Liu
;
Zongsheng Gao
;
Ke Xu
On the number of Hamilton cycles in pseudo-random graphs
Michael Krivelevich
Symmetric chain decomposition of necklace posets
Vivek Dhand
Sequences of integers avoiding 3-term arithmetic progressions
Arun Sharma
Actions and identities on set partitions
Eric Marberg
Refined inversion statistics on permutations
Joshua Sack
;
Henning Úlfarsson
A construction for the hat problem on a directed graph
Rani Hod
;
Marcin Krzywkowski
Susceptibility in inhomogeneous random graphs
Svante Janson
;
Oliver Riordan
Bounds for identifying codes in terms of degree parameters
Florent Foucaud
;
Guillem Perarnau
Balanced line for a 3-colored point set in the plane
Sergey Bereg
;
Mikio Kano
The existence of strong complete mappings
Anthony B. Evans
Automorphism groups of rational circulant graphs
Mikhail Klin
;
István Kovács
The negative \(q\)-binomial
Shishuo Fu
;
V. Reiner
;
Dennis Stanton
;
Nathaniel Thiem
Properties of \(\theta\)-super positive graphs
Cheng Yeaw Ku
;
Kok Bin Wong
Plactic relations for \(r\)-domino tableaux
Müge Taşkin
The chromatic number and the least eigenvalue of a graph
Yi-Zheng Fan
;
Gui-Dong Yu
;
Yi Wang
The identities of additive binary arithmetics
Anton A. Klyachko
;
Ekaterina V. Menshova
On-line list colouring of complete multipartite graphs
Seog-Jin Kim
;
Young Soo Kwon
;
Daphne Der-Fen Liu
;
Xuding Zhu
Efficient oracles for generating binary bubble languages
J. Sawada
;
A. Williams
On the number of \(F\)-matchings in a tree
Hiu-Fai Law
Integral sets and Cayley graphs of finite groups
Roger C. Alperin
;
Brian L. Peterson
Rainbow-free 3-colorings of abelian groups
Amanda Montejano
;
Oriol Serra
Rainbow Hamilton cycles in uniform hypergraphs
Andrzej Dudek
;
Alan Frieze
;
Andrzej Ruciński
Random subgraphs in Cartesian powers of regular graphs
Felix Joos
The 2-adic valuation of plane partitions and totally symmetric plane partitions
William J. Keith
On the number of indecomposable permutations with a given number of cycles
Robert Cori
;
Claire Mathieu
;
John Michael Robson
The covered components polynomial: a new representation of the edge elimination polynomial
Martin Trinks
The effect of random edge removal on network degree sequence
Thomas DuBois
;
Stephen Eubank
;
Aravind Srinivasan
Two-part set systems
Péter L. Erdős
;
Dániel Gerbner
;
Nathan Lemons
;
Dhruv Mubayi
;
Cory Palmer
;
Balázs Patkós
Cubic vertex-transitive non-Cayley graphs of order \(8p\)
Jin-Xin Zhou
;
Yan-Quan Feng
A dice rolling game on a set of tori
Jeehoon Kang
;
Suh-Ryung Kim
;
Boram Park
Minimum clique number, chromatic number, and Ramsey numbers
Gaku Liu
Poset pinball, highest forms, and \((n-2,2)\) Springer varieties
Barry Dewitt
;
Megumi Harada
A combinatorial proof of the recurrence for rook paths
Emma Yu Jin
;
Markus E. Nebel
The chromatic index of a graph whose core has maximum degree 2
Mikio Kano
;
Saieed Akbari
;
Maryam Ghanbari
;
Mohammad Javad Nikmehr
The full automorphism group of Cayley graphs of \(\mathbb{Z}_p\times\mathbb{Z}_{p^2}\)
Edward Dobson
Combinatorial interpretations of particular evaluations of complete and elementary symmetric functions
Pietro Mongelli
Doubly biased maker-breaker connectivity game
Dan Hefetz
;
Mirjana Mikalački
;
Miloš Stojaković
Surprising symmetries in objects counted by Catalan numbers
Miklós Bóna
Avoiding \((m,m,m)\)-arrays of order \(n=2^k\)
Lina J. Andrén
Largest and smallest minimal percolating sets in trees
Eric Riedl
Hamiltonicity of minimum distance graphs of 1-perfect codes
Alexander Mikhailovich Romanov
On the Ramsey number \(R(4,6)\)
Geoffrey Exoo
Distortion of the hyperbolicity constant of a graph
Walter Carballosa
;
Domingo Pestana
;
José M. Rodríguez
;
José M. Sigarreta
On \(Q\)-polynomial association schemes of small class
Sho Suda
The tight upper bound for the number of matchings of tricyclic graphs
Ardeshir Dolati
;
Somayyeh Golalizadeh