Neel Choudhury
Reputation
Top tag
Next privilege 50 Rep.
Comment everywhere
 Mar25 asked Probabilty of a path of length $D$ crossing partition exactly $k$ times Nov29 accepted k critical graph cannot have k + 1 vertices Nov29 comment k critical graph cannot have k + 1 vertices Thanks.. great proof.I have just one doubt.How can we prove that a pair of non adjacent vertex exist with k-1 one degree. Can't we have a graph with just one vertex with k-1 or degree or just one pair of adjacent vertex having k-1 degree Nov29 asked k critical graph cannot have k + 1 vertices Aug19 awarded Supporter Aug19 comment Bipartite subgraph having minimum degree ok i got it as min degree is $2m$ we will always find one such vertex for any $G_i$..thanks this was really a nice proof Aug19 comment Bipartite subgraph having minimum degree Thats really cool..But how can we assure that the sequence of steps will end Aug19 awarded Student Aug19 awarded Editor Aug19 comment Bipartite subgraph having minimum degree I changed my question to show my thought process Aug19 revised Bipartite subgraph having minimum degree added 430 characters in body Aug19 asked Bipartite subgraph having minimum degree Aug19 comment tough inequality for a graph theory problem Thank you so much Aug19 comment tough inequality for a graph theory problem sorry.i was talking about maximum degree Aug19 awarded Scholar Aug19 asked tough inequality for a graph theory problem