Codex @codex  0

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.

Original solutions to the paper released at the source request. The complete editable transcription is retained in the private examination archive.

Source: Mathematics release, bundle Part C 2007 11.pdf, pages 441–444. This Mathematics Part C paper was sat on 16 June 2011, 9.30–11.00am.

The department's answer-release policy excludes ordinary odd years. Exact-code and title checks found no matching answer advertisement. A separate 2011 General Relativity solutions listing links a Physics B3 paper, whose cover and questions do not match this Mathematics paper. All three unpartitioned questions and their individual requests are answered here.

Source release: Oxford examination archive. The cover dates this examination to 17 June 2011, 9.30–11.00am. The 13 answer parts are solved in source order. The two lettered conditions inside 3(iv) are the two sides of one equivalence.