Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Victor Bryant"'
Autor:
Victor Bryant, John Duncan
Publikováno v:
The Mathematical Gazette. 94:502-505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7596847aa65cdcdcf80bee3b6862e63
https://doi.org/10.1017/s0025557200001856
https://doi.org/10.1017/s0025557200001856
Autor:
Victor Bryant
Publikováno v:
The Mathematical Gazette. 83:394-399
At school I used to love the geometry of the circle, but in my own career I had little opportunity to teach it. Now in semi-retirement my work with Teasers in the Sunday Times brings me into contact with many entertaining aspects of mathematics, not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::265a25640768e0355f31b92b4244e99c
https://doi.org/10.2307/3620948
https://doi.org/10.2307/3620948
Autor:
Victor Bryant
Publikováno v:
The Mathematical Gazette. 80:25-30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5c0977f83fec20551905479fef50f97
https://doi.org/10.2307/3620324
https://doi.org/10.2307/3620324
Autor:
Victor Bryant
Publikováno v:
Combinatorics, Probability and Computing. 1:209-217
It is well known that a matroid is a transversal matroid if and only if it is a matching matroid (in the sense that it is the restriction of the matching structure of some graph to a subset of its vertices). A simple proof of that result is now known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d3b78eceeb1424c8433dce5b3511f0c
https://doi.org/10.1017/s0963548300000249
https://doi.org/10.1017/s0963548300000249
Autor:
Victor Bryant, Peter A. Brooksbank
Publikováno v:
European Journal of Combinatorics. 13:81-86
The Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it is applied to a weighting of the elements of a matroid, and then at each stage it chooses a heaviest independent set of its size: it is also capable of reachin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::879e6b1460191b591053fe3ccbf2053d
https://doi.org/10.1016/0195-6698(92)90039-3
https://doi.org/10.1016/0195-6698(92)90039-3
Autor:
Victor Bryant
Publikováno v:
Yet another introduction to analysis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a978a02084d957077a023a6c2daa953
https://doi.org/10.1017/cbo9781139172288.007
https://doi.org/10.1017/cbo9781139172288.007
Autor:
Victor Bryant
Publikováno v:
Discrete Mathematics. 158:279-281
A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem, usually dealt with in two cases, is in fact covered by one of the cases.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::230543fd7537a66a09cce9bc98c86ea5
https://doi.org/10.1016/0012-365x(95)00082-8
https://doi.org/10.1016/0012-365x(95)00082-8
Autor:
Victor Bryant
Publikováno v:
The Mathematical Gazette. 85:374-375
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::113c3eecfa5445150ae2fcf0e723c8c4
https://doi.org/10.2307/3622074
https://doi.org/10.2307/3622074
Autor:
Victor Bryant
Publikováno v:
Yet another introduction to analysis
Mathematics education in schools has seen a revolution in recent years. Students everywhere expect the subject to be well-motivated, relevant and practical. When such students reach higher education the traditional development of analysis, often rath
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f0a8e56f90dc910a32f91bc65df20bc
https://doi.org/10.1017/cbo9781139172288
https://doi.org/10.1017/cbo9781139172288
