74 search results - page 13 / 15 » arscom 2007 |
ARSCOM
2002
14 years 9 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
ARSCOM
2002
14 years 9 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
ARSCOM
1999
14 years 9 months ago
1999
A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
ARSCOM
2006
14 years 9 months ago
2006
The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a p...
ARSCOM
2004
14 years 9 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...