Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 20 (2013)
no. 4
Précédent
Suivant
Tome 20 (2013) no. 4
Sommaire
Metric dimension for random graphs
Béla Bollobás
;
Dieter Mitsche
;
Paweł Prałat
Repeated columns and an old chestnut
R. P. Anstee
;
Linyuan Lu
A criterion for the log-convexity of combinatorial sequences
Ernest X.W. Xia
;
Olivia X.M. Yao
Generalized spectral characterization of graphs revisited
Wei Wang
The Terwilliger algebra of the incidence graphs of Johnson geometry
Qian Kong
;
Benjian Lv
;
Kaishun Wang
Crossings and nestings in colored set partitions
Eric Marberg
Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\)
Susanna Fishel
;
Myrto Kallipoliti
;
Eleni Tzanaki
Maximum induced forests in graphs of bounded treewidth
Glenn G. Chappell
;
Michael J. Pelsmajer
Random cyclations
Nicholas Pippenger
Counting permutations modulo pattern-replacement equivalences for three-letter patterns
William Kuszmaul
A bipartite graph with non-unimodal independent set sequence
Arnab Bhattacharyya
;
Jeff Kahn
The complexity of generalized domino tilings
Igor Pak
;
Jed Yang
The number of fixed points of Wilf's partition involution
Stephan Wagner
New results on degree sequences of uniform hypergraphs
Sarah Behrens
;
Catherine Erbes
;
Michael Ferrara
;
Stephen G. Hartke
;
Benjamin Reiniger
;
Hannah Spinoza
;
Charles Tomlinson
An approximate vertex-isoperimetric inequality for \(r\)-sets
Demetres Christofides
;
David Ellis
;
Peter Keevash
Two layer 3D floor planning
Paul Horn
;
Gabor Lippner
Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
Nihal Gowravaram
;
Ravi Jagadeesan
Skew spectra of oriented bipartite graphs
A. Anuradha
;
R. Balakrishnan
;
Xiaolin Chen
;
Xueliang Li
;
Huishu Lian
;
Wasin So
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
Jan Goedgebeur
;
Stanisław P. Radziszowski
Proof of Sun's conjecture on the divisibility of certain binomial sums
Victor J. W. Guo
Separability of density matrices of graphs for multipartite systems
Chen Xie
;
Hui Zhao
;
Zhixi Wang
Cyclic decomposition of \(k\)-permutations and eigenvalues of the arrangement graphs
Bai Fan Chen
;
Ebrahim Ghorbani
;
Kok Bin Wong
Computational results on the traceability of oriented graphs of small order
Alewyn Burger
A bijection proving the Aztec diamond theorem by combing lattice paths
Frédéric Bosio
;
Marc A. A. van Leeuwen
Random walks on quasirandom graphs
Ben Barber
;
Eoin Long
Enumeration of specific classes of polycubes
Jean-Marc Champarnaud
;
Quentin Cohen-Solal
;
Jean-Philippe Dubernard
;
Hadrien Jeanne
Spectra of edge-independent random graphs
Linyuan Lu
;
Xing Peng
On the codegree density of complete 3-graphs and related problems
Victor Falgas-Ravry
Unique sequences containing no \(k\)-term arithmetic progressions
Tanbir Ahmed
;
Janusz Dybizbánski
;
Hunter Snevily
Enumeration of generalized BCI lambda-terms
Olivier Bodini
;
Danièle Gardy
;
Bernhard Gittenberger
;
Alice Jacquot
New aspects of regions whose tilings are enumerated by perfect powers
Tri Lai
Periodic coefficients and random Fibonacci sequences
Karyn McLellan
Sparse distance sets in the triangular lattice
Tanbir Ahmed
;
Hunter Snevily
Tree-like tableaux
Jean-Christophe Aval
;
Adrien Boussicault
;
Philippe Nadeau
Inequivalence of skew Hadamard difference sets and triple intersection numbers modulo a prime
Koji Momihara
A basis for the diagonally signed-symmetric polynomials
José Manuel Gómez
On the Betti numbers of some classes of binomial edge ideals
Sohail Zafar
;
Zohaib Zahid