300:
and became one of the three faculty members in the newly formed
Department of Combinatorics and Optimization there. In 1972, he returned to Aberdeen as Professor of Pure Mathematics, but stayed only briefly, moving to the
289:; all three of Wylie, Rees, and Steenrod are listed as the supervisors of his Ph.D. dissertation. He finished his dissertation in 1958, but before doing so he returned to Britain as an assistant lecturer at the
588:
563:
568:
558:
573:
578:
435:
593:
270:
583:
384:
247:
528:
325:
278:
239:
172:
423:
415:
368:
229:
553:
488:
332:. A conference in his honor was held on his retirement in 1996, the proceedings of which were published as a
266:
208:(19 December 1932 – 20 January 2001) was a British mathematician. His research interest was in the field of
95:
407:
297:
290:
136:
132:
345:
302:
296:
He remained in
Aberdeen for ten years, during which time he was twice promoted. In 1967 he moved to the
140:
105:
336:. The 18th British Combinatorial Conference, held in Sussex in July 2001, was dedicated to his memory.
548:
543:
379:
problems on infinite graphs; the latter paper included an important recurrence criterion for general
328:
in 1969. In 1994, the
University of Waterloo gave him an honorary doctorate for his contributions to
282:
243:
209:
190:
182:
258:. A biographer has said that Oldaker was a formative influence on Nash-Williams. He then attended
17:
352:
186:
372:
364:
313:
163:
83:
387:
to random walks. His dissertation, which he finished in 1958, concerned generalizations of
286:
255:
225:
537:
360:
329:
380:
306:
259:
213:
419:
411:
399:
376:
333:
274:
168:
122:
395:
388:
356:
273:
in 1953, he remained there for his graduate studies, under the supervision of
234:
524:
466:
371:, and infinite graphs." In his first papers Nash-Williams considered the
403:
64:
394:
Welsh writes that his subsequent work defining and characterizing the
251:
147:
383:, and was also the first to apply electrical network techniques of
402:) has "had a huge impact," in part because of its implications in
205:
39:
312:
He retired in 1996 and died on 20 January 2001, aged 68, in
309:, who had earlier been one of his dissertation examiners.
351:
Hilton writes that "Themes running through his papers are
501:
Hilton, A. J. W. (2001), "Crispin St J A Nash-Williams",
398:
of graphs (discovered in parallel and independently by
178:
162:
146:
128:
118:
101:
91:
72:
46:
34:
265:After studying mathematics as an undergraduate at
491:from the MacTutor history of mathematics archive.
473:, Vol. 35, Issue 6, November 2003, Pages 829–844
281:. He then continued his education for a year at
224:Nash-Williams was born on 19 December 1932 in
153:Decomposition of Graphs into Infinite Chains
8:
589:Academic staff of the University of Waterloo
467:"Crispin St J. A. Nash-Williams (1932–2001)"
471:Bulletin of the London Mathematical Society
484:
482:
31:
246:. As a small boy, Nash-Williams attended
242:, and his mother had studied classics at
422:. He also gave a short elegant proof of
564:Academics of the University of Aberdeen
461:
459:
457:
455:
453:
451:
447:
418:for infinite graphs, and the theory of
569:Academics of the University of Reading
436:List of University of Waterloo people
233:
7:
559:20th-century British mathematicians
406:theory. Nash-Williams also studied
238:Williams), was an archaeologist at
203:Crispin St John Alvah Nash-Williams
51:Crispin St John Alvah Nash-Williams
25:
574:Alumni of Trinity Hall, Cambridge
316:, where his brother was rector.
579:People educated at Rugby School
18:Crispin St. J. A. Nash-Williams
248:Christ Church Cathedral School
1:
529:Mathematics Genealogy Project
305:in 1975. There he succeeded
594:Princeton University alumni
254:, which was then headed by
610:
326:Royal Society of Edinburgh
240:University College Cardiff
503:Bull. Inst. Combin. Appl.
416:reconstruction conjecture
230:Victor Erle Nash-Williams
196:
111:
410:, Hamiltonian cycles in
584:Scientists from Cardiff
489:Nash-Williams biography
475:(subscription required)
408:k-edge-connected graphs
269:, earning the title of
267:Trinity Hall, Cambridge
96:University of Cambridge
424:Kruskal's tree theorem
324:He was elected to the
298:University of Waterloo
291:University of Aberdeen
137:University of Waterloo
133:University of Aberdeen
525:Crispin Nash-Williams
391:to infinite graphs.
346:Nash-Williams theorem
303:University of Reading
262:until the age of 18.
141:University of Reading
106:Nash-Williams theorem
36:Crispin Nash-Williams
27:British mathematician
344:He is known for the
283:Princeton University
210:discrete mathematics
414:, versions of the
353:Hamiltonian cycles
320:Awards and honours
200:
199:
187:Alexander Dewdney
179:Doctoral students
113:Scientific career
16:(Redirected from
601:
512:
510:
498:
492:
486:
477:
476:
465:D. J. A. Welsh,
463:
365:marriage problem
314:Ascot, Berkshire
237:
164:Doctoral advisor
158:
84:Ascot, Berkshire
79:
61:19 December 1932
60:
58:
32:
21:
609:
608:
604:
603:
602:
600:
599:
598:
554:Graph theorists
534:
533:
521:
516:
515:
500:
499:
495:
487:
480:
474:
464:
449:
444:
432:
367:, detachments,
357:Eulerian graphs
342:
322:
287:Norman Steenrod
271:Senior Wrangler
256:Wilfrid Oldaker
222:
189:
185:
171:
156:
92:Alma mater
87:
81:
77:
76:20 January 2001
68:
62:
56:
54:
53:
52:
42:
37:
28:
23:
22:
15:
12:
11:
5:
607:
605:
597:
596:
591:
586:
581:
576:
571:
566:
561:
556:
551:
546:
536:
535:
532:
531:
520:
519:External links
517:
514:
513:
493:
478:
446:
445:
443:
440:
439:
438:
431:
428:
369:reconstruction
361:spanning trees
341:
338:
321:
318:
228:. His father,
226:Cardiff, Wales
221:
218:
198:
197:
194:
193:
191:Dragan Marušič
183:Václav Chvátal
180:
176:
175:
166:
160:
159:
150:
144:
143:
130:
126:
125:
120:
116:
115:
109:
108:
103:
102:Known for
99:
98:
93:
89:
88:
82:
80:(aged 68)
74:
70:
69:
63:
50:
48:
44:
43:
38:
35:
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
606:
595:
592:
590:
587:
585:
582:
580:
577:
575:
572:
570:
567:
565:
562:
560:
557:
555:
552:
550:
547:
545:
542:
541:
539:
530:
526:
523:
522:
518:
508:
504:
497:
494:
490:
485:
483:
479:
472:
468:
462:
460:
458:
456:
454:
452:
448:
441:
437:
434:
433:
429:
427:
425:
421:
417:
413:
409:
405:
401:
397:
392:
390:
386:
382:
381:Markov chains
378:
374:
373:knight's tour
370:
366:
362:
358:
354:
349:
347:
340:Contributions
339:
337:
335:
331:
330:combinatorics
327:
319:
317:
315:
310:
308:
304:
299:
294:
292:
288:
284:
280:
276:
272:
268:
263:
261:
257:
253:
249:
245:
241:
236:
231:
227:
219:
217:
215:
212:, especially
211:
207:
204:
195:
192:
188:
184:
181:
177:
174:
170:
167:
165:
161:
154:
151:
149:
145:
142:
138:
134:
131:
127:
124:
121:
117:
114:
110:
107:
104:
100:
97:
94:
90:
85:
75:
71:
66:
49:
45:
41:
33:
30:
19:
506:
502:
496:
470:
420:quasi-orders
412:dense graphs
393:
350:
343:
323:
311:
307:Richard Rado
295:
264:
260:Rugby School
223:
214:graph theory
202:
201:
152:
129:Institutions
112:
78:(2001-01-20)
29:
549:2001 deaths
544:1932 births
400:W. T. Tutte
389:Euler tours
377:random walk
334:festschrift
275:Shaun Wylie
169:Shaun Wylie
123:Mathematics
538:Categories
442:References
396:arboricity
279:David Rees
173:David Rees
57:1932-12-19
220:Biography
86:, England
430:See also
385:Rayleigh
527:at the
509:: 11–12
404:matroid
285:, with
67:, Wales
65:Cardiff
363:, the
252:Oxford
244:Oxford
157:(1959)
155:
148:Thesis
119:Fields
375:and
277:and
206:FRSE
73:Died
47:Born
40:FRSE
469:in
348:.
293:.
250:in
540::
507:33
505:,
481:^
450:^
426:.
359:,
355:,
235:né
216:.
139:,
135:,
511:.
232:(
59:)
55:(
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.