Reputation
655
Next privilege 1,000 Rep.
Create new tags
Badges
2 8 20
Newest
 Yearling
Impact
~37k people reached

Jan
12
comment Given a graph $G = (V, E)$, prove $e \leq \frac{n(n-1)}{2}$ for all $n$
Induction hypothesis: If $G$ has $k$ vertices then it has at most $k(k-1)/2$ edges. Suppose if we add another vertex then it can create at most $k$ new edges. So the total number of edges in $k+1$ vertex graph is at most $k+ k(k-1)/2=k(k+1)/2$
Jan
10
awarded  Yearling
Jan
10
accepted Interval order dimension of a Poset
Jan
9
revised Interval order dimension of a Poset
added 13 characters in body
Jan
9
comment Interval order dimension of a Poset
Real Intervals.
Jan
9
revised Interval order dimension of a Poset
added 40 characters in body
Jan
9
comment Interval order dimension of a Poset
$I_x$ lies totally to the left of $I_y$
Jan
9
asked Interval order dimension of a Poset
Nov
2
awarded  Famous Question
Oct
6
awarded  Popular Question
Aug
24
accepted Multiplication of a random variable with constant
Aug
16
awarded  Famous Question
Jul
24
awarded  Notable Question
May
5
asked First, second and monadic second order logic
Feb
6
asked Eigen Value and Eigen Vector
Feb
4
asked Find one solution for system of inequalities (if exits)
Jan
19
comment Physical meaning of some identity in a weighted undirected graph
Sorry I have edited. Summing over all edges $(u,z)$ such that one end point is in $C$.
Jan
19
revised Physical meaning of some identity in a weighted undirected graph
added 46 characters in body
Jan
19
asked Physical meaning of some identity in a weighted undirected graph
Jan
10
awarded  Yearling