View single | Maths Project Repository Database | Renewable Energy | MyQMUL

This database contains BSc, MSci and MSc projects offered by different supervisors. It can be searched/filtered in various ways to help find the best options for you.

The basic default search is based on titles; simply enter a word or topic which interests you in the "Search" box and click "Save Settings" to view the results.
Checking the "Advanced Search" box displays further search fields. In particular, to find projects appropriate to your programme, type "BSc", "MSci", or "MSc" in the "Level:" field. Again, the results will appear upon clicking "Save Settings".
You can change the sorting of the displayed list by clicking on the drop-down menus corresponding to the category and the order. By default, the sorting is by project title, in ascending order. Click "Save Settings" again to change the sorting.
Click on the title of a project to find details of prerequisites and reading material as well as a brief description. [You may need to look up some unfamiliar terms to get more of a sense of what is involved.] Note that if the project has "No" in the "Current Availability:" field, it is already taken or not being offered this academic year but may be available again in future years.
Each supervisor name links to a contact details webpage so you can arrange to discuss any projects you are interested in or even propose a related topic of your own.

Level:	MSci, MSc
Title:	Saturated graphs
Supervisor:	Dr Robert Johnson
Research Area:	Combinatorics
Description:	A graph G is H-saturated if it does not have H as a subgraph but the addition of any new edge to G creates a copy of H. The saturation number of H is the minimum number of edges an n vertex H-saturated graph can have. Results on the saturation number provide a counterpoint to the Turan type results of classical extremal graph theory. There are interesting results and questions on both the general kind of behaviour that the saturation number can exhibit, and its determination for particular graphs. There are many directions this project could take depending on the background and interests of the student.
Further Reading:	J. R. Faudree, R. J. Faudree, and R. Schmitt, A Survey of Minimum Saturated Graphs, The Electronic Journal of Combinatorics 18 (2011).
Key Modules:	MTH6109 Combinatorics (desirable)
Other Information:
Current Availability:	Yes