Talk:Combinatorics (Fall 2010)/Problem set 4: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
(→Typos) |
||
| Line 1: | Line 1: | ||
=Typos = | =Typos = | ||
#<math>n \geq N(n)</math> should be <math>n \geq N(k)</math> | #<math>n \geq N(n)</math> should be <math>n \geq N(k)</math> | ||
=Suggestion= | |||
#Tournament Graph is <math>K_n</math> | #Tournament Graph is <math>K_n</math> | ||
by 詹宇森 | by 詹宇森 | ||
Revision as of 14:14, 19 November 2010
Typos
- [math]\displaystyle{ n \geq N(n) }[/math] should be [math]\displaystyle{ n \geq N(k) }[/math]
Suggestion
- Tournament Graph is [math]\displaystyle{ K_n }[/math]
by 詹宇森