Dwight Duffus

According to our database1, Dwight Duffus authored at least 30 papers between 1977 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
The width of downsets.
Eur. J. Comb., 2019

2018
The Minimum Number of Edges in Uniform Hypergraphs with Property O.
Comb. Probab. Comput., 2018

2015
Symmetric Chain Decompositions of Quotients by Wreath Products.
Electron. J. Comb., 2015

2013
Maximal independent sets in the covering graph of the cube.
Discret. Appl. Math., 2013

Convex sublattices of a lattice and a fixed point property.
Contributions Discret. Math., 2013

2012
Some Quotients of Chain Products are Symmetric Chain Orders.
Electron. J. Comb., 2012

2011
Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb., 2011

2010
The 1st International Conference on Relations, Orders and Graphs - ROGICS 2008.
Order, 2010

On the size of maximal chains and the number of pairwise disjoint maximal antichains.
Discret. Math., 2010

2005
Chromatic numbers and products.
Discret. Math., 2005

Splitting Numbers of Grids.
Electron. J. Comb., 2005

2003
<i>Obituary</i>: Ivan Rival.
Order, 2003

2002
Some progress on the Aharoni-Korman conjecture.
Discret. Math., 2002

2000
An Ordered Set of Size aleph<sup>1</sup> with Monochromatic Maximal Chains.
Order, 2000

1999
An inequality for the sizes of prime filters of finite distributive lattices.
Discret. Math., 1999

1998
Endomorphisms of Partially Ordered Sets.
Comb. Probab. Comput., 1998

1996
Lattices arising in categorial investigations of Hedetniemi's conjecture.
Discret. Math., 1996

1995
On the Computational Complexity of Ordered Subgraph Recognition.
Random Struct. Algorithms, 1995

Shift graphs and lower bounds on Ramsey numbers r<sub>k</sub>(l; r).
Discret. Math., 1995

1991
Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A, 1991

Fibres and ordered set coloring.
J. Comb. Theory, Ser. A, 1991

Partitioning a power set into union-free classes.
Discret. Math., 1991

1990
Maximal Chains and Antichains in Boolean Lattices.
SIAM J. Discret. Math., 1990

1985
On the chromatic number of the product of graphs.
J. Graph Theory, 1985

1982
Matching in Modular Lattices.
J. Comb. Theory, Ser. A, 1982

1981
A structure theory for ordered sets.
Discret. Math., 1981

Complete ordered sets with no infinite antichains.
Discret. Math., 1981

1980
Spanning retracts of a partially ordered set.
Discret. Math., 1980

1978
Separable Subsets of a Finite Lattice.
J. Comb. Theory, Ser. A, 1978

1977
Path length in the covering graph of a lattice.
Discret. Math., 1977


  Loading...