Skip to main content
\(\newcommand{\set}[1]{\{1,2,\dotsc,#1\,\}} \newcommand{\ints}{\mathbb{Z}} \newcommand{\posints}{\mathbb{N}} \newcommand{\rats}{\mathbb{Q}} \newcommand{\reals}{\mathbb{R}} \newcommand{\complexes}{\mathbb{C}} \newcommand{\twospace}{\mathbb{R}^2} \newcommand{\threepace}{\mathbb{R}^3} \newcommand{\dspace}{\mathbb{R}^d} \newcommand{\nni}{\mathbb{N}_0} \newcommand{\nonnegints}{\mathbb{N}_0} \newcommand{\dom}{\operatorname{dom}} \newcommand{\ran}{\operatorname{ran}} \newcommand{\prob}{\operatorname{prob}} \newcommand{\Prob}{\operatorname{Prob}} \newcommand{\height}{\operatorname{height}} \newcommand{\width}{\operatorname{width}} \newcommand{\length}{\operatorname{length}} \newcommand{\crit}{\operatorname{crit}} \newcommand{\inc}{\operatorname{inc}} \newcommand{\HP}{\mathbf{H_P}} \newcommand{\HCP}{\mathbf{H^c_P}} \newcommand{\GP}{\mathbf{G_P}} \newcommand{\GQ}{\mathbf{G_Q}} \newcommand{\AG}{\mathbf{A_G}} \newcommand{\GCP}{\mathbf{G^c_P}} \newcommand{\PXP}{\mathbf{P}=(X,P)} \newcommand{\QYQ}{\mathbf{Q}=(Y,Q)} \newcommand{\GVE}{\mathbf{G}=(V,E)} \newcommand{\HWF}{\mathbf{H}=(W,F)} \newcommand{\bfC}{\mathbf{C}} \newcommand{\bfG}{\mathbf{G}} \newcommand{\bfH}{\mathbf{H}} \newcommand{\bfF}{\mathbf{F}} \newcommand{\bfI}{\mathbf{I}} \newcommand{\bfK}{\mathbf{K}} \newcommand{\bfP}{\mathbf{P}} \newcommand{\bfQ}{\mathbf{Q}} \newcommand{\bfR}{\mathbf{R}} \newcommand{\bfS}{\mathbf{S}} \newcommand{\bfT}{\mathbf{T}} \newcommand{\bfNP}{\mathbf{NP}} \newcommand{\bftwo}{\mathbf{2}} \newcommand{\cgA}{\mathcal{A}} \newcommand{\cgB}{\mathcal{B}} \newcommand{\cgC}{\mathcal{C}} \newcommand{\cgD}{\mathcal{D}} \newcommand{\cgE}{\mathcal{E}} \newcommand{\cgF}{\mathcal{F}} \newcommand{\cgG}{\mathcal{G}} \newcommand{\cgM}{\mathcal{M}} \newcommand{\cgN}{\mathcal{N}} \newcommand{\cgP}{\mathcal{P}} \newcommand{\cgR}{\mathcal{R}} \newcommand{\cgS}{\mathcal{S}} \newcommand{\bfn}{\mathbf{n}} \newcommand{\bfm}{\mathbf{m}} \newcommand{\bfk}{\mathbf{k}} \newcommand{\bfs}{\mathbf{s}} \newcommand{\bijection}{\xrightarrow[\text{onto}]{\text{$1$--$1$}}} \newcommand{\injection}{\xrightarrow[]{\text{$1$--$1$}}} \newcommand{\surjection}{\xrightarrow[\text{onto}]{}} \newcommand{\nin}{\not\in} \newcommand{\prufer}{\mbox{prüfer}} \DeclareMathOperator{\fix}{fix} \DeclareMathOperator{\stab}{stab} \DeclareMathOperator{\var}{var} \newcommand{\inv}{^{-1}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \)

Author BiographyAbout William T. Trotter

William T. Trotter is a Professor in the School of Mathematics at Georgia Tech. He was first exposed to combinatorial mathematics through the 1971 Bowdoin Combinatorics Conference which featured an array of superstars of that era, including Gian Carlo Rota, Paul Erdős, Marshall Hall, Herb Ryzer, Herb Wilf, William Tutte, Ron Graham, Daniel Kleitman and Ray Fulkerson. Since that time, he has published more than 120 research papers on graph theory, discrete geometry, Ramsey theory, and extremal combinatorics. Perhaps his best known work is in the area of combinatorics and partially ordered sets, and his 1992 research monograph on this topic has been very influential. (He takes some pride in the fact that this monograph is still in print and copies are being sold in 2016.) He has more than 70 co-authors, but considers his extensive joint work with Graham Brightwell, Stefan Felsner, Peter Fishburn, Hal Kierstead and Endre Szemerèdi as representing his best work. His career includes invited presentations at more than 50 international conferences and more than 30 meetings of professional societies. He was the founding editor of the SIAM Journal on Discrete Mathematics and has served on the Editorial Board of Order since the journal was launched in 1984, and his service includes an eight year stint as Editor-in-Chief. Currently, he serves on the editorial boards of three other journals in combinatorial mathematics.

Still he has his quirks. First, he insists on being called “Tom”, as Thomas is his middle name, while continuing to sign as William T. Trotter. Second, he has invested time and energy serving five terms as department/school chair, one at Georgia Tech, two at Arizona State University and two at the University of South Carolina. In addition, he has served as a Vice Provost and as an Assistant Dean. Third, he is fascinated by computer operating systems and is always installing new ones. In one particular week, he put eleven different flavors of Linux on the same machine, interspersed with four complete installs of Windows 7. Incidentally, the entire process started and ended with Windows 7. Fourth, he likes to hit golf balls, not play golf, just hit balls. Without these diversions, he might even have had enough time to settle the Riemann hypothesis.

He has had eleven Ph.D. students, one of which is now his co-author on this text.