121 search results - page 20 / 25 » dm 2010 |
112
Voted
DM
2010
15 years 20 days ago
2010
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
DM
2010
15 years 20 days ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
77
Voted
DM
2010
15 years 20 days ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
DM
2010
15 years 20 days ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
111
click to vote
DM
2010
15 years 20 days ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...