default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDwight Duffus
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Miguel Couceiro
, Dwight Duffus:
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. Order 41(1): 1-14 (2024)
2010 – 2019
- 2019
- [j30]Dwight Duffus, David M. Howard, Imre Leader:
The width of downsets. Eur. J. Comb. 79: 46-59 (2019) - 2018
- [j29]Dwight Duffus, Bill Kay, Vojtech Rödl:
The Minimum Number of Edges in Uniform Hypergraphs with Property O. Comb. Probab. Comput. 27(4): 531-538 (2018) - 2015
- [j28]Dwight Duffus, Kyle Thayer:
Symmetric Chain Decompositions of Quotients by Wreath Products. Electron. J. Comb. 22(2): 2 (2015) - 2013
- [j27]Dwight Duffus, Claude Laflamme, Maurice Pouzet, Robert E. Woodrow:
Convex sublattices of a lattice and a fixed point property. Contributions Discret. Math. 8(1) (2013) - [j26]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in the covering graph of the cube. Discret. Appl. Math. 161(9): 1203-1208 (2013) - 2012
- [j25]Dwight Duffus, Jeremy McKibben-Sanders, Kyle Thayer:
Some Quotients of Chain Products are Symmetric Chain Orders. Electron. J. Comb. 19(2): 46 (2012) - 2011
- [j24]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in bipartite graphs obtained from Boolean lattices. Eur. J. Comb. 32(1): 1-9 (2011) - 2010
- [j23]Dwight Duffus, Bill Sands:
On the size of maximal chains and the number of pairwise disjoint maximal antichains. Discret. Math. 310(21): 2883-2889 (2010) - [j22]Dwight Duffus, Nejib Zaguia:
The 1st International Conference on Relations, Orders and Graphs - ROGICS 2008. Order 27(3): 259-260 (2010)
2000 – 2009
- 2005
- [j21]Dwight Duffus, Bill Sands:
Splitting Numbers of Grids. Electron. J. Comb. 12 (2005) - [j20]Dwight Duffus, Norbert W. Sauer:
Chromatic numbers and products. Discret. Math. 300(1-3): 91-99 (2005) - 2003
- [j19]Dwight Duffus:
Obituary: Ivan Rival. Order 20(3): 173-183 (2003) - 2002
- [j18]Dwight Duffus, Ted Goddard:
Some progress on the Aharoni-Korman conjecture. Discret. Math. 250(1-3): 79-91 (2002) - 2000
- [j17]Dwight Duffus, Ted Goddard:
An Ordered Set of Size aleph1 with Monochromatic Maximal Chains. Order 17(3): 227-238 (2000)
1990 – 1999
- 1999
- [j16]Dwight Duffus, Bill Sands:
An inequality for the sizes of prime filters of finite distributive lattices. Discret. Math. 201(1-3): 89-99 (1999) - 1998
- [j15]Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets. Comb. Probab. Comput. 7(1): 33-46 (1998) - 1996
- [j14]Dwight Duffus, Norbert Sauer:
Lattices arising in categorial investigations of Hedetniemi's conjecture. Discret. Math. 152(1-3): 125-139 (1996) - 1995
- [j13]Dwight Duffus, Hanno Lefmann, Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r). Discret. Math. 137(1-3): 177-187 (1995) - [j12]Dwight Duffus, Mark Ginn, Vojtech Rödl:
On the Computational Complexity of Ordered Subgraph Recognition. Random Struct. Algorithms 7(3): 223-268 (1995) - 1991
- [j11]Martin Aigner, Dwight Duffus, Daniel J. Kleitman:
Partitioning a power set into union-free classes. Discret. Math. 88(2-3): 113-119 (1991) - [j10]Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow:
Two-colouring all two-element maximal antichains. J. Comb. Theory A 57(1): 109-116 (1991) - [j9]Dwight Duffus, Hal A. Kierstead, William T. Trotter:
Fibres and ordered set coloring. J. Comb. Theory A 58(1): 158-164 (1991) - 1990
- [j8]Dwight Duffus, Bill Sands, Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices. SIAM J. Discret. Math. 3(2): 197-205 (1990)
1980 – 1989
- 1985
- [j7]Dwight Duffus, Bill Sands, Robert E. Woodrow:
On the chromatic number of the product of graphs. J. Graph Theory 9(4): 487-495 (1985) - 1982
- [j6]Dwight Duffus:
Matching in Modular Lattices. J. Comb. Theory A 32(3): 303-314 (1982) - 1981
- [j5]Dwight Duffus, Maurice Pouzet, Ivan Rival:
Complete ordered sets with no infinite antichains. Discret. Math. 35(1-3): 39-52 (1981) - [j4]Dwight Duffus, Ivan Rival:
A structure theory for ordered sets. Discret. Math. 35(1-3): 53-118 (1981) - 1980
- [j3]Dwight Duffus, Ivan Rival, Miklós Simonovits:
Spanning retracts of a partially ordered set. Discret. Math. 32(1): 1-7 (1980)
1970 – 1979
- 1978
- [j2]Dwight Duffus, Ivan Rival:
Separable Subsets of a Finite Lattice. J. Comb. Theory A 25(2): 188-192 (1978) - 1977
- [j1]Dwight Duffus, Ivan Rival:
Path length in the covering graph of a lattice. Discret. Math. 19(2): 139-158 (1977)
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-10-07 21:11 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:
