Publications and Preprints

  • D. Christofides, K. Edwards and A. D. King, A note on hitting maximum and maximal cliques with a stable set, submitted.
  • D. Christofides and K. Markström, The thresholds for diameter 2 in random Cayley graphs, submitted.
  • D. Christofides, A counterexample to a conjecture of Simonovits and Sós, submitted.
  • D. Christofides, J. Hladký and A. Máthé, Hamilton cycles in dense vertex-transitive graphs, submitted.
  • D. Christofides, P. Keevash, D. Kühn and D. Osthus Finding Hamilton cycles in robustly expanding digrpahs, submitted.
  • D. Christofides, D. Kühn and D. Osthus Edge-disjoint Hamilton cycles in graphs, to appear in J. Combin. Theory Ser. B.
  • D. Christofides and K. Markström, Random Latin square graphs, to appear in Random Structures Algorithms.
  • D. Christofides, A q-analogue of the four functions theorem, to appear in Combinatorica.
  • D. Christofides and K. Markström, The guessing number of undirected graphs, Electron. J. Combin., 18 (2011), Research Paper 192, 19pp.
  • D. Christofides, P. Keevash, D. Kühn and D. Osthus A semiexact degree condition for Hamilton cycles in digraphs, SIAM J. Discrete Math., 24 (2010), 709-756
  • D. Christofides, Influences of monotone Boolean functions, Discrete Math., 310 (2010), 1401-1402
  • D. Christofides, On randomized algorithms for the majority problem, Discrete Appl. Math., 157 (2009), 1481--1485.
  • D. Christofides and K. Markström, Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales, Random Structures Algorithms, 32 (2008), 88-100.
  • D. Christofides, Induced lines in Hales-Jewett cubes, J. Combin. Theory Ser. A, 114 (2007) 906-918.
  • D. Christofides, Pair lengths of product graphs, Discrete Math., 306 (2006), 2111-2114.

    • Other

  • D. Christofides, Random Cayley graphs, to appear in Midsummer Combinatorial Workshop 2011.
  • D. Christofides, J. Hladký and A. Máthé, The Lovász conjecture for dense graphs, to appear in Electronic Notes in Discrete Mathematics.
  • D. Christofides, The Krausz dimension of a graph after the removal of an edge, unpublished.
  • D. Christofides, Randomized algorithms for the majority problem, Electronic Notes in Discrete Mathematics 34 (2009), 453-457.
  • D. Christofides and G. Raptis, Partial orders and topologies on finite sets, Eureka 56 (2004), 14-18.