Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 28 (2021)
no. 4
Précédent
Suivant
Tome 28 (2021) no. 4
Sommaire
The rotor-routing torsor and the Bernardi torsor disagree for every non-planar ribbon graph
Changxin Ding
The Bernardi formula for nontransitive deformations of the braid arrangement
Ankit Bisain
;
Eric Hanson
Edge-disjoint branchings in temporal digraphs
Victor Campos
;
Raul Lopes
;
Andrea Marino
;
Ana Silva
The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
Changhong Lu
;
Long-Tu Yuan
;
Ping Zhang
Jones' conjecture in subcubic graphs
Marthe Bonamy
;
François Dross
;
Tomáš Masařík
;
Andrea Munaro
;
Wojciech Nadara
;
Marcin Pilipczuk
;
Michał Pilipczuk
Two results on Ramsey-Turán theory
Meng Liu
;
Yusheng Li
Normal polytopes and ellipsoids
Joseph Gubeladze
Removahedral congruences versus permutree congruences
Doriann Albertin
;
Vincent Pilaud
;
Julian Ritter
Counting non-crossing permutations on surfaces of any genus
Norman Do
;
Jian He
;
Daniel V. Mathews
The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
Karen Meagher
;
A. Sarobidy Razafimahatratra
Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\)
Jozefien D'haeseleer
;
Ferdinand Ihringer
;
Jonathan Mannaert
;
Leo Storme
Characterizations of the \(G_2(4)\) and \(L_3(4)\) near octagons
Bart De Bruyn
A graph theory of rook placements
Kenneth Barrese
Some applications of Wagner's weighted subgraph counting polynomial
Ferenc Bencs
;
Péter Csikvári
;
Guus Regts
Zero-sum squares in bounded discrepancy \(\{-1,1\}\)-matrices
Alma R. Arévalo
;
Amanda Montejano
;
Edgardo Roldán-Pensado
Matching complexes of \(3 \times n\) grid graphs
Shuchita Goyal
;
Samir Shukla
;
Anurag Singh
Principal specialization of dual characters of flagged Weyl modules
Karola Mészáros
;
Avery St. Dizier
;
Arthur Tanjaya
Toppling on permutations with an extra chip
Arvind Ayyer
;
Beáta Bényi
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
Matthieu Rosenfeld
Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
Zhen He
;
Mei Lu
A characteristic polynomial for the transition probability matrix of correlated random walks on a graph
Takashi Komatsu
;
Norio Konno
;
Iwao Sato
Improved packings of \(n(n - 1)\) unit squares in a square
M. Z. Arslanov
;
S. A. Mustafin
;
Z. K. Shangitbayev
On factors of independent transversals in \(k\)-partite graphs
Raphael Yuster
Bell polynomials and nonlinear inverse relations
Wenchang Chu
Transversals and bipancyclicity in bipartite graph families
Peter Bradshaw
Resolutions of convex geometries
Domenico Cantone
;
Jean-Paul Doignon
;
Alfio Giarlotta
;
Stephen Watson
Popular differences for right isosceles triangles
Vjekoslav Kovač
Transitive avoidance games on boards of odd size
Matthias Gehnen
;
Eberhard Triesch
Bijections for faces of the Shi and Catalan arrangements
Duncan Levear
Asymptotic properties of random unlabelled block-weighted graphs
Benedikt Stufler
Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes
Preston Cranford
;
Anton Dochtermann
;
Evan Haithcock
;
Joshua Marsh
;
Suho Oh
;
Anna Truman
Generalized planar Turán numbers
Ervin Győri
;
Addisu Paulos
;
Nika Salia
;
Casey Tompkins
;
Oscar Zamora
On bipartite distinct distances in the plane
Surya Mathialagan
Paths of length three are \(K_{r+1}\)-Turán-good
Kyle Murphy
;
JD Nir
Cycles in color-critical graphs
Benjamin R. Moore
;
Douglas B. West
On the number of sum-free triplets of sets
Igor Araujo
;
József Balogh
;
Ramon I. Garcia
Generalizations and strengthenings of Ryser's conjecture
Louis DeBiasio
;
Yigal Kamel
;
Grace McCourt
;
Hannah Sheats
Twenty Vertex model and domino tilings of the Aztec triangle
Philippe Di Francesco
The exact linear Turán number of the sail
Beka Ergemlidze
;
Ervin Győri
;
Abhishek Methuku
Diameters of cocircuit graphs of oriented matroids: an update
Ilan Adler
;
Jesús A. De Loera
;
Steven Klee
;
Zhenyang Zhang
A survey of the Hadamard maximal determinant problem
Patrick Browne
;
Ronan Egan
;
Fintan Hegarty
;
Padraig Ó Catháin
\(r\)-critical numbers of natural intervals
Marcel Herzog
;
Gil Kaplan
;
Arieh Lev
;
Romina Zigdon
On automorphisms of the double cover of a circulant graph
Ademir Hujdurović
;
Đorđe Mitrović
;
Dave Witte Morris
A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids
Kyungyong Lee
;
George D. Nasr
;
Jamie Radcliffe
Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
Xiaoye Liang
;
Ying-Ying Tan
;
Jack Koolen
Integral mixed Cayley graphs over abelian groups
Monu Kadyan
;
Bikash Bhattacharjya
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Manuel Aprile
;
Samuel Fiorini
;
Tony Huynh
;
Gwenaël Joret
;
David R. Wood
A combinatorial bijection on di-sk trees
Shishuo Fu
;
Zhicong Lin
;
Yaling Wang
Automorphisms and some geodesic properties of ortho-Grassmann graphs
Mark Pankov
;
Krzysztof Petelczyc
;
Mariusz Źynel
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Brahadeesh Sankarnarayanan
;
Niranjan Balachandran
Periodic solutions of one-dimensional cellular automata with uniformly chosen random rules
Janko Gravner
;
Xiaochen Liu
Pattern avoidance over a hypergraph
Benjamin Gunby
;
Maxwell Fishelson
Regarding two conjectures on clique and biclique partitions
Dhruv Rohatgi
;
John C. Urschel
;
Jake Wellens
Combinatorial game distributions of Steiner systems
Yuki Irie
A new algorithm for embedding plane graphs at fixed vertex locations
Marcus Schaefer