Combinatorics, Probability and Computing, ‎0963-5483

Journal

Publications

  1. Article › Research › Peer-reviewed
  2. Published

    A discrepancy version of the Hajnal-Szemerédi theorem

    Bela Csaba, & Andrew Treglown, May 2021, In: Combinatorics, Probability and Computing. 30, 3, p. 444-459 16 p.

    Research output: Contribution to journalArticlepeer-review

  3. Published

    An asymptotic bound for the strong chromatic number

    Allan Lo & , Sep 2019, In: Combinatorics, Probability and Computing. 28, 5, p. 768-776 9 p.

    Research output: Contribution to journalArticlepeer-review

  4. E-pub ahead of print

    Counting Hamilton cycles in Dirac hypergraphs

    Stefan Glock, Stephen Gould, Felix Joos, Daniela Kuhn & Deryk Osthus, 17 Dec 2020, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  5. Published

    Covering and tiling hypergraphs with tight cycles

    Allan Lo & , 13 Oct 2020, In: Combinatorics, Probability and Computing. 0, p. 1-36

    Research output: Contribution to journalArticlepeer-review

  6. E-pub ahead of print

    Dirac's theorem for random regular graphs

    Antonio Jose Ferra Gomes De Almeida Girao, Daniela Kuhn & Deryk Osthus, 28 Aug 2020, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  7. Published

    Embedding Spanning Bipartite Graphs of Small Bandwidth

    Andrew Treglown, 1 Jan 2013, In: Combinatorics, Probability and Computing. 22, 01, p. 71-96 26 p.

    Research output: Contribution to journalArticlepeer-review

  8. Published

    Exact minimum codegree threshold for K-4-factors

    Allan Lo, Andrew Treglown & , 4 Aug 2017, In: Combinatorics, Probability and Computing. 26, p. 856-885

    Research output: Contribution to journalArticlepeer-review

  9. E-pub ahead of print

    Existence of Spanning F-Free Subgraphs with Large Minimum Degree

    Guillem Perarnau & , 7 Dec 2016, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  10. Published

    Fractional clique decompositions of partite graphs

    Richard Montgomery, Nov 2017, In: Combinatorics, Probability and Computing. 26, 6, p. 911-943

    Research output: Contribution to journalArticlepeer-review

  11. Published

    Large unavoidable subtournaments

    Eoin Long, 1 Jan 2017, In: Combinatorics, Probability and Computing. 26, 1, p. 68-77 10 p.

    Research output: Contribution to journalArticlepeer-review

  12. E-pub ahead of print

    Monochromatic cycle partitions in random graphs

    Richard Lang & Allan Lo, 14 Aug 2020, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  13. E-pub ahead of print

    On deficiency problems for graphs

    Andrew Treglown, 27 Sep 2021, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  14. Published

    On directed versions of the Hajnal-Szemerédi theorem

    Andrew Treglown, Nov 2015, In: Combinatorics, Probability and Computing. 24, 6, p. 873-928 56 p.

    Research output: Contribution to journalArticlepeer-review

  15. Published

    On the Normalized Shannon Capacity of a Union

    Eoin Long, 1 Sep 2016, In: Combinatorics, Probability and Computing. 25, 5, p. 766-767 2 p.

    Research output: Contribution to journalArticlepeer-review

  16. E-pub ahead of print

    On the Widom-Rowlinson occupancy fraction in regular graphs

    Will Perkins & , 9 Aug 2016, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

  17. Published

    Optimal packings of Hamilton cycles in graphs of high minimum degree

    Daniela Kuhn, & Deryk Osthus, 2013, In: Combinatorics, Probability and Computing. 22, p. 394-416 23 p.

    Research output: Contribution to journalArticlepeer-review

  18. E-pub ahead of print

    Parking on a random tree

    Michal Przykucki, 23 Oct 2018, (E-pub ahead of print) In: Combinatorics, Probability and Computing. 23 p.

    Research output: Contribution to journalArticlepeer-review

  19. Published
  20. 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

  21. E-pub ahead of print

    Tail bounds on hitting times of randomized search heuristics using variable drift analysis

    Per Kristian Lehre & , 5 Nov 2020, (E-pub ahead of print) In: Combinatorics, Probability and Computing.

    Research output: Contribution to journalArticlepeer-review

Previous 1 2 Next