E. C. Milner

1.5k total citations
60 papers, 727 citations indexed

About

E. C. Milner is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, E. C. Milner has authored 60 papers receiving a total of 727 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 37 papers in Geometry and Topology and 27 papers in Discrete Mathematics and Combinatorics. Recurrent topics in E. C. Milner's work include Advanced Topology and Set Theory (32 papers), Limits and Structures in Graph Theory (27 papers) and Advanced Algebra and Logic (18 papers). E. C. Milner is often cited by papers focused on Advanced Topology and Set Theory (32 papers), Limits and Structures in Graph Theory (27 papers) and Advanced Algebra and Logic (18 papers). E. C. Milner collaborates with scholars based in Canada, Hungary and United States. E. C. Milner's co-authors include A. J. W. Hilton, A. Hajnal, Karel Prikry, R. Rado, Péter L. Erdős, Ron Aharoni, Péter Erdős, E. Fried, Daniel J. Kleitman and P. Erdös and has published in prestigious journals such as Annals of the New York Academy of Sciences, Transactions of the American Mathematical Society and American Mathematical Monthly.

In The Last Decade

E. C. Milner

48 papers receiving 676 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
E. C. Milner Canada	12	480	438	320	116	61	60	727
Thomas Brylawski United States	10	307 0.6×	220 0.5×	158 0.5×	109 0.9×	106 1.7×	16	506
B. Bollobás United Kingdom	12	573 1.2×	549 1.3×	269 0.8×	153 1.3×	18 0.3×	17	758
Т. Галлаи Hungary	7	931 1.9×	685 1.6×	469 1.5×	168 1.4×	33 0.5×	11	1.1k
Robert Woodrow Canada	12	390 0.8×	218 0.5×	241 0.8×	62 0.5×	46 0.8×	34	513
Dwight Duffus United States	14	430 0.9×	172 0.4×	160 0.5×	69 0.6×	76 1.2×	51	566
Chao Ko Hungary	2	514 1.1×	721 1.6×	346 1.1×	198 1.7×	71 1.2×	2	825
Yahya Ould Hamidoune France	17	583 1.2×	534 1.2×	396 1.2×	357 3.1×	130 2.1×	86	943
D. Hanson Canada	9	276 0.6×	301 0.7×	176 0.6×	73 0.6×	40 0.7×	14	461
Moshe Rosenfeld United States	12	335 0.7×	159 0.4×	118 0.4×	146 1.3×	14 0.2×	44	456
Walter Wenzel Germany	11	306 0.6×	92 0.2×	113 0.4×	74 0.6×	86 1.4×	42	430

Countries citing papers authored by E. C. Milner

Since Specialization

Citations

This map shows the geographic impact of E. C. Milner'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 E. C. Milner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. C. Milner more than expected).

Fields of papers citing papers by E. C. Milner

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by E. C. Milner. 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 E. C. Milner. The network helps show where E. C. Milner may publish in the future.

Co-authorship network of co-authors of E. C. Milner

This figure shows the co-authorship network connecting the top 25 collaborators of E. C. Milner. A scholar is included among the top collaborators of E. C. Milner 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 E. C. Milner. E. C. Milner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Milner, E. C., et al.. (1997). The ANTI-order and the fixed point property for caccc posets. Discrete Mathematics. 175(1-3). 197–209. 3 indexed citations

Komjáth, Péter & E. C. Milner. (1994). On a Conjecture of Rödl and Voigt. Journal of Combinatorial Theory Series B. 61(2). 199–209. 1 indexed citations

Milner, E. C.. (1994). The use of elementary substructures in combinatorics. Discrete Mathematics. 136(1-3). 243–252. 3 indexed citations

Hahn, Geňa, E. C. Milner, & Robert Woodrow. (1991). Infinite friendship graphs with infinite parameters. Journal of Combinatorial Theory Series B. 52(1). 30–41.

Milner, E. C. & Karel Prikry. (1991). A partition relation for triples using a model of Todorčević. Discrete Mathematics. 95(1-3). 183–191. 5 indexed citations

Aharoni, Ron, E. C. Milner, & Karel Prikry. (1990). Unfriendly partitions of a graph. Journal of Combinatorial Theory Series B. 50(1). 1–10. 33 indexed citations

Komjáth, Péter, E. C. Milner, & Norbert Polat. (1988). A compactness theorem for perfect matchings in matroids. Journal of Combinatorial Theory Series B. 44(3). 253–262. 2 indexed citations

Komjáth, Péter, E. C. Milner, & Norbert Polat. (1987). A compactness theorem for perfect matchings in matroids. Journal of Combinatorial Theory Series A. 44(3). 253–262. 1 indexed citations

Milner, E. C. & Karel Prikry. (1986). A partition theorem for triples. Proceedings of the American Mathematical Society. 97(3). 488–494. 5 indexed citations

10.

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

11.

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

12.

Milner, E. C.. (1975). Independent transversals for countable set systems. Journal of Combinatorial Theory Series A. 19(2). 125–133. 2 indexed citations

13.

Milner, E. C. & Saharon Shelah. (1974). Sufficiency Conditions for the Existence of Transversals. Canadian Journal of Mathematics. 26(4). 948–961. 3 indexed citations

14.

Erdös, P., E. C. Milner, & R. Rado. (1974). Intersection theorems for systems of sets (III). Journal of the Australian Mathematical Society. 18(1). 22–40. 10 indexed citations

15.

Hajnal, A., et al.. (1972). A Cure for the Telephone Disease. Canadian Mathematical Bulletin. 15(3). 447–450. 67 indexed citations

16.

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

17.

Erdős, Péter L., A. Hajnal, & E. C. Milner. (1969). A problem on well ordered sets. Acta Mathematica Academiae Scientiarum Hungaricae. 20(3-4). 323–329. 1 indexed citations

18.

Milner, E. C.. (1969). Partition Relations for Ordinal Numbers. Canadian Journal of Mathematics. 21. 317–334. 2 indexed citations

19.

Milner, E. C.. (1968). Well-Quasi-Ordering of Sequences of Ordinal Numbers. Journal of the London Mathematical Society. s1-43(1). 291–296. 4 indexed citations

20.

Milner, E. C.. (1968). A Combinatorial Theorem on Systems of Sets. Journal of the London Mathematical Society. s1-43(1). 204–206. 40 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