Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 27 (2020)
no. 4
Précédent
Suivant
Tome 27 (2020) no. 4
Sommaire
Deducing a variational principle with minimal \textit{a priori} assumptions
Andrew Krieger
;
Georg Menz
;
Martin Tassy
Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
Ilkyoo Choi
;
Ringi Kim
;
Boram Park
On growth of the set \(A(A+1)\) in arbitrary finite fields
Ali Mohammadi
Finding unavoidable colorful patterns in multicolored graphs
Matt Bowen
;
Ander Lamaison
;
Alp Müyesser
A counterexample to a conjecture on Schur positivity of chromatic symmetric functions of trees
Emmanuella Sandratra Rambeloson
;
John Shareshian
Phylogenetic trees, augmented perfect matchings, and a Thron-type continued fraction (T-fraction) for the Ward polynomials
Andrew Elvey Price
;
Alan D. Sokal
A combinatorial formula for of \(\rho\)-removed uniform matroids
Kyungyong Lee
;
George D. Nasr
;
Jamie Radcliffe
Balanced equi-\(n\)-squares
Saieed Akbari
;
Trent G. Marbach
;
Rebecca J. Stones
;
Zhuanhao Wu
On fractional fragility rates of graph classes
Zdeněk Dvořák
;
Jean-Sébastien Sereni
On the longest common subsequence of conjugation invariant random permutations
Mohamed Slim Kammoun
The cover time of a biased random walk on a random regular graph of odd degree
Tony Johansson
Blockers for triangulations of a convex polygon and a geometric maker-breaker game
Chaya Keller
;
Yael Stein
Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
Raphael Yuster
The maximum number of cliques in hypergraphs without large matchings
Erica L.L. Liu
;
Jian Wang
The Terwilliger algebra of the twisted Grassmann graph: the thin case
Hajime Tanaka
;
Tao Wang
Harmonic bases for generalized coinvariant algebras
Brendon Rhoades
;
Tianyi Yu
;
Zehong Zhao
Clustering powers of sparse graphs
Jaroslav Nešetřil
;
Patrice Ossona de Mendez
;
Michał Pilipczuk
;
Xuding Zhu
Monochromatic subgraphs in iterated triangulations
Jie Ma
;
Tianyun Tang
;
Xingxing Yu
A Sauer-Shelah-Perles lemma for lattices
Stijn Cambie
;
Bogdan Chornomaz
;
Zeev Dvir
;
Yuval Filmus
;
Shay Moran
Stieltjes moment sequences for pattern-avoiding permutations
Alin Bostan
;
Andrew Elvey Price
;
Anthony John Guttmann
;
Jean-Marie Maillard
Volumes of flow polytopes related to caracol graphs
Jihyeug Jang
;
Jang Soo Kim
The maximum spectral radius of graphs without friendship subgraphs
Sebastian Cioabă
;
Lihua Feng
;
Michael Tait
;
Xiao-Dong Zhang
The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
Deepak Bal
;
Patrick Bennett
Sharper bounds and structural results for minimally nonlinear 0-1 matrices
Jesse Geneson
;
Shen-Fu Tsai
Existence and hardness of conveyor belts
Molly Baird
;
Sara Billey
;
Erik Demaine
;
Martin Demaine
;
David Eppstein
;
Sándor Fekete
;
Graham Gordon
;
Sean Griffin
;
Joseph Mitchell
;
Joshua Swanson
Generalizing tropical Kontsevich's formula to multiple cross-ratios
Christoph Goldner
Nonassociativity of the Norton algebras of some distance regular graphs
Jia Huang
Local dimension is unbounded for planar posets
Bartłomiej Bosek
;
Jarosław Grytczuk
;
William T. Trotter
Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
Pieter Kleer
;
Viresh Patel
;
Fabian Stroh
On the existence of Hamilton cycles with a periodic pattern in a random digraph
Alan Frieze
;
Xavier Pérez-Giménez
;
Paweł Prałat
Short cycle covers of graphs with at most 77\% vertices of degree two
Anna Kompišová
;
Robert Lukot'ka
The \(Q_2\)-free process in the hypercube
J. Robert Johnson
;
Trevor Pinto
On minimal distance-regular Cayley graphs of generalized dihedral groups
Štefko Miklavič
;
Primož Šparl
Smallest percolating sets in bootstrap percolation on grids
Michał Przykucki
;
Thomas Shelton
Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs
Yi-Zheng Fan
;
Yi Wang
;
Jiang-Chao Wan
On the minimum size of Hamilton saturated hypergraphs
Andrzej Ruciński
;
Andrzej Żak
The noncrossing bond poset of a graph
C. Matthew Farmer
;
Joshua Hallam
;
Clifford Smyth
The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
Hong-Bin Chen
;
Yen-Jen Cheng
;
Wei-Tian Li
;
Chia-An Liu
Calculating the dimension of the universal embedding of the symplectic dual polar space using languages
Carlos Segovia
;
Monika Winklmeier
Flag-transitive point-primitive symmetric \((v,k,\lambda)\) designs with bounded \(k\)
Zhilin Zhang
;
Pingzhi Yuan
;
Shenglin Zhou
Unfolding cubes: nets, packings, partitions, chords
Kristin DeSplinter
;
Satyan Devadoss
;
Jordan Readyhough
;
Bryce Wimberly
Extremal overlap-free and extremal \(\beta\)-free binary words
Lucas Mol
;
Narad Rampersad
;
Jeffrey Shallit
\(P_n\)-induced-saturated graphs exist for all \(n \geqslant 6\)
Vojtěch Dvořák
Pattern avoiding permutations with a unique longest increasing subsequence
Miklós Bóna
;
Elijah DeJonge
Saturation number of Berge stars in random hypergraphs
Lele Liu
;
Changxiang He
;
Liying Kang
Avoidable paths in graphs
Marthe Bonamy
;
Oscar Defrain
;
Meike Hatzel
;
Jocelyn Thiebaut
Spectral lower bounds for the quantum chromatic number of a graph. II
Pawel Wocjan
;
Clive Elphick
;
Parisa Darbari
Counting linear extensions of restricted posets
Sam Dittmer
;
Igor Pak
Low weight perfect matchings
Stefan Ehard
;
Elena Mohr
;
Dieter Rautenbach
Sign variation and descents
Nantel Bergeron
;
Aram Dermenjian
;
John Machacek
An update on reconfiguring 10-colorings of planar graphs
Zdeněk Dvořák
;
Carl Feghali
On the gonality of Cartesian products of graphs
Ivan Aidun
;
Ralph Morrison
Two-distance-primitive graphs
Wei Jin
;
Ci Xuan Wu
;
Jin Xin Zhou
Beck's theorem for plane curves
Mario Huicochea
Generalized spectral characterization of mixed graphs
Wei Wang
;
Lihong Qiu
;
Jianguo Qian
;
Wei Wang
On volume functions of special flow polytopes associated to the root system of type \(A\)
Takayuki Negishi
;
Yuki Sugiyama
;
Tatsuru Takakura
Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
Rosalind A. Cameron
;
David A. Pike