Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 22 (2015)
no. 1
Précédent
Suivant
Tome 22 (2015) no. 1
Sommaire
Periodic rigidity on a variable torus using inductive constructions
Anthony Nixon
;
Elissa Ross
Evaluating the numbers of some skew standard Young tableaux of truncated shapes
Ping Sun
Some enumerations on non-decreasing Dyck paths
Éva Czabarka
;
Rigoberto Flórez
;
Leandro Junes
Group homomorphisms as error correcting codes
Alan Guo
Vertically symmetric alternating sign matrices and a multivariate Laurent polynomial identity
Ilse Fischer
;
Lukas Riegler
On-line choice number of complete multipartite graphs: an algorithmic approach
Fei-Huang Chang
;
Hong-Bin Chen
;
Jun-Yi Guo
;
Yu-Pei Huang
On computing the degree of convexity of polyominoes
Stefano Brocchi
;
Giuseppa Castiglione
;
Paolo Massazza
The concavity and convexity of the Boros-Moll sequences
Ernest X.W. Xia
Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients
Quan-Hui Yang
Discrete Dirac operators, critical embeddings and Ihara-Selberg functions
Martin Loebl
;
Petr Somberg
Maximum 4-degenerate subgraph of a planar graph
Robert Lukot'ka
;
Ján Mazák
;
Xuding Zhu
Characterizations of regularity for certain \(Q\)-polynomial association schemes
Sho Suda
Spanning \(k\)-trees of bipartite graphs
Mikio Kano
;
Kenta Ozeki
;
Kazuhiro Suzuki
;
Masao Tsugaki
;
Tomoki Yamashita
Crossings and nestings for arc-coloured permutations and automation
Lily Yen
On-line Ramsey numbers of paths and cycles
Joanna Cyman
;
Tomasz Dzido
;
John Lapinskas
;
Allan Lo
On Keller's conjecture in dimension seven
Andrzej P. Kisielewicz
;
Magdalena Łysakowska
Brown's theorem and its application for enumeration of dissections and planar trees
Evgeniy Krasko
;
Alexander Omelchenko
Multiple coverings with closed polygons
István Kovács
;
Géza Tóth
On the codes related to the Higman-Sims graph
Wolfgang Knapp
;
Hans-Jörg Schaeffer
On a refinement of Wilf-equivalence for permutations
Sherry H.F. Yan
;
Huiyun Ge
;
Yaqiu Zhang
On commuting graphs for elements of order 3 in symmetric groups
Athirah Nawawi
;
Peter Rowley
A characterization of the Hermitian variety in finite 3-dimensional projective spaces
Vito Napolitano
Faster rumor spreading with multiple calls
Konstantinos Panagiotou
;
Ali Pourmiri
;
Thomas Sauerwald
Polygons as sections of higher-dimensional polytopes
Arnau Padrol
;
Julian Pfeifle
On a certain vector crank modulo 7
Michael D. Hirschhorn
;
Pee Choon Toh
Wieland drift for triangular fully packed loop configurations
Sabine Beil
;
Ilse Fischer
;
Philippe Nadeau
A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
Aline Parreau
;
Michel Rigo
;
Eric Rowland
;
Élise Vandomme
Density of Gallai multigraphs
Colton Magnant
Power of \(k\) choices and rainbow spanning trees in random graphs
Deepak Bal
;
Patrick Bennett
;
Alan Frieze
;
Paweł Prałat
Induced and non-induced forbidden subposet problems
Balázs Patkós
Maximal clades in random binary search trees
Svante Janson
An improved lower bound related to the Furstenberg-Sárközy theorem
Mark Lewko
Exchangeable pairs, switchings, and random regular graphs
Tobias Johnson
Between 2- and 3-colorability
Alan Frieze
;
Wesley Pegden
On limits of dense packing of equal spheres in a cube
Milos Tatarevic
Conditions for the parameters of the block graph of quasi-symmetric designs
Rajendra M. Pawale
;
Mohan S. Shrikhande
;
Shubhada M. Nyayate
Modular statistics for subgraph counts in sparse random graphs
Bobby DeMarco
;
Jeff Kahn
;
Amanda Redlich
A generalization of the \(k\)-bonacci sequence from Riordan arrays
José L. Ramírez
;
Víctor F. Sirvent
Leapfrog constructions: from continuant polynomials to permanents of matrices
Alberto Facchini
;
André Leroy
A note on Goldbach partitions of large even integers
Ljuben Mutafchiev
The maximum difference between the number of atoms and number of coatoms of a Bruhat interval of the symmetric group.
Emmanuel Tsukerman
Backward jeu de taquin slides for composition tableaux and a noncommutative Pieri rule
Vasu Tewari
Forcing finite minors in sparse infinite graphs by large-degree assumptions
Reinhard Diestel
On graph parameters guaranteeing fast sandpile diffusion
Ayush Choure
;
Sundar Vishwanathan
Some results on the structure of multipoles in the study of snarks
M. A. Fiol
;
J. Vilaltella
Bipartite graphs whose squares are not chromatic-choosable
Seog-Jin Kim
;
Boram Park
On Maltsev digraphs
Catarina Carvalho
;
Laszlo Egri
;
Marcel Jackson
;
Todd Niven
On the longest \(k\)-alternating subsequence
Igor Pak
;
Robin Pemantle
Characterisations of elementary pseudo-caps and good eggs
Sara Rottey
;
Geertrui Van de Voorde
Decomposing dense bipartite graphs into 4-cycles
Nicholas Cavenagh
Small snarks with large oddness
Robert Lukoťka
;
Edita Máčajová
;
Ján Mazák
;
Martin Škoviera
Asymptotic expansion of the multi-orientable random tensor model
Eric Fusy
;
Adrian Tanasa
Infinite gammoids
Seyed Hadi Afzali Borujeni
;
Hiu-Fai Law
;
Malte Müller
Gammoids, pseudomodularity and flatness degree
Jorge Alberto Olarte
On shuffling of infinite square-free words
Mike Müller
;
Svetlana Puzynina
;
Michaël Rao
Distributions defined by \(q\)-supernomials, fusion products, and Demazure modules
Stavros Kousidis
;
Ernst Schulte-Geers
Near-colorings: non-colorable graphs and NP-completeness
M. Montassier
;
P. Ochem
Ascent sequences avoiding pairs of patterns
Andrew M. Baxter
;
Lara K. Pudwell
Summation of rational series twisted by strongly \(B\)-multiplicative coefficients
Jean-Paul Allouche
;
Jonathan Sondow
Keeping avoider's graph almost acyclic
Dennis Clemens
;
Julia Ehrenmüller
;
Yury Person
;
Tuan Tran
Closing gaps in problems related to Hamilton cycles in random graphs and hypergraphs
Asaf Ferber
Lai's conditions for spanning and dominating closed trails
Wei-Guo Chen
;
Zhi-Hong Chen
;
Mei Lu
A criterion for a monomial ideal to have a linear resolution in characteristic 2
E. Connon
;
Sara Faridi
On the number of walks in a triangular domain
Paul R.G. Mortimer
;
Thomas Prellberg
Disjoint compatibility graph of non-crossing matchings of points in convex position
Oswin Aichholzer
;
Andrei Asinowski
;
Tillmann Miltzow
Sandpiles and dominos
Laura Florescu
;
Daniela Morar
;
David Perkinson
;
Nicholas Salter
;
Tianyuan Xu
Faces of Birkhoff polytopes
Andreas Paffenholz
A bijective proof of the Alladi-Andrews-Gordon partition theorem
James J.Y. Zhao
On the strength of connectedness of a random hypergraph
Daniel Poole
A de Bruijn-Erdős theorem for chordal graphs
Laurent Beaudou
;
Adrian Bondy
;
Xiaomin Chen
;
Ehsan Chiniforooshan
;
Maria Chudnovsky
;
Vašek Chvátal
;
Nicolas Fraiman
;
Yori Zwols
Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
Xiaolin Chen
;
Xueliang Li
;
Huishu Lian
A quantitative approach to perfect one-factorizations of complete bipartite graphs
Natacha Astromujoff
;
Martin Matamala
Crystal structure on rigged configurations and the filling map
Anne Schilling
;
Travis Scrimshaw
Heffter arrays and biembedding graphs on surfaces
Dan Archdeacon
Simplicial complexes of Whisker type
Mina Bigdeli
;
Jürgen Herzog
;
Takayuki Hibi
;
Antonio Macchia
Vertex-transitive digraphs of order \(p^5\) are Hamiltonian
Jun-Yang Zhang
Generalized cages
Marko Boben
;
Robert Jajcay
;
Tomaz Pisanski
The distinguishing index of infinite graphs
Izak Broere
;
Monika Pilśniak
Linear relations for a generalized Tutte polynomial
Gary Gordon
Most probably intersecting hypergraphs
Shagnik Das
;
Benny Sudakov
Maximal partial Latin cubes
Thomas Britz
;
Nicholas J. Cavenagh
;
Henrik Kragh Sørensen
On graphs having no flow roots in the interval \((1,2)\)
F.M. Dong
On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
Zoltán Lóránt Nagy
;
Balázs Patkós
A Deza-Frankl type theorem for set partitions
Cheng Yeaw Ku
;
Kok Bin Wong