Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 23 (2016)
no. 4
Précédent
Suivant
Tome 23 (2016) no. 4
Sommaire
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