E. C. Milner
-
- Limits and Structures in Graph Theory 27
- Geometry and Topology top 2%
- Advanced Topology and Set Theory 32
-
- Advanced Algebra and Logic 18
- Advanced Graph Theory Research 10
- Computability, Logic, AI Algorithms 10
- Graph Labeling and Dimension Problems 6
-
- Rings, Modules, and Algebras 11
- Mathematical Physics top 10%
-
- graph theory and CDMA systems 5
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- Discrete Mathematics (8 papers)Journal of the London Mathematical Society (7 papers)Journal of Combinatorial Theory Series B (4 papers)
- Partner nations
- CanadaHungaryUnited States
In The Last Decade
E. C. Milner
48 papers receiving 676 citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 438
- Geometry and Topology 320
- Computational Theory and Mathematics 480
- Algebra and Number Theory 61
- Mathematical Physics 44
Countries citing papers authored by E. C. Milner
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
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
The 23 scholars most cited alongside E. C. Milner, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1997 | 3 | |
| 2 | 1994 | 1 | |
| 3 | 1994 | 3 | |
| 4 | 1991 | 0 | |
| 5 | 1991 | 5 | |
| 6 | 1990 | 33 | |
| 7 | 1988 | 2 | |
| 8 | A compactness theorem for perfect matchings in matroids | 1987 | 1 |
| 9 | 1986 | 5 | |
| 10 | 1981 | 3 | |
| 11 | 1981 | 4 | |
| 12 | 1975 | 2 | |
| 13 | 1974 | 3 | |
| 14 | 1974 | 10 | |
| 15 | 1972 | 67 | |
| 16 | 1970 | 1 | |
| 17 | 1969 | 1 | |
| 18 | 1969 | 2 | |
| 19 | 1968 | 4 | |
| 20 | 1968 | 40 |
About E. C. Milner
E. C. Milner is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Mathematical Physics, having authored 60 papers that have together received 727 indexed citations. Recurring topics across this work include Advanced Topology and Set Theory (32 papers), Limits and Structures in Graph Theory (27 papers), Advanced Algebra and Logic (18 papers), Rings, Modules, and Algebras (11 papers), Advanced Graph Theory Research (10 papers), Computability, Logic, AI Algorithms (10 papers), Graph Labeling and Dimension Problems (6 papers) and graph theory and CDMA systems (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (438 citations), Geometry and Topology (320 citations), Computational Theory and Mathematics (480 citations), Algebra and Number Theory (61 citations) and Mathematical Physics (44 citations). E. C. Milner has collaborated with scholars based in Canada, Hungary and United States. Frequent 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. Their work appears in journals such as Discrete Mathematics, Journal of the London Mathematical Society, Journal of Combinatorial Theory Series B, Mathematical Proceedings of the Cambridge Philosophical Society and Journal of Combinatorial Theory Series A.
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.