Faculty
|
Dwight Duffus
Professor, Goodrich C. White Professor
|
Office hours
- Monday: 10:30am - 12:00pm
- Wednesday: 2:30pm - 4:00pm
- and by appointment
Teaching:
Spring 2010
- MATH 116 (000): Life Sciences Calculus II, MWF 9:35am - 10:25am
- MATH 116 (LA1): Life Sciences Calculus II, M 3:00pm - 3:50pm
- MATH 116 (LC1): Life Sciences Calculus II, W 8:30am - 9:20am
- MATH 221 (002): Linear Algebra, MWF 10:40am - 11:30am
Research
- Ordered combinatorial and algebraic structures
Recent publications
- Retracts of posets: the chain-gap property and the selection property are independent, Algebra Universalis, (Oct 2008) (with C. Laflamme and M. Pouzet)
- Antichains in the homomorphism order of graphs, Comment. Math. Univ. Carolin. 48 (2007) 571 - 583 (with P.L. Erdos, J. Nesetril, and L. Soukup)
- Chromatic numbers and homomorphisms of large girth hypergraphs, Topics in Discrete Mathematics, Algorithms and Combinatorics 26 (2006) 455-471 (with V. Rodl, B. Sands, and N. Sauer)
- Splitting numbers of grids, Electronic Journal of Combinatorics 12 (2005) R17: 31 pp. (with B. Sands)
- Chromatic numbers and graph products, Discrete Mathematics 300 (2005) 91-99 (with N. Sauer)
- Distributive lattices with the splitting property, Algebra Universalis 49 (2003) 13-33 (with B. Sands)
- Some progress on the Aharoni-Korman conjecture, Discrete Mathematics 250 (2002) 79-91 (with T. Goddard)
- Minimum-sized fibres in distributive lattices, J Austral Math Soc 70 (2001) 337-350 (with B. Sands)
- An ordered set of size aleph 1 with monochromatic maximal chains, Order 17 (2000) 227-238 (with T. Goddard)
- An inequality for the sizes of prime filters of finite distributive lattices, Discrete Math 201 (1999) 89-99 (with B. Sands)
- Biased positional games on hypergraphs, Studia Sci Math Hung 34 (1998) 141-149 (with T. Luczak and V. Rodl)
- Endomorphisms of partially ordered sets, Combinatorics, Probability and Computing 7 (1998) 33-46 (with T. Luczak, V. Rodl and A. Rucinski)
- The complexity of the fixed point property, Order 13 (1996), 209-218 (with T. Goddard)
- On the computational complexity of ordered subgraph recognition, RS&A 7 (1995), 223-268 (with M. Ginn and V. Rodl)
Education
- Ph.D. (1978) University of Calgary
- M.Sc. (1976) University of Calgary
- B.A.(Hon.) (1974) University of Regina
Activities
- Editor: ORDER
- Referee: Discrete Mathematics, SIAM Journal of Discrete Mathematics, ORDER
- Member: SIAM [DMAG], AMS, MAA
|
