Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 28 (2021)
no. 2
Précédent
Suivant
Tome 28 (2021) no. 2
Sommaire
A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
José Aliste-Prieto
;
Logan Crew
;
Sophie Spirkl
;
José Zamora
Prolific permutations
Michael Albert
;
Murray Tannock
A note on transitive union-closed families
James Aaronson
;
David Ellis
;
Imre Leader
Forbidding \(K_{2,t}\) traces in triple systems
Ruth Luo
;
Sam Spiro
Algorithmically distinguishing irreducible characters of the symmetric group
Timothy Y. Chow
;
Jennifer Paulhus
Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude
Julien Courtiel
;
Andrew Elvey Price
;
Irène Marcovici
Almost intersecting families
Peter Frankl
;
Andrey Kupavskii
Restricted extension of sparse partial edge colorings of complete graphs
Carl Johan Casselgren
;
Lan Anh Pham
The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
Jaehoon Kim
;
Sang-il Oum
Ramsey theory for layered semigroups
Jordan Mitchell Barrett
Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
Kasper Szabo Lyngsie
;
Liang Zhong
Grundy domination of forests and the strong product conjecture
Kayla Bell
;
Keith Driscoll
;
Elliot Krop
;
Kimber Wolff
Almost simple groups of Lie type and symmetric designs with \(\lambda\) prime
Seyed Hassan Alavi
;
Mohsen Bayat
;
Ashraf Daneshkhah
Coloring problems on bipartite graphs of small diameter
Victor A. Campos
;
Guilherme C.M. Gomes
;
Allen Ibiapina
;
Raul Lopes
;
Ignasi Sau
;
Ana Silva
The top-degree part in the matchings-Jack conjecture
Adam Burchardt
Almost all permutation matrices have bounded saturation functions
Jesse Geneson
A note on complex-4-colorability of signed planar graphs
Arnfried Kemnitz
;
Margit Voigt
The Graham-Knuth-Patashnik recurrence: symmetries and continued fractions
Jesús Salas
;
Alan D. Sokal
Characters and chromatic symmetric functions
Mark Skandera
Square-free graphs with no induced fork
Maria Chudnovsky
;
Shenwei Huang
;
T. Karthick
;
Jenny Kaufmann
Two maps on affine type \(A\) crystals and Hecke algebras
Nicolas Jacon
On the sizes of bipartite 1-planar graphs
Yuanqiu Huang
;
Zhangdong Ouyang
;
Fengming Dong
A note on the Erdős-Szekeres theorem in two dimensions
Lyuben Lichev
Answers to two questions on the DP color function
Jeffrey A. Mudrock
;
Seth Thomason
Diameter three orientability of bipartite graphs
Bin Chen
;
An Chang
Random perturbation of sparse graphs
Max Hahn-Klimroth
;
Giulia Maesaka
;
Yannick Mogge
;
Samuel Mohr
;
Olaf Parczyk
Extension of Gyárfás-Sumner conjecture to digraphs
Pierre Aboulker
;
Pierre Charbit
;
Reza Naserasr
Rank selection and depth conditions for balanced simplicial complexes
Brent Holmes
;
Justin Lyle
Symplectic keys and Demazure atoms in type \(C\)
João Miguel Santos
Norton algebras of the Hamming graphs via linear characters
Jia Huang
Majority colorings of sparse digraphs
Michael Anastos
;
Ander Lamaison
;
Raphael Steiner
;
Tibor Szabó
Squarefree powers of edge ideals of forests
Nursel Erey
;
Takayuki Hibi
Betti numbers of weighted oriented graphs
Beata Casiday
;
Selvi Kara
A subexponential upper bound for van der Waerden numbers \(W(3,k)\)
Tomasz Schoen
Tomaszewski's problem on randomly signed sums, revisited
Ravi B. Boppana
;
Harrie Hendriks
;
Martien C.A. van Zuijlen
Hidden words statistics for large patterns
Svante Janson
;
Wojciech Szpankowski
Note on long paths in Eulerian digraphs
Charlotte Knierim
;
Maxime Larcher
;
Anders Martinsson
A geometric and combinatorial exploration of Hochschild lattices
Camille Combe
Elastic elements in 3-connected matroids
George Drummond
;
Zach Gershkoff
;
Susan Jowett
;
Charles Semple
;
Jagdeep Singh
On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs
Grace M. X. Li
;
Arthur L. B. Yang
A new upper bound on extremal number of even cycles
Zhiyang He
Large monochromatic components in almost complete graphs and bipartite graphs
Zoltán Füredi
;
Ruth Luo
A generalization of Stiebitz-type results on graph decomposition
Qinghou Zeng
;
Chunlei Zu
Circular chromatic number of signed graphs
Reza Naserasr
;
Zhouningxin Wang
;
Xuding Zhu
Lattice polytopes from Schur and symmetric Grothendieck polynomials
Margaret Bayer
;
Bennet Goeckner
;
Su Ji Hong
;
Tyrrell McAllister
;
McCabe Olsen
;
Casey Pinckney
;
Julianne Vega
;
Martha Yip
On the intersection distribution of degree three polynomials and related topics
Gohar Kyureghyan
;
Shuxing Li
;
Alexander Pott
Structure and colour in triangle-free graphs
N. R. Aravind
;
Stijn Cambie
;
Wouter Cames van Batenburg
;
Rémi de Joannis de Verclos
;
Ross J. Kang
;
Viresh Patel
The normalized matching property in random and pseudorandom bipartite graphs
Niranjan Balachandran
;
Deepanshu Kush
Asymptotics of 3-stack-sortable permutations
Colin Defant
;
Andrew Elvey Price
;
Anthony Guttmann
Hopf algebra structure of generalized quasi-symmetric functions in partially commutative variables
Adam Doliwa
Channels, billiards, and perfect matching 2-divisibility
Grant T. Barkley
;
Ricky Ini Liu