Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 19 (2012)
no. 2
Précédent
Suivant
Tome 19 (2012) no. 2
Sommaire
An algebraic exploration of dominating sets and Vizing's conjecture
Susan Margulies
;
I. V. Hicks
Strings of length 3 in grand-Dyck paths and the Chung-Feller property
Aristidis Sapounakis
;
Panagiotis Tsikouras
;
Ioannis Tasoulas
;
Kostas Manes
Monotone paths in random hypergraphs
Matteo Novaga
;
Pietro Majer
Demazure crystals, Kirillov-Reshetikhin crystals, and the energy function
Anne Schilling
;
Peter Tingley
Self-dual interval orders and row-Fishburn matrices
Sherry H. F. Yan
;
Yuexiao Xu
Extensions of Spivey's Bell number formula
Aimin Xu
A note on zero-sum 5-flows in regular graphs
Saieed Akbari
;
Narges Ghareghani
;
Gholamreza Khosrovshahi
;
Sanaz Zare
Multiranks for partitions into multi-colors
Roberta Rui Zhou
Non-recursively constructible recursive families of graphs
Colleen Bouey
;
Christina Graves
;
Aaron Ostrander
;
Gregory Palma
On the unitary Cayley graph of a ring
Dariush Kiani
;
Mohsen Molla Haji Aghaei
On log-concavity of a class of generalized Stirling numbers
Feng-Zhen Zhao
On the length of a partial independent transversal in a matroidal Latin square
Daniel Kotlar
;
Ran Ziv
On the rank function of a differential poset
Richard P. Stanley
;
Fabrizio Zanello
Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph
Shinya Fujita
Sequences containing no 3-term arithmetic progressions
Janusz Dybizbański
Preserving log-convexity for generalized Pascal triangles
Moussa Ahmia
;
Hacène Belbachir
Arithmetic properties of overpartition pairs into odd parts
Lishuang Lin
Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf
James Allen Fill
;
Svante Janson
;
Mark Daniel Ward
Distinguishing trees in linear time
Carlos Seara
;
Antoni Lozano
;
Mercè Mora
Tight co-degree condition for perfect matchings in 4-graphs
Andrzej Czygrinow
;
Vikram Kamat
An undecidability result on limits of sparse graphs
Endre Csóka
New Turán densities for 3-graphs
Rahil Baber
;
John Talbot
Some results on chromaticity of quasi-linear paths and cycles
Ioan Tomescu
Classification of cubic symmetric tricirculants
Istvan Kovacs
;
Klavdija Kutnar
;
Dragan Marusic
;
Steve Wilson
Improved upper bounds for planarization and series-parallelization of degree-bounded graphs
Keith Edwards
;
Graham Farr
The coin exchange problem and the structure of cube tilings
Andrzej Piotr Kisielewicz
;
Krzysztof Przeslawski
Distinguishability of infinite groups and graphs
Simon M Smith
;
Thomas W Tucker
;
Mark E Watkins
The existence of near generalized balanced tournament designs
Chengmin Wang
;
Jie Yan
The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
Imed Zaguia
The Ramsey number of loose triangles and quadrangles in hypergraphs
Andras Gyarfas
;
Ghaffar Raeisi
Drawing Hamiltonian cycles with no large angles
Adrian Dumitrescu
;
János Pach
;
Géza Tóth
Lower bounds on the obstacle number of graphs
Padmini Mukkamala
;
János Pach
;
Dömötör Pálvölgyi
Sum and shifted-product subsets of product-sets over finite rings
Anh Vinh Le
A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
Murali Krishna Srinivasan
Improving the use of cyclic zippers in finding lower bounds for van der Waerden numbers
John Rabung
;
Mark Lotts
Inequalities between gamma-polynomials of graph-associahedra
Natalie Aisbett
Probabilities of Boolean functions given by random implicational formulas
Antoine Genitrini
;
Bernhard Gittenberger
;
Veronika Kraus
;
Cécile Mailler
Optimal lower bound for 2-identifying codes in the hexagonal grid
Ville Junnila
;
Tero Laihonen
Injective envelopes and projective covers of quivers
Will Grilliette
Locally identifying coloring of graphs
Louis Esperet
;
Sylvain Gravier
;
Mickaël Montassier
;
Pascal Ochem
;
Aline Parreau
Maximal percolation time in hypercubes under 2-bootstrap percolation
Michał Przykucki
On matchings in hypergraphs
Peter Frankl
;
Tomasz Łuczak
;
Katarzyna Mieczkowska
Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
Joe Sawada
;
Roy Li
Binomial edge ideals of graphs
Dariush Kiani
;
Sara Saeedi
Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
Ellen Veomett
;
Andrew John Radcliffe
Some quotients of chain products are symmetric chain orders
Dwight Duffus
;
Jeremy McKibben-Sanders
;
Kyle Thayer
Statistics of blocks in \(k\)-divisible non-crossing partitions
Octavio Arizmendi
Orthogonal systems in vector spaces over finite rings
Thang Van Pham
;
Anh Vinh Le
Alternating permutations with restrictions and standard Young tableaux
Yuexiao Xu
;
Sherry H. F. Yan
On \((K_{q},k)\) stable graphs with small \(k\)
Jean-Luc Fouquet
;
Henri Thuillier
;
Jean-Marie Vanherpe
;
Adam Paweł Wojda
The number of nilpotent semigroups of degree 3.
Andreas Distler
;
J. D. Mitchell
Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
Jennifer Diemunsch
;
Michael Ferrara
;
Allan Lo
;
Casey Moffatt
;
Florian Pfender
;
Paul S Wenger
The \(n\)-card problem, stochastic matrices, and the extreme principle
Justin H.C. Chan
;
Jonathan Jedwab
The decomposition algorithm for skew-symmetrizable exchange matrices
Weiwen Gu
Expansions of \(k\)-Schur functions in the affine nilcoxeter algebra
Chris Berg
;
Nantel Bergeron
;
Steven Pon
;
Mike Zabrocki