Eric Charles Milner

Eric Charles Milner's AcademicInfluence.com Rankings

Eric Charles Milner

Mathematics

#1989

World Rank

#3145

Historical Rank

Measure Theory

#3422

World Rank

#4040

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Eric Charles Milner Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eric Charles Milner, FRSC was a mathematician who worked mainly in combinatorial set theory. Biography Born into a South East London working-class family, Milner was sent to a Reading boarding school for the war but, hating it, ran away and roamed the streets of London. Eventually, another school was found for him; Milner attended King's College London starting in 1946, where he competed as a featherweight boxer. He graduated in 1949 as the best mathematics student in his year, and received a master's degree in 1950 under the supervision of Richard Rado and Charles Coulson. Partial deafness prevented him from joining the Navy, and instead, in 1951, he took a position with the Straits Trading Company in Singapore assaying tin. Soon thereafter he joined the mathematics faculty at the University of Malaya in Singapore, where Alexander Oppenheim and Richard K. Guy were already working. In 1958, Milner took a sabbatical at the University of Reading, and in 1961 he took a lecturership there and began his doctoral studies; he obtained a Ph.D. from the University of London in 1963. He joined his former Singapore colleagues Guy and Peter Lancaster as a professor at the University of Calgary in 1967, where he was head of the mathematics department from 1976 to 1980. In 1973, he became a Canadian citizen, and in 1976 he became a fellow of the Royal Society of Canada. In 1974 he was a Plenary Speaker of the International Congress of Mathematicians in Vancouver.

(See a Problem?)

Eric Charles Milner's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (1967) (372)
THE THEORY OF GRAPHS AND ITS APPLICATIONS (1964) (100)
Basic WQO- and BQO-Theory (1985) (100)
A Cure for the Telephone Disease (1972) (95)
Some remarks on simple tournaments (1972) (74)
Unfriendly partitions of a graph (1990) (67)
A Combinatorial Theorem on Systems of Sets (1968) (65)
A Tribute to Paul Erdős: Graphs with no unfriendly partitions (1990) (35)
The Pigeon‐Hole Principle for Ordinal Numbers (1965) (34)
UNSOLVED PROBLEMS IN SET THEORY (2001) (29)
Simple one-point extensions of tournaments (1972) (28)
Necessary and Sufficient Conditions for Transversals of Countable Set Systems (1974) (26)
On the complete subgraphs of graphs defined by systems of sets (1966) (26)
ON THE COFINALITY OF PARTIALLY ORDERED SETS (1982) (24)
The cofinality of a partially ordered set (1983) (24)
On sets of almost disjoint subsets of a set (1968) (21)
A Theorem in the Partition Calculus (1972) (20)
On the average size of the sets in a Sperner family (1973) (20)
Intersection theorems for systems of sets (III) (1974) (19)
A chain complete poset with no infinite antichain has a finite core (1993) (19)
The PT-order and the fixed point property (1992) (13)
A partition relation for triples using a model of Todorcevic (1991) (13)
On Chains and Antichains in well Founded Partially Ordered Sets (1981) (12)
From finite posets to chain complete posets having no infinite antichain (1995) (11)
Partition Relations for Ordinal Numbers (1969) (10)
Sufficiency Conditions for the Existence of Transversals (1974) (10)
The dimension of the finite subsets κ (1996) (9)
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma (1981) (9)
A partition theorem for triples (1986) (9)
Set mappings and polarized partition relations bY (1969) (8)
On directed graphs with an independent covering set (1989) (8)
Partition Relations for ηα‐sets (1971) (8)
A note on the dimension of a poset (1990) (7)
The use of elementary substructures in combinatorics (1994) (7)
Cardinal representations for closures and preclosures (1991) (7)
On the width of ordered sets and Boolean algebras (1986) (6)
Interval covers of a linearly ordered set (1994) (6)
On set systems having paradoxical covering properties (1978) (6)
Some inequalities for partial orders (1987) (5)
A Theorem in the Partition Calculus Corrigendum (1974) (5)
Well-Quasi-Ordering of Sequences of Ordinal Numbers (1968) (5)
On the independent subsets of a closure system with singular dimension (1985) (5)
Transversals of Disjoint Sets (1968) (5)
Families of sets whose pairwise intersections have prescribed cardinals or order types (1976) (5)
The ANTI-order and the fixed point property for caccc posets (1997) (4)
A problem on well ordered sets (1969) (4)
The erdös-dushnik-miller theorem for topological graphs and orders (1985) (4)
Changing the depth of an ordered set by decomposition (1985) (4)
A Theorem in Transversal Theory (1973) (4)
On a Conjecture of Rödl and Voigt (1994) (3)
A compactness theorem for perfect matchings in matroids (1987) (3)
Isomorphic ANTI-cores of caccc posets (1997) (3)
Independent Transversals for Countable Set Systems (1975) (3)
Recent Results on the Cofinality of Ordered Sets (1984) (3)
Graphs defined by coverings of a set (1968) (3)
Some theorems for scattered ordered sets (1971) (3)
On representing sets of an almost disjoint family of sets (1987) (2)
A theorem of the transversal theory for matroids of finite character (1978) (2)
GENERALIZATIONS OF A LEMMA OF FOLKMAN (1970) (2)
Bankruptcy and business failure in the construction industry. (1987) (2)
Corrigendum: ``A theorem in the partition calculus'' (Canad. Math. Bull. {f 15} (1972), 501--505) (1974) (1)
TRANSVERSALS OF INFINITE SET SYSTEMS (1979) (1)
Selectivity and Weakly Compact Cardinals (1982) (1)
PARTITION RELATIONS FOR q,,-SETS (1)
Infinite friendship graphs with infinite parameters (1991) (1)
Problems for Solution: 4523-4527 (1953) (1)
Hadamard's Three Circles Theorem (1968) (1)
Dilworth's Decomposition Theorem in the Infinite Case (1990) (1)
Treatment of schizophrenia. Review should have paid more attention to psychosocial interventions. (2000) (1)
Isomorphic ANTI-cores of caccc posets - an improvement (1998) (1)
Partition Relations for -q, and for ,~ 0 . Saturated Models (1972) (1)
A TREE-ARROWING GRAPH (1997) (0)
On a conjecture of Conway (1966) (0)
Advanced Problems: 5590-5599 (1968) (0)
Infinite Sets and Infinite Graphs (1985) (0)
Lectures on the marriage theorem of aharoni, nash-williams and shelah (1984) (0)
ERIC CHARLES MILNER (0)
On Complementary Initial and Final Sections of Simply Ordered Sets (1967) (0)
to Chain Complete Posets Antichain (1995) (0)
Ordered Graphs Without Infinite Paths (1990) (0)
ERIC CHARLES MILNER (0)
On the Decomposition of Partially Ordered Sets into Directed Sets (1982) (0)
Advanced Problems: 5651-5657 (1969) (0)
Remark on a Theorem of Rado (1969) (0)
Characterization of an antigen of Neisseria gonorrhoeae (1976) (0)

This paper list is powered by the following services:

Other Resources About Eric Charles Milner

en.wikipedia.org

What Schools Are Affiliated With Eric Charles Milner?

Eric Charles Milner is affiliated with the following schools: