N. Sauer

1.7k total citations · 1 hit paper
47 papers, 893 citations indexed

About

N. Sauer is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, N. Sauer has authored 47 papers receiving a total of 893 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 23 papers in Geometry and Topology and 20 papers in Discrete Mathematics and Combinatorics. Recurrent topics in N. Sauer's work include Limits and Structures in Graph Theory (19 papers), Advanced Graph Theory Research (18 papers) and Advanced Topology and Set Theory (17 papers). N. Sauer is often cited by papers focused on Limits and Structures in Graph Theory (19 papers), Advanced Graph Theory Research (18 papers) and Advanced Topology and Set Theory (17 papers). N. Sauer collaborates with scholars based in Canada, United States and Austria. N. Sauer's co-authors include Robert Woodrow, Bill Sands, Mohamed H. El-Zahar, D. L. Hanson, Xuding Zhu, H. L. Abbott, Dwight Duffus, Manfred Droste, Dugald Macpherson and V. Rödl and has published in prestigious journals such as Annals of the New York Academy of Sciences, Transactions of the American Mathematical Society and Discrete Mathematics.

In The Last Decade

N. Sauer

42 papers receiving 819 citations

Hit Papers

On the density of families of sets 1972 2026 1990 2008 1972 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. On the density of families of sets
    1972 463 citations N. Sauer Journal of Combinatorial Theory Series A profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
N. Sauer Canada 12 532 308 297 272 116 47 893
J. Spencer United States 16 474 0.9× 348 1.1× 227 0.8× 225 0.8× 106 0.9× 41 928
Gyula O. H. Katona Hungary 19 515 1.0× 537 1.7× 201 0.7× 354 1.3× 217 1.9× 83 990
Robert E. Jamison United States 16 718 1.3× 271 0.9× 80 0.3× 343 1.3× 155 1.3× 64 995
Ron Aharoni Israel 19 799 1.5× 423 1.4× 89 0.3× 323 1.2× 131 1.1× 103 1.0k
Richard J. Nowakowski Canada 19 1.0k 1.9× 344 1.1× 367 1.2× 371 1.4× 114 1.0× 111 1.5k
Ivan Rival Canada 23 1.1k 2.0× 214 0.7× 150 0.5× 326 1.2× 119 1.0× 123 1.6k
L. H. Harper United States 12 482 0.9× 280 0.9× 146 0.5× 197 0.7× 265 2.3× 36 1.0k
Dmitrii V. Ṗasechnik Netherlands 14 448 0.8× 185 0.6× 161 0.5× 114 0.4× 164 1.4× 66 777
Jon Folkman United States 11 413 0.8× 257 0.8× 77 0.3× 216 0.8× 130 1.1× 20 723
J. L. Selfridge United States 15 277 0.5× 256 0.8× 257 0.9× 280 1.0× 60 0.5× 67 901

Countries citing papers authored by N. Sauer

Since Specialization
Citations

This map shows the geographic impact of N. Sauer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by N. Sauer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites N. Sauer more than expected).

Fields of papers citing papers by N. Sauer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by N. Sauer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by N. Sauer. The network helps show where N. Sauer may publish in the future.

Co-authorship network of co-authors of N. Sauer

This figure shows the co-authorship network connecting the top 25 collaborators of N. Sauer. A scholar is included among the top collaborators of N. Sauer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with N. Sauer. N. Sauer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sauer, N.. (2011). Vertex partitions of metric spaces with finite distance sets. Discrete Mathematics. 312(1). 119–128. 4 indexed citations
2.
Duffus, Dwight & N. Sauer. (2005). Chromatic numbers and products. Discrete Mathematics. 300(1-3). 91–99. 2 indexed citations
3.
Sauer, N.. (2003). Canonical Vertex Partitions. Combinatorics Probability Computing. 12(5-6). 671–704. 11 indexed citations
4.
Sauer, N.. (1995). On the Ramsey property of families of graphs. Transactions of the American Mathematical Society. 347(3). 785–833. 2 indexed citations
5.
El-Zahar, Mohamed H. & N. Sauer. (1994). On the divisibility of homogeneous hypergraphs. COMBINATORICA. 14(2). 159–165. 5 indexed citations
6.
Rödl, V., et al.. (1993). Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs. Journal of Combinatorial Theory Series B. 59(2). 199–209.
7.
Rödl, V. & N. Sauer. (1992). The Ramsey Property for Families of Graphs Which Exclude a Given Graph. Canadian Journal of Mathematics. 44(5). 1050–1060. 6 indexed citations
8.
Pach, János & N. Sauer. (1991). On the Average Volume of Subsets in Euclidean d-Space. European Journal of Combinatorics. 12(5). 417–421. 1 indexed citations
9.
Duffus, Dwight, Bill Sands, N. Sauer, & Robert Woodrow. (1991). Two-colouring all two-element maximal antichains. Journal of Combinatorial Theory Series A. 57(1). 109–116. 28 indexed citations
10.
El-Zahar, Mohamed H. & N. Sauer. (1991). Ramsey-type properties of relational structures. Discrete Mathematics. 94(1). 1–10. 11 indexed citations
11.
El-Zahar, Mohamed H. & N. Sauer. (1989). The indivisibility of the homogeneous Kn-free graphs. Journal of Combinatorial Theory Series B. 47(2). 162–170. 16 indexed citations
12.
El-Zahar, Mohamed H. & N. Sauer. (1988). Asymptotic enumeration of two-dimensional posets. Order. 5(3). 239–244. 6 indexed citations
13.
Hajnal, A. & N. Sauer. (1986). Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discrete Mathematics. 59(1-2). 61–67. 3 indexed citations
14.
Sands, Bill, N. Sauer, & Robert Woodrow. (1982). On monochromatic paths in edge-coloured digraphs. Journal of Combinatorial Theory Series B. 33(3). 271–275. 85 indexed citations
15.
Milner, E. C. & N. Sauer. (1981). Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. Discrete Mathematics. 35(1-3). 165–171. 3 indexed citations
16.
Milner, E. C. & N. Sauer. (1981). On Chains and Antichains in well Founded Partially Ordered Sets. Journal of the London Mathematical Society. s2-24(1). 15–33. 4 indexed citations
17.
Sauer, N., et al.. (1973). On the factorization of the complete graph. Journal of Combinatorial Theory Series B. 14(1). 1–6. 2 indexed citations
18.
Sauer, N.. (1972). On the density of families of sets. Journal of Combinatorial Theory Series A. 13(1). 145–147. 463 indexed citations breakdown →
19.
Sauer, N.. (1971). On the Maximal Number of Edges in Graphs with a Given Number of Edge-Disjoint Triangles. Journal of the London Mathematical Society. s2-4(1). 153–156. 1 indexed citations
20.
Milner, E. C. & N. Sauer. (1970). GENERALIZATIONS OF A LEMMA OF FOLKMAN. Annals of the New York Academy of Sciences. 175(1). 295–307. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by J. Spencer Breakdown of academic impact, for papers by Gyula O. H. Katona Breakdown of academic impact, for papers by Robert E. Jamison Breakdown of academic impact, for papers by Ron Aharoni Breakdown of academic impact, for papers by Richard J. Nowakowski Breakdown of academic impact, for papers by Ivan Rival Breakdown of academic impact, for papers by L. H. Harper Breakdown of academic impact, for papers by Dmitrii V. Ṗasechnik Breakdown of academic impact, for papers by Jon Folkman Breakdown of academic impact, for papers by J. L. Selfridge
Rankless by CCL
2026