


default search action
European Journal of Combinatorics, Volume 92
Volume 92, February 2021
- Hua Sun
:
The γ-positivity of bivariate Eulerian polynomials via the Hetyei-Reiner action. 103166 - J. Pascal Gollin
, Karl Heuer
:
An analogue of Edmonds' Branching Theorem for infinite digraphs. 103182 - Ligang Jin, Tsai-Lien Wong, Xuding Zhu
:
Colouring of S-labelled planar graphs. 103198 - Mathias Pétréolle, Alan D. Sokal:
Lattice paths and branched continued fractions II. Multivariate Lah polynomials and Lah symmetric functions. 103235 - Alex Schaefer, Eric Swartz
:
Graphs that contain multiply transitive matchings. 103236 - Nathan McNew
:
Counting primitive subsets and other statistics of the divisor graph of {1, 2, ..., n}. 103237 - Victor Souza
:
Blowup Ramsey numbers. 103238 - Federico Castillo
, José Alejandro Samper:
Finiteness theorems for matroid complexes with prescribed topology. 103239 - Xavier Pérez-Giménez, Pawel Pralat, Douglas B. West:
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness. 103242 - Peter Frankl:
On the size of shadow-added intersecting families. 103243 - Xiaofeng Gu
:
Toughness in pseudo-random graphs. 103255 - Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs. 103256

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.