Andrew Treglown

Publications

  1. 2021
  2. Accepted/In press

    A note on colour-bias Hamilton cycles in dense graphs

    Andrew Treglown, 4 Mar 2021, (Accepted/In press) In: SIAM Journal on Discrete Mathematics.

    Research output: Contribution to journalArticlepeer-review

  3. Published

    Transitive tournament tilings in oriented graphs with large minimum total degree

    Allan Lo & Andrew Treglown, 22 Feb 2021, In: SIAM Journal on Discrete Mathematics. 35, 1, p. 250–266 17 p.

    Research output: Contribution to journalArticlepeer-review

  4. 2020
  5. Published

    Vertex Ramsey properties of randomly perturbed graphs

    Andrew Treglown, 1 Dec 2020, In: Random Structures and Algorithms. 57, 4, p. 983-1006 24 p.

    Research output: Contribution to journalArticlepeer-review

  6. Published

    Existence thresholds and Ramsey properties of random posets

    Andrew Treglown, Dec 2020, In: Random Structures and Algorithms. 57, 4, p. 1097-1133

    Research output: Contribution to journalArticlepeer-review

  7. E-pub ahead of print
  8. Published

    Ramsey properties of randomly perturbed graphs: cliques and cycles

    Andrew Treglown, 11 Nov 2020, In: Combinatorics, Probability and Computing. 29, 6, p. 830-867

    Research output: Contribution to journalArticlepeer-review

  9. Published

    The bandwidth theorem for locally dense graphs

    Andrew Treglown, 4 Nov 2020, In: Forum of Mathematics, Sigma. 8, 36 p., e42.

    Research output: Contribution to journalArticlepeer-review

  10. Accepted/In press

    A discrepancy version of the Hajnal-Szemerédi theorem

    Bela Csaba & Andrew Treglown, 5 Sep 2020, (Accepted/In press) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  11. Published

    A degree sequence version of the Kühn-Osthus tiling theorem

    Andrew Treglown, 4 Sep 2020, In: The Electronic Journal of Combinatorics. 27, 3, 30 p., #P3.48.

    Research output: Contribution to journalArticlepeer-review

  12. Published

    The complexity of perfect matchings and packings in dense hypergraphs

    Andrew Treglown, Mar 2020, In: Journal of Combinatorial Theory. Series B. 141, p. 72-104 33 p.

    Research output: Contribution to journalArticlepeer-review

Previous 1 2 3 4 5 Next