Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 23 (2016)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Bi-Cohen-Macaulay graphs
Jürgen Herzog
;
Ahad Rahimi
On periodicity of generalized pseudostandard words
Josef Florian
;
L'ubomíra Dvořáková
Posets of finite functions
Konrad Pióro
Simultaneous core partitions: parameterizations and sums
Victor Y. Wang
An extension of MacMahon's equidistribution theorem to ordered multiset partitions
Andrew Timothy Wilson
Low degree Nullstellensatz certificates for 3-colorability
Bo Li
;
Benjamin Lowenstein
;
Mohamed Omar
Expansions of a chord diagram and alternating permutations
Tomoki Nakamigawa
Combinatorial proofs of addition formulas
Xiang-Ke Chang
;
Xing-Biao Hu
;
Hongchuan Lei
;
Yeong-Nan Yeh
Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
Lon Mitchell
;
Lynne Yengulalp
Finite edge-transitive oriented graphs of valency four: a global approach
Jehan A. Al-bar
;
Ahmad N. Al-kenani
;
Najat M. Muthana
;
Cheryl E. Praeger
;
Pablo Spiga
A quantitative study of pure parallel processes
O. Bodini
;
A. Genitrini
;
F. Peschanski
The phase transition in site percolation on pseudo-random graphs
Michael Krivelevich
A combinatorial proof of a relationship between maximal \((2k-1,2k+1)\)-cores and \((2k-1,2k,2k+1)\)-cores
Rishi Nath
;
James A. Sellers
The chromatic number of a signed graph
Edita Máčajová
;
André Raspaud
;
Martin Škoviera
Chromatic bases for symmetric functions
Soojin Cho
;
Stephanie van Willigenburg
A note on perfect matchings in uniform hypergraphs
Andrew Treglown
;
Yi Zhao
A note on maxima in random walks
Joseph Helfer
;
Daniel T. Wise
Avoiding letter patterns in ternary square-free words
Elena A. Petrova
Doubled patterns are 3-avoidable
Pascal Ochem
A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial
Rafael S. González D'León
Another proof of the Harer-Zagier formula
Boris Pittel
A new lower bound for the Towers of Hanoi problem
Codruƫ Grosu
An orthogonal basis for functions over a slice of the Boolean hypercube
Yuval Filmus
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
Joe Sawada
;
Aaron Williams
;
Dennis Wong
Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
Luke Schaeffer
;
Jeffrey Shallit
Determining a binary matroid from its small circuits
James Oxley
;
Charles Semple
;
Geoff Whittle
A curved Brunn-Minkowski inequality for the symmetric group
Weerachai Neeranartvong
;
Jonathan Novak
;
Nat Sothanaphan
The peeling process of infinite Boltzmann planar maps
Timothy Budd
On cylindrical graph construction and its applications
Amir Daneshgar
;
Mohsen Hejrati
;
Meysam Madani
Restricted frame graphs and a conjecture of Scott
Jérémie Chalopin
;
Louis Esperet
;
Zhentao Li
;
Patrice Ossona de Mendez
On computation of Baker and Norine's rank on complete graphs
Robert Cori
;
Yvan Le Borgne
The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
Supalak Sumalroj
;
Chalermpong Worawannotai
Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
Darij Grinberg
;
Tom Roby
Generalised polygons admitting a point-primitive almost simple group of Suzuki or Ree type
Luke Morgan
;
Tomasz Popiel
Two descent statistics over \(321\)-avoiding centrosymmetric involutions
Marilena Barnabei
;
Flavio Bonetti
;
Sergi Elizalde
;
Matteo Silimbani
Avoidability index for binary patterns with reversal
James Currie
;
Philip Lafrance
Subspaces intersecting each element of a regulus in one point, André-Bruck-Bose representation and clubs
Michel Lavrauw
;
Corrado Zanella
New Eulerian numbers of type \(D\)
Anna Borowiec
;
Wojciech Młotkowski
Cayley graphs with an infinite Heesch number
Azer Akhmedov
\(K\)-Knuth equivalence for increasing tableaux
Christian Gaetz
;
Michelle Mastrianni
;
Rebecca Patrias
;
Hailee Peck
;
Colleen Robichaux
;
David Schwein
;
Ka Yu Tam
On the resistance matrix of a graph
Jiang Zhou
;
Zhongyu Wang
;
Changjiang Bu
Average degree conditions forcing a minor
Daniel J. Harvey
;
David R. Wood
Inversions of semistandard Young tableaux
Paul Drube
Enumeration of parallelograms in permutation matrices for improved bounds on the density of Costas arrays
Christopher N. Swanson
;
Bill Correll, Jr.
;
Randy W. Ho
Web matrices: structural properties and generating combinatorial identities
Mark Dukes
;
Chris D White
Spectrally extremal vertices, strong cospectrality, and state transfer
Gabriel Coutinho
Polynomials defined by tableaux and linear recurrences
Per Alexandersson
Guessing games on triangle-free graphs
Peter J. Cameron
;
Anh N. Dang
;
Søren Riis
Extending cycles locally to Hamilton cycles
Matthias Hamann
;
Florian Lehner
;
Julian Pott
Correlation among runners and some results on the lonely runner conjecture
Guillem Perarnau
;
Oriol Serra
Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
Thomas A. McCourt
On Erdős-Sós conjecture for trees of large size
Agnieszka Goerlich
;
Andrzej Żak
On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions
Andrei L. Kanunnikov
;
Ekaterina A. Vassilieva
Graphs with induced-saturation number zero
Sarah Behrens
;
Catherine Erbes
;
Michael Santana
;
Derrek Yager
;
Elyse Yeager
Flag statistics from the Ehrhart \(h^\ast\)-polynomial of multi-hypersimplices
Guo-Niu Han
;
Matthieu Josuat-Vergès
A class of infinite convex geometries
Kira Adaricheva
;
J. B. Nation
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
Kévin Perrot
;
Trung Van Pham
Local probabilities for random permutations without long cycles
Eugenijus Manstavičius
;
Robertas Petuchovas
New duality operator for complex circulant matrices and a conjecture of Ryser
Luis H. Gallardo
The degree/diameter problem in maximal planar bipartite graphs
Cristina Dalfó
;
Clemens Huemer
;
Julián Salas
Sommaire du
Fascicule no. 2
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
Sommaire du
Fascicule no. 3
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
Sommaire du
Fascicule no. 4
Isotropic matroids. I: Multimatroids and neighborhoods
Robert Brijder
;
Lorenzo Traldi
Isotropic matroids. II: Circle graphs
Robert Brijder
;
Lorenzo Traldi
On the Potts antiferromagnet on random graphs
Amin Coja-Oghlan
;
Nor Jaafari
Coloring non-crossing strings
Louis Esperet
;
Daniel Gonçalves
;
Arnaud Labourel
Packing polynomials on multidimensional integer sectors
Luis B. Morales
On matchings in stochastic Kronecker graphs
Justyna Banaszak
On almost-regular edge colourings of hypergraphs
Darryn Bryant
Upper bounds for Stern's diatomic sequence and related sequences
Colin Defant
The Smith and critical groups of the square rook's graph and its complement
Joshua E. Ducey
;
Jonathan Gerhard
;
Noah Watson
All or nothing at all
Paolo D'Arco
;
Navid Nasr Esfahani
;
Douglas R. Stinson
A short conceptual proof of Narayana's path-counting formula
Mihai Ciucu
Upper bounds on the minimum size of Hamilton saturated hypergraphs
Andrzej Ruciński
;
Andrzej Żak
Intersections of the Hermitian surface with irreducible quadrics in even characteristic
Angela Aguglia
;
Luca Giuzzi
Triangular fully packed loop configurations of excess 2
Sabine Beil
geometry
Jamshid Moori
;
B. D. Rodrigues
Incidences with curves in \(\mathbb{R}^d\)
Micha Sharir
;
Adam Sheffer
;
Noam Solomon
Grasshopper avoidance of patterns
Michał Dębski
;
Urszula Pastwa
;
Krzysztof Węsek
Modification of Griffiths' result for even integers
Eshita Mazumdar
;
Sneh Bala Sinha
Every graph \(G\) is Hall \(\Delta(G)\)-extendible
Sarah Holliday
;
Jennifer Vandenbussche
;
Erik E. Westlund
The cycle descent statistic on permutations
Jun Ma
;
Shi-Mei Ma
;
Yeong-Nan Yeh
;
Xu Zhu
Hadwiger's conjecture for 3-arc graphs
David R Wood
;
Guangjun Xu
;
Sanming Zhou
Preserving the number of cycles of length \(k\) in a growing uniform permutation
Philippe Duchon
;
Romaric Duvignau
Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
Derek Kitson
;
Bernd Schulze
Resolvable group divisible designs with large groups
Peter J. Dukes
;
Esther R. Lamken
;
Alan C.H. Ling
Invariant tensors and the cyclic sieving phenomenon
Bruce W. Westbury
Corners in tree-like tableaux
Paweł Hitczenko
;
Amanda Lohss
A note on \({\mathtt V}\)-free 2-matchings
Kristóf Bérczi
;
Attila Bernáth
;
Máté Vizer
On universal hypergraphs
Samuel Hetterich
;
Olaf Parczyk
;
Yury Person
Inclusion matrices and the MDS conjecture
Ameera Chowdhury
Antipode formulas for some combinatorial Hopf algebras
Rebecca Patrias
Equitable orientations of sparse uniform hypergraphs
Nathann Cohen
;
William Lochet
\((s,t)\)-cores: a weighted version of Armstrong's conjecture
Matthew Fayers
On total positivity of Catalan-Stieltjes matrices
Qiongqiong Pan
;
Jiang Zeng
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar
;
Csilla Bujtás
;
Tanja Gologranc
;
Sandi Klavžar
;
Gašper Košmrlj
;
Balázs Patkós
;
Zsolt Tuza
;
Máté Vizer
Directed rooted forests in higher dimension
Olivier Bernardi
;
Caroline J. Klivans
Large deviations for permutations avoiding monotone patterns
Neal Madras
;
Lerna Pehlivan
The CI problem for infinite groups
Joy Morris
Client-waiter games on complete and random graphs
Oren Dean
;
Michael Krivelevich
On the number of similar instances of a pattern in a finite set
Bernardo M. Ábrego
;
Silvia Fernández-Merchant
;
Daniel J. Katz
;
Levon Kolesnikov
Pathwidth and nonrepetitive list coloring
Adam Gągol
;
Gwenaël Joret
;
Jakub Kozik
;
Piotr Micek
Cluster automorphisms and the marked exchange graphs of skew-symmetrizable cluster algebras
John W Lawson
Exponential domination in subcubic graphs
Stéphane Bessy
;
Pascal Ochem
;
Dieter Rautenbach
Pieri rules for classical groups and equinumeration between generalized oscillating tableaux and semistandard tableaux
Soichi Okada
The lattice of definable equivalence relations in homogeneous \(n\)-dimensional permutation structures
Samuel Braunfeld
A sharp bound for the product of weights of cross-intersecting families
Peter Borg
Induced colorful trees and paths in large chromatic graphs
Andras Gyarfas
;
Gabor Sarkozy