Combinatorics, Probability and Computing, 0963-5483

Journal

Publications

  1. 2004
  2. Published

    Large topological cliques in graphs without a 4-cycle

    Deryk Osthus & Daniela Kuhn, 1 Jan 2004, In : Combinatorics, Probability and Computing. 13, p. 93-102 10 p.

    Research output: Contribution to journalArticle

  3. Published
  4. 2005
  5. Published

    Packings in dense regular graphs

    Daniela Kuhn & Deryk Osthus, 1 May 2005, In : Combinatorics, Probability and Computing. 14, p. 325-337 13 p.

    Research output: Contribution to journalArticle

  6. 2007
  7. Published

    Maximizing Several Cuts Simultaneously

    Daniela Kuhn & Deryk Osthus, 1 Mar 2007, In : Combinatorics, Probability and Computing. 16, 02, p. 277-283 7 p.

    Research output: Contribution to journalArticle

  8. 2008
  9. Published

    Linkedness and Ordered Cycles in Digraphs

    Daniela Kuhn & Deryk Osthus, 1 May 2008, In : Combinatorics, Probability and Computing. 17, 03

    Research output: Contribution to journalArticle

  10. Published
  11. 2010
  12. Published

    Playing to Retain the Advantage

    Dan Hefetz, 1 Jul 2010, In : Combinatorics, Probability and Computing. 19, 4, p. 481-491 11 p.

    Research output: Contribution to journalArticle

  13. Published

    Tight Bounds for Blind Search on the Integers and the Reals

    Jon Rowe, 1 Nov 2010, In : Combinatorics, Probability and Computing. 19, 5-6, p. 711-728 18 p.

    Research output: Contribution to journalArticle

  14. 2011
  15. Published

    3-Connected Cores In Random Planar Graphs

    Nikolaos Fountoulakis, 1 May 2011, In : Combinatorics, Probability and Computing. 20, 03, p. 381-412 32 p.

    Research output: Contribution to journalArticle

  16. 2013
  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 journalArticle

  18. Published
  19. 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 journalArticle

  20. 2015
  21. 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 journalArticle

  22. E-pub ahead of print

    The multiple-orientability thresholds for random hypergraphs

    Nikolaos Fountoulakis, 28 Dec 2015, In : Combinatorics, Probability and Computing. 25, 6, p. 870-908 38 p.

    Research output: Contribution to journalArticle

  23. 2016
  24. E-pub ahead of print
  25. 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 journalArticle

  26. E-pub ahead of print
  27. 2017
  28. 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 journalArticle

  29. 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 journalArticle

  30. 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 journalArticle

Previous 1 2 Next