25:
256:
552:
547:
53:
33:
562:
154:
in which he has produced over a hundred papers and publications. He has also spoken at over a hundred and fifty guest lectures around the world.
572:
567:
520:
375:
126:
107:
284:
79:
178:
on an honor scholarship, with a double major in mathematics and physics. He then took a graduate fellowship in physics at the
321:
182:, but after one year of the program, switched to mathematics; in 1966 he was awarded his Ph.D., with a thesis supervised by
409:
86:
57:
49:
506:
38:
193:
from 1966 to 1968, Plummer took an assistant professorship in the recently formed
Department of Computer Science at
93:
42:
557:
194:
75:
457:
236:
175:
542:
179:
426:
359:
260:
217:
259:. In 1991, he shared the Niveau Prize of the Publishing House of the Hungarian Academy of Sciences with
225:
201:
147:
221:
577:
484:
466:
213:
100:
64:
516:
510:
452:
371:
240:
476:
330:
293:
232:
385:
344:
307:
381:
340:
303:
190:
502:
171:
298:
536:
335:
235:, and for being one of several mathematicians to conjecture the result now known as
488:
212:
Among his other contributions to graph theory, Plummer is responsible for defining
183:
151:
455:; Norine, Serguei (2011), "Exponentially many perfect matchings in cubic graphs",
244:
228:
170:
where he attended Lima
Central High School, graduating in 1955. He then went to
163:
143:
480:
167:
405:
471:
429:, Summer China Program, retrieved 2019-07-20. (last updated 2011)
282:
Plummer, Michael D. (1970), "Some covering concepts in graphs",
370:, Annals of Discrete Mathematics, vol. 29, North-Holland,
63:
from the article and its talk page, especially if potentially
18:
451:
Esperet, Louis; Kardoš, František; King, Andrew D.;
204:, and remained there until his retirement in 2008.
200:In 1970 he joined the Department of Mathematics at
257:Institute of Combinatorics and its Applications
197:which was part of the School of Engineering.
8:
56:about living persons that is unsourced or
470:
334:
297:
127:Learn how and when to remove this message
515:(5th ed.), CRC Press, p. 139,
220:the now-proven conjecture (generalizing
438:
398:
255:Plummer is a Foundation Fellow of the
7:
553:21st-century American mathematicians
548:20th-century American mathematicians
422:
420:
418:
166:on August 31, 1937. He grew up in
14:
563:City College of New York faculty
23:
285:Journal of Combinatorial Theory
189:After postdoctoral studies at
1:
573:University of Michigan alumni
568:Vanderbilt University faculty
410:Mathematics Genealogy Project
299:10.1016/S0021-9800(70)80011-4
231:has an exponential number of
336:10.1016/0012-365X(80)90037-0
34:biography of a living person
315:Plummer, M. D. (1980), "On
150:. His field of work is in
61:must be removed immediately
594:
481:10.1016/j.aim.2011.03.015
142:(born 1937) is a retired
195:City College of New York
458:Advances in Mathematics
176:Crawfordsville, Indiana
180:University of Michigan
48:Please help by adding
16:American mathematician
512:Graphs & Digraphs
319:-extendable graphs",
271:Selected publications
202:Vanderbilt University
148:Vanderbilt University
140:Michael David Plummer
322:Discrete Mathematics
237:Fleischner's theorem
162:Plummer was born in
158:Education and career
76:"Michael D. Plummer"
54:Contentious material
214:well-covered graphs
505:; Lesniak, Linda;
406:Michael D. Plummer
241:Hamiltonian cycles
222:Petersen's theorem
216:, for making with
251:Awards and honors
245:squares of graphs
233:perfect matchings
137:
136:
129:
111:
37:needs additional
585:
527:
525:
499:
493:
491:
474:
465:(4): 1646–1664,
448:
442:
436:
430:
427:Curriculum vitae
424:
413:
403:
388:
347:
338:
310:
301:
263:for their book,
132:
125:
121:
118:
112:
110:
69:
50:reliable sources
27:
26:
19:
593:
592:
588:
587:
586:
584:
583:
582:
558:Graph theorists
533:
532:
531:
530:
523:
503:Chartrand, Gary
501:
500:
496:
450:
449:
445:
437:
433:
425:
416:
404:
400:
395:
378:
368:Matching Theory
358:
314:
281:
276:Research papers
273:
265:Matching Theory
253:
210:
191:Yale University
160:
146:professor from
133:
122:
116:
113:
70:
68:
47:
28:
24:
17:
12:
11:
5:
591:
589:
581:
580:
575:
570:
565:
560:
555:
550:
545:
535:
534:
529:
528:
521:
494:
443:
439:Plummer (1970)
431:
414:
397:
396:
394:
391:
390:
389:
376:
364:Plummer, M. D.
360:Lovász, László
355:
354:
350:
349:
329:(2): 201–210,
312:
278:
277:
272:
269:
252:
249:
209:
206:
172:Wabash College
159:
156:
135:
134:
58:poorly sourced
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
590:
579:
576:
574:
571:
569:
566:
564:
561:
559:
556:
554:
551:
549:
546:
544:
543:Living people
541:
540:
538:
524:
522:9781439826270
518:
514:
513:
508:
504:
498:
495:
490:
486:
482:
478:
473:
468:
464:
460:
459:
454:
447:
444:
440:
435:
432:
428:
423:
421:
419:
415:
411:
407:
402:
399:
392:
387:
383:
379:
377:0-444-87916-1
373:
369:
365:
361:
357:
356:
352:
351:
346:
342:
337:
332:
328:
324:
323:
318:
313:
309:
305:
300:
295:
291:
287:
286:
280:
279:
275:
274:
270:
268:
266:
262:
261:László Lovász
258:
250:
248:
246:
242:
238:
234:
230:
227:
224:) that every
223:
219:
218:László Lovász
215:
208:Contributions
207:
205:
203:
198:
196:
192:
187:
185:
181:
177:
173:
169:
165:
157:
155:
153:
149:
145:
141:
131:
128:
120:
109:
106:
102:
99:
95:
92:
88:
85:
81:
78: –
77:
73:
72:Find sources:
66:
62:
59:
55:
51:
45:
44:
40:
35:
30:
21:
20:
511:
497:
462:
456:
453:Kráľ, Daniel
446:
434:
401:
367:
363:
326:
320:
316:
289:
283:
264:
254:
211:
199:
188:
184:Frank Harary
161:
152:graph theory
139:
138:
123:
114:
104:
97:
90:
83:
71:
60:
43:verification
36:
578:1937 births
507:Zhang, Ping
229:cubic graph
164:Akron, Ohio
144:mathematics
537:Categories
393:References
226:bridgeless
168:Lima, Ohio
117:April 2013
87:newspapers
472:1012.2878
292:: 91–98,
39:citations
509:(2010),
366:(1986),
65:libelous
489:4401537
408:at the
386:0859549
345:0583220
308:0289347
101:scholar
519:
487:
384:
374:
343:
306:
103:
96:
89:
82:
74:
485:S2CID
467:arXiv
353:Books
108:JSTOR
94:books
32:This
517:ISBN
372:ISBN
243:in
80:news
41:for
477:doi
463:227
331:doi
294:doi
239:on
174:in
539::
483:,
475:,
461:,
417:^
382:MR
380:,
362:;
341:MR
339:,
327:31
325:,
304:MR
302:,
288:,
267:.
247:.
186:.
52:.
526:.
492:.
479::
469::
441:.
412:.
348:.
333::
317:n
311:.
296::
290:8
130:)
124:(
119:)
115:(
105:·
98:·
91:·
84:·
67:.
46:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.