585,549 research outputs found
Developing Deadly Skies
The Canadian War Museum’s exhibition Deadly Skies – Air War, 1914-1918 examines the first air war from the perspective of nine international participants representing Canada, the United States, France, Great Britain, and Germany. Eschewing the romantic mythology of First World War aviation that focuses on the achievements of individual fighter pilots, the exhibition examines four key aspects of the air war: training, observation, bombing, and aerial combat. Adopting an interpretive approach that appeals to intergenerational audiences and that highlights personal experience in the war, the exhibition is presented as a series of life-sized graphic novels, supplemented with key artifacts, photos, audio clips, and videos. The historical and interpretative approaches together present a holistic and modern examination of the world’s first air war
The Essex Scottish Regiment in Operation Atlantic: What Went Wrong?
On 20–21 July 1944 the 6th Canadian Infantry Brigade was engaged in combat operations on Verrières Ridge south of Caen. Enemy resistance was stronger than expected and teh Canadian attack was met by strong German counterattacks supported by armour. During the course of the battle, two units, the Essex Scottish Regiment and the South Saskatchewan Regiment were driven back. In the aftermath of the battle the Essex Scottish Regiment and their commanding officer were criticized for their poor performance. This article examines the battle in an attempt to understand who was to blame. Lieutenant–Colonel B.J.S. MacDonald, the commanding officer of the Essex Scots, was fired for his role in the battle, but this article posits that Brigadier Hugh A. Young bears the greater share of responsibility for the operation’s failure
Building spanning trees quickly in Maker-Breaker games
For a tree T on n vertices, we study the Maker-Breaker game, played on the
edge set of the complete graph on n vertices, which Maker wins as soon as the
graph she builds contains a copy of T. We prove that if T has bounded maximum
degree, then Maker can win this game within n+1 moves. Moreover, we prove that
Maker can build almost every tree on n vertices in n-1 moves and provide
non-trivial examples of families of trees which Maker cannot build in n-1
moves
The Disjoint Domination Game
We introduce and study a Maker-Breaker type game in which the issue is to
create or avoid two disjoint dominating sets in graphs without isolated
vertices. We prove that the maker has a winning strategy on all connected
graphs if the game is started by the breaker. This implies the same in the
biased game also in the maker-start game. It remains open to
characterize the maker-win graphs in the maker-start non-biased game, and to
analyze the biased game for . For a more restricted
variant of the non-biased game we prove that the maker can win on every graph
without isolated vertices.Comment: 18 page
Recommended from our members
Sentence-Maker
This exercise is designed to faciltate practice with a newly-learned tense, such as the future. Pick
a subject from column 1 and a verb from column 4; then choose an adverb (or other item)
from column 2 and/or an object from column 3.Asian Studie
Biased orientation games
We study biased {\em orientation games}, in which the board is the complete
graph , and Maker and Breaker take turns in directing previously
undirected edges of . At the end of the game, the obtained graph is a
tournament. Maker wins if the tournament has some property and
Breaker wins otherwise.
We provide bounds on the bias that is required for a Maker's win and for a
Breaker's win in three different games. In the first game Maker wins if the
obtained tournament has a cycle. The second game is Hamiltonicity, where Maker
wins if the obtained tournament contains a Hamilton cycle. Finally, we consider
the -creation game, where Maker wins if the obtained tournament has a copy
of some fixed graph
- …