Browse Publications

  1. 2020
  2. Publications content icon
    Published
  3. Publications content icon
    Published
  4. 2019
  5. Publications content icon
    Published

    Connected chord diagrams and bridgeless maps

    Noam Zeilberger, 22 Nov 2019, In : The Electronic Journal of Combinatorics. 26, 4, p. 1-56 56 p., P4.37.

    Research output: Contribution to journalArticle

  6. Publications content icon
    Published
  7. Publications content icon
    Published

    On the critical densities of minor-closed classes

    Michal Przykucki, 1 Jan 2019, In : European Journal of Combinatorics. 75, p. 66-91 26 p.

    Research output: Contribution to journalArticle

  8. 2018
  9. Publications content icon
    Published

    Frozen colourings of bounded degree graphs

    Guillem Perarnau, 17 Jul 2018, In : Electronic Notes in Discrete Mathematics. 68, p. 167-172 6 p.

    Research output: Contribution to journalArticle

  10. Publications content icon
    Published

    On the intersection of infinite matroids

    Johannes Carmesin, 1 Jun 2018, In : Discrete Mathematics. 341, 6, p. 1582-1596 15 p.

    Research output: Contribution to journalArticle

  11. Publications content icon
    E-pub ahead of print

    l1-embeddability of generic quadrilateral Möbius maps

    Sergey Shpectorov, 22 Feb 2018, In : European Journal of Combinatorics.

    Research output: Contribution to journalArticle

  12. 2017
  13. Publications content icon
    Published
  14. 2016
  15. Publications content icon
    Published
  16. Publications content icon
    Published

    Optimal path and cycle decompositions of dense quasirandom graphs

    Stefan Glock, Daniela Kuhn & Deryk Osthus, 1 May 2016, In : Journal of Combinatorial Theory. Series B. 118, p. 88-108 21 p.

    Research output: Contribution to journalArticle

  17. 2015
  18. Publications content icon
    Published

    Bipartitions of highly connected tournaments

    Jaehoon Kim, Daniela Kuhn & Deryk Osthus, 1 Nov 2015, In : Electronic Notes in Discrete Mathematics. 49, p. 79-84 6 p.

    Research output: Contribution to journalArticle

  19. Publications content icon
    Published

    Edge-decompositions of graphs with high minimum degree

    Ben Barber, Daniela Kuhn, Allan Lo & Deryk Osthus, 1 Nov 2015, In : Electronic Notes in Discrete Mathematics. 49, p. 115-121 7 p.

    Research output: Contribution to journalArticle

  20. Publications content icon
    Published
  21. Publications content icon
    Published

    On the random greedy F-free hypergraph process

    Daniela Kuhn, Deryk Osthus, Nov 2015, In : Electronic Notes in Discrete Mathematics. 49, p. 73-77 5 p.

    Research output: Contribution to journalArticle

  22. 2014
  23. Publications content icon
    Published

    Optimal covers with Hamilton cycles in random graphs

    Dan Hefetz, Daniela Kuhn & Deryk Osthus, Oct 2014, In : Combinatorica. 34, 5, p. 573–596

    Research output: Contribution to journalArticle

  24. Publications content icon
    Published

    Decompositions of complete uniform hypergraphs into Hamilton Berge cycles

    Daniela Kuhn & Deryk Osthus, 1 Jan 2014, In : Journal of Combinatorial Theory, Series A. 126, 1, p. 128-135 8 p.

    Research output: Contribution to journalArticle

  25. 2013
  26. Publications content icon
    Published

    There is no upper bound for the diameter of the commuting graph of a finite group

    Chris Parker, 1 Sep 2013, In : Journal of Combinatorial Theory. Series A. 120, 7, p. 1600-1603 4 p.

    Research output: Contribution to journalArticle

  27. 2012
  28. Publications content icon
    Published

    Rainbow matchings of size δ(G) in properly edge-colored graphs

    Allan Lo, 28 Jun 2012, In : Electronic Journal of Combinatorics. 19, 2

    Research output: Contribution to journalArticle

  29. 2011
  30. Publications content icon
    Published
  31. 2009
  32. Publications content icon
    Published

    Degree sequences forcing Hamilton cycles in directed graphs

    Daniela Kuhn, Deryk Osthus & Andrew Treglown, 1 Aug 2009, In : Electronic Notes in Discrete Mathematics. 34, p. 347-351 5 p.

    Research output: Contribution to journalArticle

  33. 2001
  34. Publications content icon
    Published

    Completions of Goldschmidt Amalgams of Type G4 in Dimension 3

    Chris Parker, 1 Jan 2001, In : Journal of Algebraic Combinatorics. 13, 1, p. 77-82 6 p.

    Research output: Contribution to journalArticle

  35. 2000
  36. Publications content icon
    Published

    Cayley type graphs and cubic graphs of large girth

    John Bray, Chris Parker, 21 Mar 2000, In : Discrete Mathematics. 214, 1-3, p. 113-121 9 p.

    Research output: Contribution to journalArticle

  37. 1996
  38. Publications content icon
    Published

    Recognition of the ℓ1-graphs with complexity O(nm), or football in a hypercube

    Sergey Shpectorov, 1 Jan 1996, In : European Journal of Combinatorics. 17, 2-3, p. 279-289 11 p.

    Research output: Contribution to journalArticle

  39. 1995
  40. Publications content icon
    Published

    Linear codes and doubly transitive symmetric designs

    Chris Parker, 1 Jan 1995, In : Linear Algebra and its Applications. 226-228, C, p. 237-246 10 p.

    Research output: Contribution to journalArticle