Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 29 (2022)
no. 1
Précédent
Suivant
Tome 29 (2022) no. 1
Sommaire
A central limit theorem for the two-sided descent statistic on Coxeter groups
Benjamin Brück
;
Frank Röttger
Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph
Asaf Shapira
Tight bounds on probabilistic zero forcing on hypercubes and grids
Natalie C. Behague
;
Trent G. Marbach
;
Paweł Prałat
Weierstrass sets on finite graphs
Alessio Borzì
An Ore-type condition for Hamiltonicity in tough graphs
Songling Shan
A new matroid lift construction and an application to group-labeled graphs
Zach Walsh
Regular graphs with many triangles are structured
Pim van der Hoorn
;
Gabor Lippner
;
Elchanan Mossel
The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
Bethany Austhof
;
Patrick Bennett
;
Nick Christo
On zero-sum spanning trees and zero-sum connectivity
Yair Caro
;
Adriana Hansberg
;
Josef Lauri
;
Christina Zarb
Rainbow paths and large rainbow matchings
Ron Aharoni
;
Eli Berger
;
Maria Chudnovsky
;
Shira Zerbib
Union-closed families with small average overlap densities
David Ellis
Hat guessing on books and windmills
Xiaoyu He
;
Yuzu Ido
;
Benjamin Przybocki
Quotients of uniform positroids
Carolina Benedetti
;
Anastasia Chavez
;
Daniel Tamayo Jiménez
Walks obeying two-step rules on the square lattice: full, half and quarter planes
Nicholas Beaton
An isoperimetric inequality for Hamming balls and local expansion in hypercubes
Zilin Jiang
;
Amir Yehudayoff
Slide multiplicity free key polynomials
Soojin Cho
;
Stephanie van Willigenburg
Coloring drawings of graphs
Christoph Hertrich
;
Felix Schröder
;
Raphael Steiner
New lower bounds on the size-Ramsey number of a path
Deepak Bal
;
Louis DeBiasio
Polynomials counting nowhere-zero chains in graphs
Martin Kochol
Solving static permutation mastermind using \(O(n \log n)\) queries
Maxime Larcher
;
Anders Martinsson
;
Angelika Steger
Perfect codes in Cayley sum graphs
Xuanlong Ma
;
Kaishun Wang
;
Yuefeng Yang
Random Van der Waerden theorem
Ohad Zohar
Cooperative conditions for the existence of rainbow matchings
Ron Aharoni
;
Joseph Briggs
;
Minho Cho
;
Jinha Kim
A combinatorial proof of a Schmidt type theorem of Andrews and Paule
Kathy Q. Ji
Generalized Dold sequences on partially-ordered sets
Grzegorz Graff
;
Jacek Gulgowski
;
Małgorzata Lebiedź
Independent sets in subgraphs of a shift graph
Andrii Arman
;
Vojtěch Rödl
;
Marcelo Tadeu Sales
Enumeration of Gelfand-Cetlin type reduced words
Yunhyung Cho
;
Jang Soo Kim
;
Eunjeong Lee
\(H\)-chromatic symmetric functions
Nancy Mae Eagles
;
Angèle M. Foley
;
Alice Huang
;
Elene Karangozishvili
;
Annan Yu
The density of fan-planar graphs
Michael Kaufmann
;
Torsten Ueckerdt
On the dichromatic number of surfaces
Pierre Aboulker
;
Frédéric Havet
;
Kolja Knauer
;
Clément Rambaud
Topology of augmented Bergman complexes
Elisabeth Bullock
;
Aidan Kelley
;
Victor Reiner
;
Kevin Ren
;
Gahl Shemy
;
Dawei Shen
;
Brian Sun
;
Zhichun Joy Zhang
The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling
C. Y. Amy Pang
On the zero forcing number and spectral radius of graphs
Wenqian Zhang
;
Jianfeng Wang
;
Weifan Wang
;
Shengjin Ji
Bohr neighborhoods in generalized difference sets
John T. Griesmer
The tree alternative conjecture under the topological minor relation
Jorge Bruno
;
Paul Szeptycki
Some remarks on combinatorial wall-crossing
Galyna Dobrovolska
Andrews-Beck type congruences for overpartitions
Eunmi Kim
Subgraph complementation and minimum rank
Calum Buchanan
;
Christopher Purcell
;
Puck Rombach
On pattern avoidance in matchings and involutions
Jonathan J. Fang
;
Zachary Hamaker
;
Justin M. Troyka
On the connection between Stirling numbers and Bessel numbers
David Stenlund
Tiling enumeration of hexagons with off-central holes
Tri Lai
Cutting a cake for infinitely many guests
Zsuzsanna Jankó
;
Attila Joó
A new family of algebraically defined graphs with small automorphism group
Felix Lazebnik
;
Vladislav Taranchuk
Snarks with resistance \(n\) and flow resistance \(2n\)
Imran Allie
;
Edita Máčajová
;
Martin Škoviera
Modular and fractional \(L\)-intersecting families of vector spaces
Rogers Mathew
;
Tapas Kumar Mishra
;
Ritabrata Ray
;
Shashank Srivastava
\(K_{r,s}\) graph bootstrap percolation
Erhan Bayraktar
;
Suman Chakraborty
Edge isoperimetric inequalities for powers of the hypercube
Cyrus Rashtchian
;
William Raynaud
On multisets, interpolated multiple zeta values and limit laws
Markus Kuba
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
Wojciech Nadara
;
Marcin Smulewicz
Sharp upper and lower bounds on a restricted class of convex characters
Steven Kelk
;
Ruben Meuwese
On 1-subdivisions of transitive tournaments
Jaehoon Kim
;
Hyunwoo Lee
;
Jaehyeon Seo
Ramsey numbers of fans and large books
Meng Liu
;
Yusheng Li
On explicit constructions of designs
Xizhi Liu
;
Dhruv Mubayi
Weighted words at degree two. II: Flat partitions, regular partitions, and application to level one perfect crystals
Isaac Konan
Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
Patrick Hompe
;
Sophie Spirkl
On well-connected sets of strings
Peter Frankl
;
János Pach
Treewidth of the generalized Kneser graphs
Ke Liu
;
Mengyu Cao
;
Mei Lu
Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
Jozefien D'haeseleer
;
Giovanni Longobardi
;
Ago-Erik Riet
;
Leo Storme
Points and lines configurations for perpendicular bisectors of convex cyclic polygons
Paul Melotti
;
Sanjay Ramassamy
;
Paul Thévenin
Full Text
Improved bounds for weak coloring numbers
Gwenaël Joret
;
Piotr Micek
Computing volumes of adjacency polytopes via Draconian sequences
Robert Davis
;
Tianran Chen
Another note on intervals in the Hales-Jewett theorem
Nina Kamčev
;
Christoph Spiegel
Uncountably many minimal hereditary classes of graphs of unbounded clique-width
Robert Brignall
;
Daniel Cocks