#### Filter Results:

#### Publication Year

2006

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We formulate and prove a formula to compute the expected value of the minimal random basis of an arbitrary finite matroid whose elements are assigned weights which are independent and uniformly distributed on the interval [0, 1]. This method yields an exact formula in terms of the Tutte polynomial. We give a simple formula to find the minimal random basis… (More)

We consider the problem of online graph colouring. Whenever a node is requested, a colour must be assigned to the node, and this colour must be different from the colours of any of its neighbours. According to the greedy algorithm the node is coloured by the colour with the smallest possible k. The goal is to use as few colours as possible. We propose an… (More)

Dohmen [4] gives a simple inductive proof of Whitney's famous broken circuits theorem. We generalise his inductive proof to the case of matroids.

- ‹
- 1
- ›