John Adrian Bondy

Last updated

John Adrian Bondy
Born1944
London, England
NationalityBritish, Canadian
Alma mater University of Oxford
OccupationProfessor
Known for Bondy's theorem
Bondy–Chvátal theorem
Scientific career
Fields
Institutions
Thesis Some uniqueness theorems in graph theory  (1968)
Doctoral advisor Dominic Welsh [1]

John Adrian Bondy (born 1944 in London) is a retired English mathematician, known for his work in combinatorics and graph theory.

Contents

Career

Bondy received his Ph.D. in graph theory from the University of Oxford in 1969. His advisor was Dominic Welsh. [1] Between 1969 and 1994, Bondy was Professor of Graph Theory at the University of Waterloo in Canada, and then, until his retirement, at Université Lyon 1 in France. [2] From 1976, he was managing editor, and, between 1979 and 2004, co-editor-in-chief (together with U. S. R. Murty) of Journal of Combinatorial Theory, Series B. [3] Throughout his career, Bondy has (co-)authored over 100 publications [2] [4] with 51 co-authors, [5] including the widely influential textbook Graph Theory with Applications (with U. S. R. Murty), and supervised 12 Ph.D. students. [1] His Erdős number is 1. [6]

Bondy was dismissed from his tenured position at the University of Waterloo in 1995, after 25 years in which he had been a major contributor to the renown of the University's Department of Combinatorics and Optimization. [7] The reasons for his dismissal centered on "Bondy's acceptance of a teaching post in France, and the acceptability of someone who is on UW's faculty payroll holding a full-time job elsewhere." [8] Protesting the decision, Paul Erdős returned his honorary doctorate to the University of Waterloo, [9] and Vašek Chvátal resigned from his position of Adjunct Professor at the Department of Combinatorics and Optimization. [10]

Personal life

Bondy has a passion for photography, having taken pictures since his childhood. In the 1980s, he regularly exhibited his work, most notably at the Kitchener-Waterloo Art Gallery in Kitchener, Ontario. In 2010, Bondy founded the non-profit association Mind's Eye [11] with the aim "to reflect upon the conceptual links between mathematics and photography." [12] In 2012, he opened a photo gallery with the same name on the Rue Saint-Jacques, Paris. Between 2012 and 2022, Mind's Eye / Galerie Adrian Bondy has hosted 42 exhibitions with works of 27 artists, including John Claridge and Jean Dréville. [13]

Selected publications

See also

Notes

  1. 1 2 3 John Adrian Bondy at the Mathematics Genealogy Project
  2. 1 2 Charbit, Pierre; Havet, Frédéric (2014). "A conference in Honor of Adrian Bondy for his 70th Birthday". Archived from the original on 17 January 2022. Retrieved 18 September 2022.
  3. ↑ Cunningham et al. (2004)
  4. ↑ "MR: Bondy, John Adrian - 39150" . Retrieved 19 September 2022.
  5. ↑ "MR: Co-authors of Bondy, John Adrian" . Retrieved 19 September 2022.
  6. ↑ Bondy & Erdős (1973)
  7. ↑ "UW Gazette - Arbitrator upholds math prof's dismissal". 2 October 1996. Archived from the original on 27 April 2012.
  8. ↑ "UW Gazette - Faculty dismissal discussed". 20 September 1995. Archived from the original on 23 November 2010.
  9. ↑ Erdős, Paul (4 June 1996). "Dear President Downey" (PDF). Archived from the original (PDF) on 15 October 2005. Retrieved 8 July 2014. With a heavy heart I feel that I have to sever my connections with the University of Waterloo, including resigning my honorary degree which I received from the University in 1981 (which caused me great pleasure). I was very upset by the treatment of Professor Adrian Bondy. I do not maintain that Professor Bondy was innocent, but in view of his accomplishments and distinguished services to the University I feel that 'justice should be tempered with mercy.'
  10. ↑ Chvátal, Václav (20 September 1995). "An Open Letter Submitted to the Gazette" (PDF). Archived from the original (PDF) on 8 August 2021. Retrieved 19 September 2022.
  11. ↑ "Mind's Eye". Archived from the original on 18 September 2022. Retrieved 19 September 2022.
  12. ↑ "Mind's Eye - Adrian Bondy". Archived from the original on 19 May 2021. Retrieved 19 September 2022.
  13. ↑ "Mind's Eye - Exhibitions". Archived from the original on 18 September 2022. Retrieved 19 September 2022.

