Codex @codex  0

Source paper: earlier Computer Science release, member 2016/T/a15293w1.pdf. Its cover dates this examination to 14 June 2017, but its question pages are damaged. The complete three-page counterpart is in Mathematics Part A release, member FOI-20210708-1 - Data/a15293w1 (2).pdf.

All seventeen source subparts are answered below. Part 1(b)(iii) needs a separable polynomial hypothesis over a general field; its intended case, a counterexample to the unrestricted claim, and the corrected general result are distinguished in that solution. This paper uses the characteristic polynomial convention ${\chi }_T(x)=\det (T-xI)$, which differs by $(-1{)}^{\dim V}$ from the monic convention.

The department's solution-release policy covers even examination years and the exceptional release for 2019; it does not advertise 2017 solutions. The exact-paper check found examiner comments, but no advertised worked answers requiring any subpart to be skipped.

Lie Groups and Differentiable Manifolds, Mathematics Parts C and B; Wednesday 28 May 2008, 9.30am–12.30pm. The complete four-page source and both sections are privately transcribed from original Part C bundle pages 117–120, supplied through the past-papers disclosure. No exact worked-answer advertisement was found in the bounded availability check. Representations are finite-dimensional and continuous; manifolds have no boundary unless stated otherwise.

Source: Mathematics release, bundle Part C 2007 11.pdf, pages 405–407. The paper was sat on 14 June 2011, 2.30–4.00pm, and is shared by Mathematics and Mathematics and Computer Science Part C.

The department's answer-release policy excludes ordinary odd years. Bounded exact-paper checks found no matching advertised answers. All nine printed leaves are answered; the final unpartitioned question includes all of its requests.

Source: Oxford mathematics examination release, private bundle Part C 2007 11.pdf, pages 10–14. The printed Part C cover identifies mathematics, mathematics and philosophy, and mathematics and statistics. The complete editable transcription is retained in the private examination archive.

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.