# How to solve Line Line Line Graph

**URL:** <https://discuss.codechef.com/t/how-to-solve-line-line-line-graph/61717>\
**Category:** Uncategorized\
**Tags:** april20\
**Created:** [April 13, 2020, 10:26am UTC](https://discuss.codechef.com/t/how-to-solve-line-line-line-graph/61717 "2020-04-13T10:26:22Z")\
**Posts on this page:** 1\
**Showing post:** 3

<div class="post-metadata">

**Author:** ![ashish99hanny](https://www.codechef.com/sites/all/themes/abessive/images/user_default_thumb.jpg) [@ashish99hanny](https://discuss.codechef.com/u/ashish99hanny)\
**Post date:** [April 13, 2020, 10:32am UTC](https://discuss.codechef.com/t/how-to-solve-line-line-line-graph/61717/3 "2020-04-13T10:32:34Z")

</div>

For 30 points you can go through this link

> [@HAMILG - Editorial](https://discuss.codechef.com/t/hamilg-editorial/11310):
>
> PROBLEM LINK: [Practice](http://www.codechef.com/problems/HAMILG)[Contest](http://www.codechef.com/JULY15/problems/HAMILG) Author: [Jakub Safin](http://www.codechef.com/users/xellos0) Tester: [Mugurel Ionut Andreica](http://www.codechef.com/users/mugurelionut) Editorialist: [Lalit Kundu](http://www.codechef.com/users/darkshadows)DIFFICULTY: Hard PREREQUISITES: game theory, graphs, maximum matching, Edmonds’ blossom algorithm PROBLEM: Two players, A and B, play a game with a token on an undirected graph G. The game goes as follows: A chooses a starting vertex and places the token on this vertex. The players now alternate turns; B moves first. In his turn, each player has to move the token along exactl…

The setters solution passes it for 30 points as largest independent set in L(G) = maximum matching in G so you just output max\_matching size .

---

_[View the full topic](https://discuss.codechef.com/t/how-to-solve-line-line-line-graph/61717)._