default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric C. Milner
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j15]Boyu Li, E. C. Milner:
Isomorphic ANTI-cores of caccc posets - an improvement. Discret. Math. 183(1-3): 213-221 (1998)- 1997
- [j14]Boyu Li, E. C. Milner:
The ANTI-order and the fixed point property for caccc posets. Discret. Math. 175(1-3): 197-209 (1997) - [j13]Boyu Li, E. C. Milner:
Isomorphic ANTI-cores of caccc posets. Discret. Math. 176(1-3): 185-195 (1997) - 1994
- [j12]E. C. Milner:
The use of elementary substructures in combinatorics. Discret. Math. 136(1-3): 243-252 (1994) - [j11]Péter Komjáth, E. C. Milner:
On a Conjecture of Rödl and Voigt. J. Comb. Theory B 61(2): 199-209 (1994) - [c1]V. K. Raj, R. V. Idate, A. W. Booth, M. Botlo, J. Dorenbosch, E. C. Milner, E. M. Wang:
Design of an ASIC to Implement a New Data Tranfer Protocol for High Energy Physics. ISCAS 1994: 39-42 - 1991
- [j10]E. C. Milner, Karel Prikry:
A partition relation for triples using a model of Todorcevic. Discret. Math. 95(1-3): 183-191 (1991) - [j9]Gena Hahn, Eric C. Milner, Robert E. Woodrow:
Infinite friendship graphs with infinite parameters. J. Comb. Theory B 52(1): 30-41 (1991) - 1990
- [j8]Ron Aharoni, E. C. Milner, Karel Prikry:
Unfriendly partitions of a graph. J. Comb. Theory B 50(1): 1-10 (1990)
1980 – 1989
- 1989
- [j7]Eric C. Milner, Robert E. Woodrow:
On directed graphs with an independent covering set. Graphs Comb. 5(1): 363-369 (1989) - 1988
- [j6]Péter Komjáth, E. C. Milner, Norbert Polat:
A compactness theorem for perfect matchings in matroids. J. Comb. Theory B 44(3): 253-262 (1988) - 1981
- [j5]E. C. Milner, Norbert Sauer:
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. Discret. Math. 35(1-3): 165-171 (1981)
1970 – 1979
- 1978
- [j4]Ervin Györi, Eric C. Milner:
A theorem of the transversal theory for matroids of finite character. Discret. Math. 23(3): 235-240 (1978) - 1975
- [j3]E. C. Milner:
Independent Transversals for Countable Set Systems. J. Comb. Theory A 19(2): 125-133 (1975) - 1974
- [j2]M. R. Damerell, E. C. Milner:
Necessary and Sufficient Conditions for Transversals of Countable Set Systems. J. Comb. Theory A 17(3): 350-374 (1974) - 1973
- [j1]Daniel J. Kleitman, E. C. Milner:
On the average size of the sets in a Sperner family. Discret. Math. 6(2): 141-147 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
