The Bihar Post

Himself in PM race, Nitish wants Bihar-like Grand Alliance to defeat BJP in next LS polls


PATNA: Chief Minister Nitish Kumar wants a Bihar-like “maha-gathbandhan” (grand alliance) at the national level to take on the BJP in the next 2019 Lok Sabha polls.

“A grand alliance on the pattern of Bihar will be a success at the national level and the Congress being the bigger party should take this initiate,” Kumar told the media on Monday at the end of the weekly public interaction with common men. Today, he had interaction with female groups.

- Sponsored -

ALSO READ: Nitish Kumar may join hands with arch rival Narendra Modi

He claimed the Congress-SP alliance lost elections in recent state polls in Uttar Pradesh due to lack of mega alliance among secular parties.

The JD-U was not given the place in the alliance as the party walked out of the poll arena midway through the polls.

ALSO READ: Disquiet in Grand Alliance: JD-U leader tweet creates consternation in Bihar politics

You May Like this also

“If you add the vote percentage of SP, Congress and the BSP, it’s 10 percent more than the votes polled by the BJP,” he was quoted as telling the news agency PTI.

He said there was no death of leaders but first the people would have to come on a single platform.

ALSO READ: First time after break-up, BJP leaders attend Nitish Kumar’s feast 

Kumar himself happens to be in the race for the country’s top job with the JD-U declaring him the “best candidate” for the post. .

Kumar who was the architect of the grand alliance in Bihar said he had talked to some Left parties in this regard.

The Grand Alliance comprising RJD, JD-U and the Congress had posted emphatic victory over the NDA in the last 2015 Bihar state polls, bagging as many as 178 seats against 58 won by the NDA. That was the worst performance of the BJP in the past one decade.

ALSO READ: JD-U asks anti-BJP parties to accept Nitish Kumar as ‘PM Candidate’

Get real time updates directly on you device, subscribe now.

Comments are closed.

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More