#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2000

2018

- This year (2)
- Last 5 years (10)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Demetres Christofides, Daniela KÃ¼hn, Deryk Osthus
- J. Comb. Theory, Ser. B
- 2000

In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every Î± > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 +â€¦ (More)

- Demetres Christofides, Klas MarkstrÃ¶m
- Electr. J. Comb.
- 2011

Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for theâ€¦ (More)

- Demetres Christofides, Klas MarkstrÃ¶m
- Random Struct. Algorithms
- 2008

The Alon-Roichman theorem states that for every Îµ > 0 there is a constant c(Îµ), such that the Cayley graph of a finite group G with respect to c(Îµ) log |G| elements of G, chosen independently andâ€¦ (More)

- Demetres Christofides, Peter Keevash, Daniela KÃ¼hn, Deryk Osthus
- J. Graph Algorithms Appl.
- 2012

We provide an NC algorithm for finding Hamilton cycles in directed graphs with a certain robust expansion property. This property captures several known criteria for the existence of Hamilton cyclesâ€¦ (More)

- Demetres Christofides, Katherine Edwards, Andrew D. King
- Journal of Graph Theory
- 2013

It was recently proved that any graph satisfying Ï‰ > 2 3(âˆ† + 1) contains a stable set hitting every maximum clique. In this note we prove that the same is true for graphs satisfying Ï‰ â‰¥ 23(âˆ† + 1)â€¦ (More)

- Demetres Christofides
- Discrete Applied Mathematics
- 2009

In the majority problem, we are given n balls coloured black or white and we are allowed to query whether two balls have the same colour or not. The goal is to find a ball of majority colour in theâ€¦ (More)

- Rahil Baber, Demetres Christofides, Ntah Ahn Dang, SÃ¸ren Riis, Emil R. Vaughan
- 2013 International Symposium on Network Codingâ€¦
- 2013

Guessing games for directed graphs were introduced by Riis [8] for studying multiple unicast network coding problems. It can be shown that protocols for a multiple unicast network can be directlyâ€¦ (More)

- Demetres Christofides, Peter Keevash, Daniela KÃ¼hn, Deryk Osthus
- SIAM J. Discrete Math.
- 2010

We show that for each Î² > 0, every digraph G of sufficiently large order n whose outdegree and indegree sequences d+1 6 . . . 6 d + n and d âˆ’ 1 6 . . . 6 d âˆ’ n satisfy d + i , d âˆ’ i > min {i+ Î²n,â€¦ (More)

- Demetres Christofides
- Discrete Mathematics
- 2006

- Demetres Christofides
- Discrete Mathematics
- 2010

Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is toâ€¦ (More)