Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 23 (2016)
no. 2
Précédent
Suivant
Tome 23 (2016) no. 2
Sommaire
Decompositions of complete graphs into bipartite 2-regular subgraphs
Darryn Bryant
;
Andrea Burgess
;
Peter Danziger
Enumeration of hybrid domino-lozenge tilings. II: Quasi-octagonal regions
Tri Lai
On mixed almost Moore graphs of diameter two
Nacho López
;
Josep M. Miret
Cyclic sieving and rational Catalan theory
Michelle Bodnar
;
Brendon Rhoades
Blocking and double blocking sets in finite planes
Jan De Beule
;
Tamás Héger
;
Tamás Szőnyi
;
Geertrui Van de Voorde
On snarks that are far from being 3-edge colorable
Jonas Hägglund
Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
Samuel Clearman
;
Matthew Hyatt
;
Brittany Shelton
;
Mark Skandera
Pairs of quadratic forms over finite fields
Alexander Pott
;
Kai-Uwe Schmidt
;
Yue Zhou
Nice reflection arrangements.
Torsten Hoge
;
Gerhard Röhrle
Locally convex words and permutations
Christopher Coscia
;
Jonathan DeWitt
An improved bound on the sizes of matchings guaranteeing a rainbow matching
Dennis Clemens
;
Julia Ehrenmüller
Weakly distance-regular digraphs of valency three. I
Yuefeng Yang
;
Benjian Lv
;
Kaishun Wang
The bondage number of random graphs
Dieter Mitsche
;
Xavier Pérez-Giménez
;
Paweł Prałat
The peak statistics on simsun permutations
Shi-Mei Ma
;
Yeong-Nan Yeh
Increasing paths in edge-ordered graphs: the hypercube and random graph
Jessica De Silva
;
Theodore Molla
;
Florian Pfender
;
Troy Retter
;
Michael Tait
Graphs with no \(\bar{P}_7\)-minor
Guoli Ding
;
Chanun Lewchalermvongs
;
John Maharry
On the staircases of Gyárfás
János Csányi
;
Peter Hajnal
;
Gábor V. Nagy
Locally 3-arc-transitive regular covers of complete bipartite graphs
Eric Swartz
Abelian Cayley digraphs with asymptotically large order for any given degree
Francesc Aguiló
;
Miquel Àngel Fiol
;
Sonia Pérez
Inverse expander mixing for hypergraphs
Emma Cohen
;
Dhruv Mubayi
;
Peter Ralli
;
Prasad Tetali
Multi-Eulerian tours of directed graphs
Matthew Farrell
;
Lionel Levine
On isomorphisms of vertex-transitive graphs
Jing Chen
;
Binzhou Xia
Completing partial Latin squares with one nonempty row, column, and symbol
Jaromy Kuhl
;
Michael W. Schroeder
Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
David E Speyer
Brick manifolds and toric varieties of brick polytopes
Laura Escobar
Neighborhood complexes of some exponential graphs
Nandini Nilakantan
;
Samir Shukla
A family of symmetric graphs with complete quotients
Teng Fang
;
Xin Gui Fang
;
Binzhou Xia
;
Sanming Zhou
Combinatorics meets potential theory
Philippe D'Arco
;
Valentina Lacivita
;
Sami Mustapha
Extremal graph for intersecting odd cycles
Xinmin Hou
;
Yu Qiu
;
Boyuan Liu
Turán numbers for 3-uniform linear paths of length 3
Eliza Jackowska
;
Joanna Polcyn
;
Andrzej Ruciński
On decomposing graphs of large minimum degree into locally irregular subgraphs
Jakub Przybyło
On ultralimits of sparse graph classes
Michał Pilipczuk
;
Szymon Toruńczyk
A simple existence criterion for normal spanning trees
Reinhard Diestel
Chung-Feller property of Schröder objects
Youngja Park
;
Sangwook Kim
A new near octagon and the Suzuki tower
Anurag Bishnoi
;
Bart De Bruyn
Some probabilistic trees with algebraic roots
Olivier Bernardi
;
Alejandro H. Morales
0-sum and 1-sum flows in regular graphs
S. Akbari
;
M. Kano
;
S. Zare
A combinatorial approach to the \(q,t\)-symmetry relation in Macdonald polynomials
Maria Monks Gillespie
On well-covered, vertex decomposable and Cohen-Macaulay graphs
Iván D. Castrillón
;
Roberto Cruz
;
Enrique Reyes
Unimodality via alternating gamma vectors
Charles Brittenham
;
Andrew T. Carroll
;
T. Kyle Petersen
;
Connor Thomas
A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
James Currie
Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
Amin Bahmanian
;
Mike Newman
On some conjectures concerning critical independent sets of a graph
Taylor Short
Solutions to the T-systems with principal coefficients
Panupong Vichitkunakorn
Lower bounds for cover-free families
Ali Z. Abdi
;
Nader H. Bshouty
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
Patrick Bennett
;
Andrzej Dudek
;
Alan Frieze
;
Laars Helenius
The existence of a maximal Green sequence is not invariant under quiver mutation
Greg Muller
Threshold and hitting time for high-order connectedness in random hypergraphs
Oliver Cooley
;
Mihyun Kang
;
Christoph Koch
Unsplittable classes of separable permutations
Michael Albert
;
Vít Jelínek
Painting squares in \(\Delta^2-1\) shades
Daniel W. Cranston
;
Landon Rabern
2-walk-regular dihedrants from group-divisible designs
Zhi Qiao
;
Shao Fei Du
;
Jack H Koolen
Modeling limits in hereditary classes: reduction and application to trees
Jaroslav Nešetřil
;
Patrice Ossona de Mendez
Decompositions of the Boolean lattice into rank-symmetric chains.
István Tomon
Distant set distinguishing total colourings of graphs
Jakub Przybyło
The total acquisition number of random graphs
Deepak Bal
;
Patrick Bennett
;
Andrzej Dudek
;
Paweł Prałat