Eric C. Milner

Affiliations:
  • University of Calgary, Canada


According to our database1, Eric C. Milner authored at least 16 papers between 1973 and 1998.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1998
Isomorphic ANTI-cores of caccc posets - an improvement.
Discret. Math., 1998

1997
Isomorphic ANTI-cores of caccc posets.
Discret. Math., 1997

The ANTI-order and the fixed point property for caccc posets.
Discret. Math., 1997

1994
On a Conjecture of Rödl and Voigt.
J. Comb. Theory B, 1994

The use of elementary substructures in combinatorics.
Discret. Math., 1994

Design of an ASIC to Implement a New Data Tranfer Protocol for High Energy Physics.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

1991
Infinite friendship graphs with infinite parameters.
J. Comb. Theory B, 1991

A partition relation for triples using a model of Todorcevic.
Discret. Math., 1991

1990
Unfriendly partitions of a graph.
J. Comb. Theory B, 1990

1989
On directed graphs with an independent covering set.
Graphs Comb., 1989

1988
A compactness theorem for perfect matchings in matroids.
J. Comb. Theory B, 1988

1981
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma.
Discret. Math., 1981

1978
A theorem of the transversal theory for matroids of finite character.
Discret. Math., 1978

1975
Independent Transversals for Countable Set Systems.
J. Comb. Theory A, 1975

1974
Necessary and Sufficient Conditions for Transversals of Countable Set Systems.
J. Comb. Theory A, 1974

1973
On the average size of the sets in a Sperner family.
Discret. Math., 1973


  Loading...