default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 82
Volume 82, December 2019
- Simone Munao:
Introducing article numbering to European Journal of Combinatorics. - Benjamin Gunby
, Dömötör Pálvölgyi:
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings. - Sang June Lee, Mark H. Siggers, Norihide Tokushige:
AK-type stability theorems on cross t-intersecting families. - Runrun Liu, Xiangwen Li:
Every planar graph without adjacent cycles of length at most 8 is 3-choosable. - Zdenek Dvorák, Xiaolan Hu:
Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable. - János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. - Xizhi Liu:
d-cluster-free sets with a given matching number. - Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Clique-factors in sparse pseudorandom graphs. - Dániel Gerbner, Cory Palmer:
Counting copies of a fixed subgraph in F-free graphs.
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.
last updated on 2025-02-21 19:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
