Scribd Logo
Upload

Welcome to Scribd!

  • Kick Off Question

    Uploaded by

    docsanshm
    2K views2 pages
    The document describes a graph G0 with 3 triangles and 9 vertices labeled A to I. If optimally played, the number of colored edges when one player aims to maximize colored edges and the other aims to minimize them would be: 2. If the player aiming to minimize colored edges chooses the vertex for each color, they can color the vertices such that only 2 edges are colored. 3. Alternatively, if the player aiming to maximize colored edges chooses the color for each vertex chosen by the other player, they can color the vertices such that more than 2 edges are colored.

    Original Description:

    kick

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a graph G0 with 3 triangles and 9 vertices labeled A to I. If optimally played, the number of colored edges when one player aims to maximize colored edges and the other aims to minimize them would be: 2. If the player aiming to minimize colored edges chooses the vertex for each color, they can color the vertices such that only 2 edges are colored. 3. Alternatively, if the player aiming to maximize colored edges chooses the color for each vertex chosen by the other player, they can color the vertices such that more than 2 edges are colored.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2K views2 pages

    Kick Off Question

    Uploaded by

    docsanshm
    The document describes a graph G0 with 3 triangles and 9 vertices labeled A to I. If optimally played, the number of colored edges when one player aims to maximize colored edges and the other aims to minimize them would be: 2. If the player aiming to minimize colored edges chooses the vertex for each color, they can color the vertices such that only 2 edges are colored. 3. Alternatively, if the player aiming to maximize colored edges chooses the color for each vertex chosen by the other player, they can color the vertices such that more than 2 edges are colored.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Question Consider the graph G0 with 3 components which are triangles.

    G0 has 9 vertices labeled A to I and 9 edges (A, B), (B, C) as shown below. If each vertex of G0 is assigned a red or a green color, then we say that an edge is colored if its ends have different colors. Ajai and Rekha color the vertices of G0 in the following manner. Ajai proposes a color (red or green) and Rekha chooses the vertex to apply this color. After 9 turns, all the vertices of G 0 are colored and the number of colored edges is counted. Suppose Ajai would like to maximize the number of colored edges while Rekha would like to minimize the number of colored edges. Assuming optimal play from both players, how many edges will be colored? Explain your reasoning.

    Rekhas perspective is to minimize the number of colored edges. so she can put in the colors by asking ajay the sequence of colour (red,green) in a random way. now considering that Ajay says the colour first and Rekha puts them as per her choice then she can put the colours in this way

    In this way only two of the edges would be coloured and Rekha would succed in her motive.

    Now there is a another way as ajay ask rekha to select the place first, then ajay give the colour (red,green) in a random way.

    As ajay wants to maximize the number of coloured edges, so the situation will come like this..

    You might also like