Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 23 (2016)
no. 3
Précédent
Suivant
Tome 23 (2016) no. 3
Sommaire
4-factor-criticality of vertex-transitive graphs
Wuyang Sun
;
Heping Zhang
Ramsey numbers of trees versus odd cycles
Matthew Brennan
Chip games and paintability
Lech Duraj
;
Grzegorz Gutowski
;
Jakub Kozik
A generalized Alon-Boppana bound and weak Ramanujan graphs
Fan Chung
Generalizing the divisibility property of rectangle domino tilings
Forest Tong
Orphans in forests of linear fractional transformations
Sandie Han
;
Ariane M. Masuda
;
Satyanand Singh
;
Johann Thiel
An \(n\)-in-a-row type game
Joshua Erde
;
Mark Walters
The topology of the external activity complex of a matroid
Federico Ardila
;
Federico Castillo
;
José Alejandro Samper
Locating-total dominating sets in twin-free graphs: a conjecture
Florent Foucaud
;
Michael A. Henning
Which Haar graphs are Cayley graphs?
István Estélyi
;
Tomaž Pisanski
Szemerédi's regularity lemma via martingales
Pandelis Dodos
;
Vassilis Kanellopoulos
;
Thodoris Karageorgos
The Černý conjecture and 1-contracting automata
Henk Don
Higher Bruhat orders in type B
Seth Shelley-Abrahamson
;
Suhas Vijaykumar
Refined dual stable Grothendieck polynomials and generalized Bender-Knuth involutions
Pavel Galashin
;
Darij Grinberg
;
Gaku Liu
Proof of Gessel's \(\gamma\)-positivity conjecture
Zhicong Lin
Even more infinite ball packings from Lorentzian root systems
Hao Chen
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
Vladimir Blinovsky
;
Catherine Greenhill
Cliques in graphs excluding a complete graph minor
David R. Wood
Mixed volumes of hypersimplices
Gaku Liu
On the Cohen-Macaulay property for quadratic tangent cones
Dumitru I. Stamate
Face-degree bounds for planar critical graphs
Ligang Jin
;
Yingli Kang
;
Eckhard Steffen
Face rings of cycles, associahedra, and standard Young tableaux
Anton Dochtermann
New conjectures for union-closed families
Jonad Pulaj
;
Annie Raymond
;
Dirk Theis
A generalization of Sperner's theorem on compressed ideals
Lili Mu
;
Yi Wang
On symmetries in phylogenetic trees
Éric Fusy
Fast Möbius inversion in semimodular lattices and ER-labelable posets
Petteri Kaski
;
Jukka Kohonen
;
Thomas Westerbäck
Guaranteed scoring games
Urban Larsson
;
Richard J. Nowakowski
;
João P. Neto
;
Carlos P. Santos
A new construction of non-extendable intersecting families of sets
Kaushik Majumder
All Ramsey numbers for brooms in graphs
Pei Yu
;
Yusheng Li
Characteristic flows on signed graphs and short circuit covers
Edita Máčajová
;
Martin Škoviera
Generating functions of bipartite maps on orientable surfaces
Guillaume Chapuy
;
Wenjie Fang
A decomposition of parking functions by undesired spaces
Melody Bruce
;
Michael Dougherty
;
Max Hlavacek
;
Ryo Kudo
;
Ian Nicolas
On the additive bases problem in finite fields
Victoria de Quehen
;
Hamed Hatami
Cubic non-Cayley vertex-transitive bi-Cayley graphs over a regular \(p\)-group
Jin-Xin Zhou
;
Yan-Quan Feng
The number of prefixes of minimal factorisations of a cycle
Thierry Lévy
On generalizations of separating and splitting families
Daniel Condon
;
Samuel Coskey
;
Luke Serafin
;
Cody Stockdale
A better lower bound on average degree of 4-list-critical graphs
Landon Rabern
Infinite orders and non-\(D\)-finite property of 3-dimensional lattice walks
Daniel K. Du
;
Qing-Hu Hou
;
Rong-Hua Wang
Counting trees in graphs
Jacques Verstraete
;
Dhruv Mubayi
Red-blue clique partitions and \((1-1)\)-transversals
Alfréd Gyárfás
;
Jeno Lehel
Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups
Nichole L. Schimanski
;
John S. Caughman IV
Representations of bicircular lift matroids
Rong Chen
;
Zifei Gao
Random subcube intersection graphs. I: Cliques and covering
Victor Falgas-Ravry
;
Klas Markström
Recurrence relations for the linear transformation preserving the strong \(q\)-log-convexity
Lily Li Liu
;
Ya-Nan Li
Planar graphs have independence ratio at least 3/13
Daniel W. Cranston
;
Landon Rabern
An improved bound on \((A+A)/(A+A)\)
Ben Lund
Extremal permutations in routing cycles
Jinhua He
;
Louis A. Valentin
;
Xiaoyan Yin
;
Gexin Yu
Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
O.V. Borodin
;
A.O. Ivanova
Dimensions of the irreducible representations of the symmetric and alternating group
Korneel Debaene
Transversals in 4-uniform hypergraphs
Michael A. Henning
;
Anders Yeo
Chordality properties and hyperbolicity on graphs
Álvaro Martínez-Pérez
Noncrossing partitions, toggles, and homomesies
David Einstein
;
Miriam Farber
;
Emily Gunawan
;
Michael Joseph
;
Matthew Macauley
;
James Propp
;
Simon Rubinstein-Salzedo
On the multi-colored Ramsey numbers of paths and even cycles
Gábor N. Sárközy
Treelike snarks
Marién Abreu
;
Tomáš Kaiser
;
Domenico Labbate
;
Giuseppe Mazzuoccolo
Improved lower bounds for the orders of even girth cages
Tatiana Baginová Jajcayová
;
Slobodan Filipovski
;
Robert Jajcay
Cycles in the graph of overlapping permutations avoiding barred patterns
Guizhi Qin
;
Sherry H.F. Yan