Source: Mathematics release. This five-page Mathematics Part C paper is dated 2 June 2008. Bundle Part C 2007 11.pdf, pages 112–116.
Bounded exact-paper checks found no matching advertisement of worked answers. Both printed halves and all question parts, including the common definition before (1)(a), are covered. Full editable source statements remain in the private archive.
Source: Mathematics release, bundle Part C 2007 11.pdf, pages 309–312. This combined paper was sat on 8 June 2010, 2.30–5.30pm, for Mathematics, Mathematics and Computer Science, and Mathematics and Philosophy Part C.
Bounded exact-paper availability checks found no matching answer advertisement. The department's general even-year policy states coverage back to at least 2016 and does not itself establish 2010 coverage. Both printed sections, all thirteen source leaves, and their unnumbered requests are answered below.
Source release: Oxford examination archive, member FOI-20210708-1 - Data/4323.pdf. The cover dates the examination to 19 June 2014 and prints formal paper code 4323.
Answer availability checked on 28 October 2026: a bounded search of official Oxford sources found no advertisement covering complete or selected-part answers for this exact 2014 paper. The department's general policy describes even-year solutions dating back to at least 2016; that statement does not identify coverage of this earlier paper.[ref]
Source release: Oxford examination archive, member FOI-20210708-1 - Data/a13756w1 (4).pdf. The cover dates the examination to 18 June 2015.
Answer availability checked on 28 October 2026: a bounded search of official Oxford sources found no advertisement of complete or selected-part solutions for this exact paper. Oxford's stated policy excludes odd examination years apart from the exceptional release for 2019.[ref]
Source paper: released examination archive, member 2015/T/a13756w1.pdf. The cover dates this paper to 2016-06-21.
Solutions already advertised by Oxford. The Mathematical Institute releases examination solutions for even-numbered years dating back to at least 2016; this paper is skipped here. [ref]
Source paper: released examination archive, member 2016/T/a13756w1.pdf. The printed cover dates the examination to 20 June 2017.
Source release: Oxford examination archive. The cover dates this examination to 9 June 2011, 9.30–11.00am. All 12 answer parts are solved below. The two numbered conditions inside 3(c) are hypotheses of its single optimality proof.
Source paper: FOI request thread. The intact cover identifies Graph Theory, C11.1a, Friday 10 June 2011, 9.30am to 11.00am. This three-page paper occupies original private-bundle pages 466–468. Its three questions match Section A of the separately issued combined Graph Theory and Probabilistic Combinatorics paper, C11.1; the same solution bodies are reused here under this paper's own question tree.
Graph Theory and Probabilistic Combinatorics, Mathematics Part C and Mathematics and Statistics Part C; Friday 1 June 2007, 9.30am–12.30pm. The full five-page source and both sections are privately transcribed from original Part C bundle pages 81–85, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check.
Graph Theory and Probabilistic Combinatorics, Mathematics Part C and the corresponding joint schools; Friday 30 May 2008, 9.30am–12.30pm. The full six-page source, including both sections, its intact cover and the printed illustration, is privately transcribed from original Part C bundle pages 190–195, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check.
Graph Theory and Probabilistic Combinatorics, Trinity Term; Friday 5 June 2009, 9.30am–12.30pm. This combined Part C paper was shared by Mathematics, Mathematics and Computer Science, and Mathematics and Statistics. Both sections and all six questions are covered below; the complete four-page source is retained in a private editable transcription. The source was supplied through the past-papers disclosure, in original Part C bundle pages 286–289. No exact worked-answer advertisement was found in the bounded check.
Graph Theory and Probabilistic Combinatorics, Friday 4 June 2010, 9.30am–12.30pm. This combined Part C paper was supplied through the past-papers disclosure, in original Part C bundle pages 378–381. Both printed sections are covered here; the private editable transcription retains all four pages and the complete cover. No exact worked-answer advertisement was found in the bounded availability check.
Source paper: FOI request thread. The intact cover identifies Graph Theory and Probabilistic Combinatorics, C11.1, Friday 10 June 2011, 9.30am to 12.30pm. The private bundle contains this five-page paper at original pages 461–465. Its Graph Theory questions are also issued separately as C11.1a, with a distinct cover and formal identifiers.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact