Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 19 (2012)
no. 4
Précédent
Suivant
Tome 19 (2012) no. 4
Sommaire
The lowest-degree polynomial with nonnegative coefficients divisible by the \(n\)-th cyclotomic polynomial
John P. Steinberger
Constructions of bipartite and bipartite-regular hypermaps
Rui Duarte
Invariant principal order ideals under Foata's transformation
Teresa X.S. Li
;
Melissa Y.F. Miao
Some constant weight codes from primitive permutation groups
Derek H. Smith
;
Roberto Montemanni
Rainbow connection of sparse random graphs
Alan Frieze
;
Charalampos E. Tsourakakis
Uniquely \(K_r\)-saturated graphs
Stephen G. Hartke
;
Derrick Stolee
On extensions of the Alon-Tarsi Latin square conjecture
Daniel Kotlar
Orientations, semiorders, arrangements, and parking functions
Sam Hopkins
;
David Perkinson
The closed knight tour problem in higher dimensions
Joshua Erde
;
Bruno Golénia
;
Sylvain Golénia
Maximum frustration in bipartite signed graphs
Garry S Bowlin
Repetition threshold for circular words
Irina A. Gorbunova
Hypohamiltonian graphs and their crossing number
Carol T. Zamfirescu
Spectral properties of unitary Cayley graphs of finite commutative rings
Xiaogang Liu
;
Sanming Zhou
Locally restricted compositions. IV. Nearly free large parts and gap-freeness
Edward A. Bender
;
E. Rodney Canfield
;
Zhicheng Gao
New proofs of determinant evaluations related to plane partitions
Hjalmar Rosengren
Ehrhart \(f^*\)-coefficients of polytopal complexes are non-negative integers
Felix Breuer
Finite homomorphism-homogeneous permutations via edge colourings of chains
Igor Dolinka
;
Éva Jungábel
Large 2-coloured matchings in 3-coloured complete hypergraphs
Tamás Terpai
Canonical decompositions of affine permutations, affine codes, and split \(k\)-Schur functions
Tom Denton
On codes that are invariant under the affine group.
Peter Sin
A simple branching process approach to the phase transition in \(G_{n,p}\)
Béla Bollobás
;
Oliver Riordan
Schur polynomials, banded Toeplitz matrices and widom's formula
Per Alexandersson
A note on automorphisms of the infinite-dimensional hypercube graph
Mark Pankov
Large incidence-free sets in geometries
Stefaan De Winter
;
Jeroen Schillewaert
;
Jacques Verstraete
Distance powers and distance matrices of integral Cayley graphs over abelian groups
Walter Klotz
;
Torsten Sander
Irreducible cycles and points in special position in moduli spaces for tropical curves
Andreas Gathmann
;
Franziska Schroeter
On the parity of certain coefficients for a \(q\)-analogue of the Catalan numbers
Kendra Killpatrick
Properties of random difference graphs
Christopher Ross
Partially ordinal sums and \(P\)-partitions
Daniel K. Du
;
Qing-Hu Hou
Resolving sets and semi-resolving sets in finite projective planes
Tamás Héger
;
Marcella Takáts
A construction of short sequences containing all permutations of a set as subsequences
Sasa Radomirovic
Identifying vertex covers in graphs
Michael A Henning
;
Anders Yeo
Structure of colored complete graphs free of proper cycles
Vincent Coll
;
Colton Magnant
;
Kathleen Ryan
Some convolution identities and an inverse relation involving partial Bell polynomials
Daniel Birmajer
;
Juan B. Gil
;
Michael D. Weiner
The (signless Laplacian) spectral radii of connected graphs with prescribed degree sequences
Muhuo Liu
Ramsey numbers \(R(K_3, G)\) for graphs of order 10
Gunnar Brinkmann
;
Jan Goedgebeur
;
Jan-Christoph Schlage-Puchta
The hitting time of rainbow connection number two
Annika Heckel
;
Oliver Riordan
A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
Wei Xianglin
Combinatorial expansions in \(K\)-theoretic bases
Jason Bandlow
;
Jennifer Morse
Münchhausen matrices
Michael Brand
Counting bases of representable matroids
Michael Snook
Hopf algebra of building sets.
Vladimir Grujić
;
Tanja Stojadinović
An ordered Turán problem for bipartite graphs
Craig Timmons
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
Andrzej Dudek
;
Alan Frieze
;
Po-Shen Loh
;
Shelley Speiss
\(\Gamma \)-species and the enumeration of \(k\)-trees
Andrew Gainer-Dewar
The tau constant and the edge connectivity of a metrized graph
Zubeyir Cinkir
Three color Ramsey numbers for graphs with at most 4 vertices
Luis Boza
;
Janusz Dybizbański
;
Tomasz Dzido
Further analysis on the total number of subtrees of trees
Shuchao Li
;
Shujing Wang
On cross-intersecting families of set partitions
Cheng Yeaw Ku
;
Kok Bin Wong
List-coloring graphs on surfaces with varying list-sizes
Alice M. Dean
;
Joan P. Hutchinson
On the spanning trees of the hypercube and other products of graphs
Olivier Bernardi
On the number of partition weights with Kostka multiplicity one
Zachary Gates
;
Brian Goldman
;
C. Ryan Vinroot
Connectivity for random graphs from a weighted bridge-addable class
Colin McDiarmid
The number of ways to assemble a graph
Andrew Vince
;
Miklós Bóna
Generalized Alcuin's sequence
Daniel Panario
;
Murat Sahin
;
Qiang Wang
Identifying codes of lexicographic product of graphs
Min Feng
;
Min Xu
;
Kaishun Wang