Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 19 (2012)
no. 3
Précédent
Suivant
Tome 19 (2012) no. 3
Sommaire
The cyclic sieving phenomenon for non-crossing forests
Stefan Kluge
Ramsey properties of random subgraphs of pseudo-random graphs
Jia Shen
Matchings, cycle bases, and the maximum genus of a graph
Michal Kotrbčík
;
Martin Škoviera
An enumeration of flags in finite vector spaces
C. Ryan Vinroot
Minimal covers of the Archimedean tilings. I
Daniel Pellicer
;
Gordon Williams
Counting packings of generic subsets in finite groups
Roland Bacher
Combinatorial logarithm and point-determining cographs
Ji Li
Reflexive polytopes of higher index and the number 12
Alexander M. Kasprzyk
;
Benjamin Nill
Parity types, cycle structures and autotopisms of Latin squares
Daniel Kotlar
On Zudilin's \(q\)-question about Schmidt's problem
Victor J. W. Guo
;
Jiang Zeng
Block designs with SDP parameters
Harold Ward
A short proof of the odd-girth theorem
Edwin R. van Dam
;
Miquel Angel Fiol
Cospectral graphs and regular orthogonal matrices of level 2
Aida Abiad
;
Willem H Haemers
Polyhedral embeddings of snarks with arbitrary nonorientable genera
Wenzhong Liu
;
Yichao Chen
On a recurrence arising in graph compression
Yongwook Choi
;
Charles Knessl
;
Wojciech Szpankowski
Degrees in oriented hypergraphs and Ramsey \(p\)-chromatic number
Yair Caro
;
Adriana Hansberg
Planar graphs of maximum degree six without 7-cycles are class one
Danjun Huang
;
Weifan Wang
A complete classification of doubly even self-dual codes of length 40
Koichi Betsumiya
;
Masaaki Harada
;
Akihiro Munemasa
Roman domination number of the Cartesian products of paths and cycles
Polona Pavlič
;
Janez Žerovnik
The enumeration of three pattern classes using monotone grid classes
Michael Albert
;
Mike Atkinson
;
Robert Brignall
Viewing determinants as nonintersecting lattice paths yields classical determinantal identities bijectively
Markus Fulmek
Non-contiguous pattern avoidance in binary trees
Michael Dairyko
;
Lara Pudwell
;
Samantha Tyner
;
Casey Wynn
Graph cospectrality using neighborhood matrices
Aline Duarte Bessa
;
Ivan Carmo Rocha-Neto
;
Suani Tavares Rubim de Pinho
;
Roberto Fernandes Silva Andrade
;
Thierry Correa Petit Lobao
Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
Michael Z. Spivey
Two permutation classes related to the bubble sort operator
Marilena Barnabei
;
Flavio Bonetti
;
Matteo Silimbani
Baxter permutations, maj-balances, and positive braids
Sen-Peng Eu
;
Tung-Shan Fu
;
Yeh-Jong Pan
;
Chien-Tai Ting
Partition of graphs and hypergraphs into monochromatic connected parts
Shinya Fujita
;
Michitaka Furuya
;
András Gyárfás
;
Ágnes Tóth
Some constructions of general covering designs
Federico Montecalvo
Biembeddings of metacyclic groups and triangulations of orientable surfaces by complete graphs
Michael John Grannell
;
Martin Knor
The rotor-router group of directed covers of graphs
Wilfried Huss
;
Ecaterina Sava
On short zero-sum subsequences of zero-sum sequences
Yushuang Fan
;
Weidong Gao
;
Guoqing Wang
;
Qinghai Zhong
;
Jujuan Zhuang
Triangle-free triangulations, hyperplane arrangements and shifted tableaux
Ron Adin
;
Yuval Roichman
Polynomials with real zeros and compatible sequences
Li Liu
Generalized Galois numbers, inversions, lattice paths, ferrers diagrams and limit theorems
Svante Janson
Existence of 2-\((v,k,1)\) designs admitting a block-transitive group of affine type
Ding Shifeng
;
Liu Weijun
On a matrix representation for polynomially recursive sequences
Christophe Reutenauer
Independent sets in graphs with given minimum degree
James Alexander
;
Jonathan Cutler
;
Tim Mink
Dissimilarity maps on trees and the representation theory of \(\mathrm{GL}_n(\mathbb{C})\)
Christopher Manon
Shi threshold arrangement
Seunghyun Seo
Turán \(H\)-densities for 3-graphs
Victor Falgas-Ravry
;
Emil R. Vaughan
Euler's partition theorem with upper bounds on multiplicities
William Y.C. Chen
;
Ae Ja Yee
;
Albert J. W. Zhu
Enumeration of Golomb rulers and acyclic orientations of mixed graphs
Matthias Beck
;
Tristram Bogart
;
Tu Pham
Expected patterns in permutation classes
Cheyne Homberger
Parity index of binary words and powers of prime words
Aleksandar Ilić
;
Sandi Klavžar
;
Yoomi Rho
Directed animals, quadratic systems and rewriting systems
Jean-François Marckert
The vertical profile of embedded trees
Mireille Bousquet-Mélou
;
Guillaume Chapuy
Recurrence relations and splitting formulas for the domination polynomial
Tomer Kotek
;
James Preen
;
Frank Simon
;
Peter Tittmann
;
Martin Trinks