Related Research Articles

<span class="mw-page-title-main">Ronald Graham</span> American mathematician (1935–2020)

Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.

<span class="mw-page-title-main">Erdős–Ko–Rado theorem</span> Upper bound on intersecting set families

In mathematics, the Erdős–Ko–Rado theorem limits the number of sets in a family of sets for which every two sets have at least one element in common. Paul Erdős, Chao Ko, and Richard Rado proved the theorem in 1938, but did not publish it until 1961. It is part of the field of combinatorics, and one of the central results of extremal set theory.

<span class="mw-page-title-main">Perfect graph</span> Graph with tight clique-coloring relation

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph. In all graphs, the chromatic number is greater than or equal to the size of the maximum clique, but they can be far apart. A graph is perfect when these numbers are equal, and remain equal after the deletion of arbitrary subsets of vertices.

<span class="mw-page-title-main">Paul Seymour (mathematician)</span> British mathematician

Paul D. Seymour is a British mathematician known for his work in discrete mathematics, especially graph theory. He was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website.

In mathematics, the Burr–Erdős conjecture was a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Stefan Burr and Paul Erdős, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs should grow linearly in the number of vertices of the graph.

<span class="mw-page-title-main">Ore's theorem</span>

Ore's theorem is a result in graph theory proved in 1960 by Norwegian mathematician Øystein Ore. It gives a sufficient condition for a graph to be Hamiltonian, essentially stating that a graph with sufficiently many edges must contain a Hamilton cycle. Specifically, the theorem considers the sum of the degrees of pairs of non-adjacent vertices: if every such pair has a sum that at least equals the total number of vertices in the graph, then the graph is Hamiltonian.

In mathematics, Bondy's theorem is a bound on the number of elements needed to distinguish the sets in a family of sets from each other. It belongs to the field of combinatorics, and is named after John Adrian Bondy, who published it in 1972.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Grötzsch graph</span> Triangle-free graph requiring four colors

In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is named after German mathematician Herbert Grötzsch, who used it as an example in connection with his 1959 theorem that planar triangle-free graphs are 3-colorable.

<span class="mw-page-title-main">Václav Chvátal</span> Czech-Canadian mathematician

Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

The Journal of Combinatorial Theory, Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. Series A is concerned primarily with structures, designs, and applications of combinatorics. Series B is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as JCTA and JCTB.

<span class="mw-page-title-main">Hypohamiltonian graph</span> Type of graph in graph theory

In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.

<i>Discrete Mathematics</i> (journal) Academic journal

Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications. It was established in 1971 and is published by North-Holland Publishing Company. It publishes both short notes, full length contributions, as well as survey articles. In addition, the journal publishes a number of special issues each year dedicated to a particular topic. Although originally it published articles in French and German, it now allows only English language articles. The editor-in-chief is Douglas West.

<span class="mw-page-title-main">U. S. R. Murty</span>

Uppaluri Siva Ramachandra Murty, or U. S. R. Murty, is a Professor Emeritus of the Department of Combinatorics and Optimization, University of Waterloo.

<span class="mw-page-title-main">Meredith graph</span>

In the mathematical field of graph theory, the Meredith graph is a 4-regular undirected graph with 70 vertices and 140 edges discovered by Guy H. J. Meredith in 1973.

<span class="mw-page-title-main">Friendship graph</span> Graph of triangles with a shared vertex

In the mathematical field of graph theory, the friendship graphFn is a planar, undirected graph with 2n + 1 vertices and 3n edges.

Jon Hal Folkman was an American mathematician, a student of John Milnor, and a researcher at the RAND Corporation.

<span class="mw-page-title-main">Fleischner's theorem</span> Theorem on Hamiltonian graphs

In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if is a 2-vertex-connected graph, then the square of is Hamiltonian. It is named after Herbert Fleischner, who published its proof in 1974.

Hunter Snevily (1956–2013) was an American mathematician with expertise and contributions in Set theory, Graph theory, Discrete geometry, and Ramsey theory on the integers.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.