Cover Relations
Cover Relations is a binary relation in order theory that, for a given partially ordered set, specifies when one element is an immediate predecessor of another, meaning that no third element lies strictly between them in the order hierarchy.
14
Publications
392
Citations
23
Authors
13
Institutions
Publications per year
2017–2026
2
Variants
Covering Relations
Parents
14
Minimal inclusions of torsion classes
Emily Barnard, Andrew Carroll, Shijie Zhu · Algebraic Combinatorics · 2019 · 38 citations · Full text
1–5 of 14
23
2 publications · 51 citations
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 23
13

Beijing Language and Culture University
Beijing, China
2 h-index
4 publications
54 citations
Aix-Marseille Université
Marseille, France
1 h-index
1 publications
20 citations

Umeå University
Umeå, Sweden
1 h-index
2 publications
44 citations

The University of Adelaide
Adelaide, Australia
1 h-index
1 publications
25 citations

University of Rochester
Rochester, United States
1 h-index
1 publications
20 citations
Minnan Normal University
Zhangzhou, China
1 h-index
1 publications
55 citations

University of Cape Town
Rondebosch, South Africa
1 h-index
1 publications
13 citations

Linköping University
Linköping, Sweden
1 h-index
1 publications
10 citations
1–8 of 13
1 publications · 10 citations
1
h-index
1 publications · 13 citations
1
h-index
Repository · 1 publications · 13 citations
1
h-index
TRAN · 1 publications · 13 citations
1
h-index
1 publications · 22 citations
1
h-index
1–5