Next: Probability
Up: Combinatorics
Previous: Outline
- 1.
- How many integral solutions of
x1+x2+x3+x4 = 30
Satisfy
,
,
,
and
.
- 2.
- How many ways are there to colour the vertices of the 5-cycle so that
adjacent vertices receive different colours?
- 3.
- Let
,
where
an=3an-1-2an-2+2, and a0=a1=1.
Write A(X) as the quotient of two polynomials.
- 4.
- Show that every automorphism of a tree must fix a vertex or an edge.
- 5.
- Show that there are at most 5 connected simple planar graphs
in which every face has the same degree
and every vertex has
the same degree
.
- 6.
- For a given graph G show that the chromatic number
is less than or equal to the maximum degree
.
- 7.
- Construct a cyclic Steiner Triple system of order 13.
- 8.
- Construct 2 idempotent mutually orthogonal Latin squares of order 4.
- 9.
- Show that a transversal design on nk points with k groups is
equivalent to k-2 mutually orthogonal Latin squares of order n.
Mark S. Gockenbach
2002-07-17