Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 20 (2013)
no. 3
Précédent
Suivant
Tome 20 (2013) no. 3
Sommaire
Maximum planar subgraphs in dense graphs
Peter Allen
;
Jozef Skokan
;
Andreas Würfl
Gromov hyperbolicity in strong product graphs
Walter Carballosa
;
Rocío M. Casablanca
;
Amauris de la Cruz
;
José M. Rodríguez
Degree distribution of an inhomogeneous random intersection graph
Mindaugas Bloznelis
;
Julius Damarackas
Limits of modified higher \(q,t\)-Catalan numbers
Kyungyong Lee
;
Li Li
;
Nicholas A Loehr
Recognition and characterization of chronological interval digraphs
Sandip Das
;
Mathew Francis
;
Pavol Hell
;
Jing Huang
A bound on permutation codes
Jürgen Bierbrauer
;
Klaus Metsch
An identity conjectured by Lacasse via the tree function
Helmut Prodinger
\((2,m,n)\)-groups with Euler characteristic equal to \(-2^as^b\).
Nick Gill
Geometric constructions for symmetric 3-configurations
Leah Wrenn Berman
On the independence numbers of the cubes of odd cycles
Tom Bohman
;
Ron Holzman
;
Venkatesh Natarajan
Extensions to 2-factors in bipartite graphs
Jennifer Vandenbussche
;
Douglas B. West
A plethysm formula on the characteristic map of induced linear characters from \(U_n(\mathbb F_q)\) to \(GL(\mathbb F_q)\).
Zhi Chen
The number of Euler tours of random directed graphs
Páidí Creed
;
Mary Cryan
Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
Suho Oh
Balanced vertex decomposable simplicial complexes and their \(h\)-vectors
Jennifer Biermann
;
Adam Van Tuyl
Symmetry in Gardens of Eden
Christiaan Hartman
;
Marijn J. H. Heule
;
Kees Kwekkeboom
;
Alain Noels
Eigenvalue pairing in the response matrix for a class of network models with circular symmetry
Miriam Farber
;
Charles R Johnson
;
Wei Zhen
A characterization of graphs by codes from their incidence matrices
Peter Dankelmann
;
Jennifer D. Key
;
Bernardo G. Rodrigues
An inhomogeneous lambda-determinant
Philippe Di Francesco
Regularity of join-meet ideals of distributive lattices
Viviana Ene
;
Ayesha Asloob Qureshi
;
Asia Rauf
The spectral excess theorem for distance-biregular graphs.
Miquel Àngel Fiol
The combinatorics of interval vector polytopes
Matthias Beck
;
Jessica De Silva
;
Gabriel Dorfsman-Hopkins
;
Joseph Pruitt
;
Amanda Ruiz
Can colour-blind distinguish colour palettes?
Rafał Kalinowski
;
Monika Pilśniak
;
Jakub Przybyło
;
Mariusz Woźniak
Embedding cycles in finite planes
Felix Lazebnik
;
Keith E. Mellinger
;
Oscar Vega
A note on total and paired domination of Cartesian product graphs
K. Choudhary
;
S. Margulies
;
I. V. Hicks
The edit distance function and symmetrization
Ryan R. Martin
The adjacency matroid of a graph
Lorenzo Traldi
;
Robert Brijder
;
Hendrik Jan Hoogeboom
Greedy trees, subtrees and antichains
Eric Ould Dadah Andriantiana
;
Stephan Wagner
;
Hua Wang
Medial symmetry type graphs
Isabel Hubard
;
María del Río Francos
;
Alen Orbanić
;
Tomaž Pisanski
On sumsets of multisets in \(\mathbb{Z}_p^m\)
Kaisa Matomäki
Knots in collapsible and non-collapsible balls
Bruno Benedetti
;
Frank H. Lutz
Upper-bounding the \(k\)-colorability threshold by counting covers
Amin Coja-Oghlan
Involutions on standard Young tableaux and divisors on metric graphs
Rohit Agrawal
;
Gregg Musiker
;
Vladimir Sotirov
;
Fan Wei
Symmetric polynomials and symmetric mean inequalities
Karl Mahlburg
;
Clifford Smyth
Integral circulant Ramanujan graphs of prime power order
T. A. Le
;
J. W. Sander
On the size of Kakeya sets in finite vector spaces
Gohar Kyureghyan
;
Peter Müller
;
Qi Wang
Coloring 2-intersecting hypergraphs
Lucas Colucci
;
András Gyárfás
Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
Wei-Tian Li
;
Bor-Liang Chen
;
Kuo-Ching Huang
;
Ko-Wei Lih
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
Pawel Wocjan
;
Clive Elphick
On the relationship between pipe dreams and permutation words
Cameron Marcott
From heaps of matches to the limits of computability
Urban Larsson
;
Johan Wästlund
Product dimension of forests and bounded treewidth graphs
L. Sunil Chandran
;
Rogers Mathew
;
Deepak Rajendraprasad
;
Roohani Sharma
Enumerating finite racks, quandles and kei
Simon R. Blackburn
Shattering, graph orientations, and connectivity
László Kozma
;
Shay Moran
Delay colourings of cubic graphs
Agelos Georgakopoulos
Nordhaus-Gaddum theorem for the distinguishing chromatic number
Karen L. Collins
;
Ann Trenk
Self-avoiding walks and the Fisher transformation
Geoffrey Grimmett
;
Zhongyang Li
Oriented hypergraphs: introduction and balance
Lucas J. Rusnak
The size of edge-critical uniquely 3-colorable planar graphs
Naoki Matsumoto
A new statistic on the hyperoctahedral groups
Alexander Stasinski
;
Christopher Voll
Chains of length 2 in fillings of layer polyominoes
Mitch Phillipson
;
Catherine H. Yan
;
Jean Yeh
A note on the acquaintance time of random graphs
William B. Kinnersley
;
Dieter Mitsche
;
Paweł Prałat
Linked partitions and permutation tableaux
William Y.C. Chen
;
Lewis H. Liu
;
Carol J. Wang
Rational associahedra and noncrossing partitions
Drew Armstrong
;
Brendon Rhoades
;
Nathan Williams
A note on forbidding clique immersions
Matt DeVos
;
Jessica McDonald
;
Bojan Mohar
;
Diego Scheide
Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters
Wayne Barrett
;
Shaun M. Fallat
;
H. Tracy Hall
;
Leslie Hogben
On the characteristic polynomial of \(n\)-Cayley digraphs
Majid Arezoomand
;
Bijan Taeri
On Wilf equivalence for alternating permutations
Sherry H.F. Yan
The range of a random walk on a comb
János Pach
;
Gábor Tardos