Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 25 (2018)
no. 2
Précédent
Suivant
Tome 25 (2018) no. 2
Sommaire
Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
Liying Kang
;
Lele Liu
;
Erfang Shan
Eigenvalue bounds for the signless \(p\)-Laplacian
Elizandro Max Borba
;
Uwe Schwerdtfeger
Residual \(q\)-Fano planes and related structures
Tuvi Etzion
;
Niv Hooker
On the poset and asymptotics of Tesler matrices
Jason O'Neill
Hamilton circles in Cayley graphs
Babak Miraftab
;
Tim Rühmann
On the existence of Frobenius digraphical representations
Pablo Spiga
Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4
Qingying Deng
;
Xian'an Jin
;
Fengming Dong
;
Eng Guan Tay
A new approach for examining \(q\)-Steiner systems
Tuvi Etzion
Clique trees of infinite locally finite chordal graphs
Christoph Hofer-Temmel
;
Florian Lehner
Vertex-transitive direct products of graphs
Richard H. Hammack
;
Wilfried Imrich
Hypergraph saturation irregularities
Natalie C. Behague
On vertex-disjoint paths in regular graphs
Jie Han
A new upper bound for cancellative pairs
Barnabás Janzer
Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
Jacob Fox
;
Lisa Sauermann
On the smallest snarks with oddness 4 and connectivity 2
Jan Goedgebeur
Bipartite Ramsey numbers for graphs of small bandwidth
Lili Shen
;
Qizhong Lin
;
Qinghai Liu
On Bergeron's positivity problem for \(q\)-binomial coefficients
Fabrizio Zanello
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
Victor Falgas-Ravry
;
Allan Lo
Counting compositions over finite abelian groups
Zhicheng Gao
;
Andrew MacFie
;
Qiang Wang
Anagram-free graph colouring
Tim E. Wilson
;
David R. Wood
A generalization of Erdős' matching conjecture
Christos Pelekis
;
Israel Rocha
Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
George F. McNulty
Chromatic index, treewidth and maximum degree
Henning Bruhn
;
Laura Gellert
;
Richard Lang
Deferred on-line bipartite matching
Jakub Kozik
;
Grzegorz Matecki
Semiregular automorphisms in vertex-transitive graphs of order \(3p^2\)
Dragan Marušič
Edge reconstruction of the Ihara zeta function
Gunther Cornelissen
;
Janne Kool
Avoiding fractional powers over the natural numbers
Lara Pudwell
;
Eric Rowland
An easy subexponential bound for online chain partitioning
Bartłomiej Bosek
;
H. A. Kierstead
;
Tomasz Krawczyk
;
Grzegorz Matecki
;
Matthew E. Smith
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
Necessary conditions for Schur-maximality
Foster Tom
;
Stephanie van Willigenburg
Paths and cycles in random subgraphs of graphs with large minimum degree
Stefan Ehard
;
Felix Joos
The extremal function and Colin de Verdière graph parameter
Rose McCarty
A new upper bound on the game chromatic index of graphs
Ralph Keusch
Defective 3-paintability of planar graphs
Grzegorz Gutowski
;
Ming Han
;
Tomasz Krawczyk
;
Xuding Zhu
Convex geometries are extremal for the generalized Sauer-Shelah bound
Bogdan Chornomaz
Symmetries of shamrocks. II: Axial shamrocks
Mihai Ciucu
Nonempty intersection of longest paths in \(2K_2\)-free graphs
Gili Golan
;
Songling Shan
On two-sided gamma-positivity for simple permutations
Ron M. Adin
;
Eli Bagno
;
Estrella Eisenberg
;
Shulamit Reches
;
Moriah Sigron
Bispindles in strongly connected digraphs with large chromatic number
Nathann Cohen
;
Frédéric Havet
;
William Lochet
;
Raul Lopes
Flows in signed graphs with two negative edges
Edita Rollová
;
Michael Schubert
;
Eckhard Steffen
Hultman elements for the hyperoctahedral groups
Alexander Woo
On a conjecture regarding permutations which destroy arithmetic progressions
Mehtaab Sawhney
;
David Stoner
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
Frank Duque
;
Hernán González-Aguilar
;
César Hernández-Vélez
;
Jesús Leaños
;
Carolina Medina
Toward the Schur expansion of Macdonald polynomials
Sami Assaf
Maximal planar subgraphs of fixed girth in random graphs
Manuel Fernández
;
Nicholas Sieger
;
Michael Tait
A note on not-4-list colorable planar graphs
Margit Voigt
;
Arnfried Kemnitz
Binary covering arrays on tournaments
Elizabeth Maltais
;
Lucia Moura
;
Mike Newman
On the adjacency spectra of hypertrees
Gregory J. Clark
;
Joshua N. Cooper
On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian or cyclic
Ted Dobson
A note on the expected length of the longest common subsequences of two i.i.d. random permutations
Christian Houdré
;
Chen Xu
Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
Jang Soo Kim
;
U-Keun Song
Homogeneous 3-dimensional permutation structures
Samuel Braunfeld
Relaxations of \(\mathrm{GF}(4)\)-representable matroids
Ben Clark
;
James Oxley
;
Stefan H.M. van Zwam
On super-strong Wilf equivalence classes of permutations
Demetris Hadjiloucas
;
Ioannis Michos
;
Christina Savvidou
On rainbow Hamilton cycles in random hypergraphs
Andrzej Dudek
;
Sean English
;
Alan Frieze
Extending perfect matchings to Gray codes with prescribed ends
Petr Gregor
;
Tomáš Novotný
;
Riste Škrekovski