Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 25 (2018)
no. 3
Précédent
Suivant
Tome 25 (2018) no. 3
Sommaire
Extension from precoloured sets of edges
Katherine Edwards
;
António Girão
;
Jan van den Heuvel
;
Ross J. Kang
;
Gregory J. Puleo
;
Jean-Sébastien Sereni
Defining the \(q\)-analogue of a matroid
Relinde Jurrius
;
Ruud Pellikaan
Hamilton cycles in infinite cubic graphs
Max F. Pitz
Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
Thomas F. Bloom
;
Anita Liebenau
Proper distinguishing colorings with few colors for graphs with girth at least 5
Daniel W. Cranston
Parallel enumeration of triangulations
Charles Jordan
;
Michael Joswig
;
Lars Kastner
Crystals and Schur \(P\)-positive expansions
Seung-Il Choi
;
Jae-Hoon Kwon
Primary decomposition of ideals of lattice homomorphisms
Leila Sharifan
;
Ali Akbar Estaji
;
Ghazaleh Malekbala
On arc-transitive metacyclic covers of graphs with order twice a prime
Zhaohong Huang
;
Jiangmin Pan
Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
Ivailo Hartarsky
Random enriched trees with applications to random graphs
Benedikt Stufler
Countable Menger's theorem with finitary matroid constraints on the ingoing edges
Attila Joó
Hamiltonicity in locally finite graphs: two extensions and a counterexample
Karl Heuer
EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
Thomas Selig
;
Jason P. Smith
;
Einar Steingrímsson
A note on intervals in the Hales-Jewett theorem
Imre Leader
;
Eero Räty
On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
Megumi Asada
;
Ryan Chen
;
Florian Frick
;
Frederick Huang
;
Maxwell Polevy
;
David Stoner
;
Ling Hei Tsang
;
Zoe Wellner
On different ``middle parts'' of a tree
Heather Smith
;
László Székely
;
Hua Wang
;
Shuai Yuan
On the strong chromatic index of sparse graphs
Philip DeOrsey
;
Michael Ferrara
;
Nathan Graber
;
Stephen G. Hartke
;
Luke L. Nelsen
;
Eric Sullivan
;
Sogol Jahanbekam
;
Bernard Lidický
;
Derrick Stolee
;
Jennifer White
Full Text
Sets with few differences in abelian groups
Mitchell Lee
The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
Andrew Elvey Price
;
Muhammad Adib Surani
;
Sanming Zhou
Quasiregular matroids
S. R. Kingan
Hypertopes with tetrahedral diagram
Domenico Catalano
;
M. Elisa Fernandes
;
Isabel Hubard
;
Dimitri Leemans
Universal layered permutations
Michael Albert
;
Michael Engen
;
Jay Pantone
;
Vincent Vatter
Reconfiguration on nowhere dense graph classes
Sebastian Siebertz
Monops, monoids and operads: the combinatorics of Sheffer polynomials
Miguel A. Méndez
;
Rafael Sánchez Lamoneda
On graphs whose flow polynomials have real roots only
Fengming Dong
Excluding hooks and their complements
Krzysztof Choromanski
;
Dvir Falik
;
Anita Liebenau
;
Viresh Patel
;
Marcin Pilipczuk
Cubic edge-transitive bi-\(p\)-metacirculants
Yan-Li Qin
;
Jin-Xin Zhou
Linear bound for majority colourings of digraphs
Fiachra Knox
;
Robert Šámal
Identities in plactic, hypoplactic, sylvester, Baxter, and related monoids
Alan J. Cain
;
António Malheiro
Strong chromatic index of graphs with maximum degree four
Mingfang Huang
;
Michael Santana
;
Gexin Yu
Domination and fractional domination in digraphs
Ararat Harutyunyan
;
Tien-Nam Le
;
Alantha Newman
;
Stéphan Thomasse
Vertex covering with monochromatic pieces of few colours
Marlo Eugster
;
Frank Mousset
Quasirandomness in hypergraphs
Elad Aigner-Horev
;
David Conlon
;
Hiệp Hàn
;
Yury Person
;
Mathias Schacht
Note on the multicolour size-Ramsey number for paths
Andrzej Dudek
;
Paweł Prałat
Increasing the minimum distance of codes by twisting
Marzieh Akbari
;
Neil I. Gillespie
;
Cheryl E. Praeger
An orthosymplectic Pieri rule
Anna Stokke
Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
Johannes Carmesin
Pentagon contact representations
Stefan Felsner
;
Hendrik Schrezenmaier
;
Raphael Steiner
Non-fringe subtrees in conditioned Galton-Watson trees
Xing Shi Cai
;
Svante Janson
A notion of inversion number associated to certain quiver flag varieties
Lucas Fresse
Powerful sets: a generalisation of binary matroids
Graham E. Farr
;
Andrew Y.Z. Wang
The Turán polytope
Annie Raymond
Hamilton cycles in sparse robustly expanding digraphs
Allan Lo
;
Viresh Patel
Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Yi Zhang
;
Yi Zhao
;
Mei Lu
Diagrams and essential sets for signed permutations
David Anderson
Lattice points and simultaneous core partitions
Paul Johnson
On the rank and periodic rank of finite dynamical systems
Maximilien Gadouleau
Forbidden subposet problems for traces of set families
Dániel Gerbner
;
Balázs Patkós
;
Máté Vizer
A Sundaram type bijection for \(\mathrm{SO}(3)\): vacillating tableaux and pairs of standard Young tableaux and orthogonal Littlewood-Richardson tableaux
Judith Jagenteufel
The diachromatic number of digraphs
Gabriela Araujo-Pardo
;
Juan José Montellano-Ballesteros
;
Mika Olsen
;
Christian Rubio-Montiel