Related changes
Jump to navigation
Jump to search
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are in bold.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
29 May 2024
N 12:14 | 组合数学 (Fall 2024)/Ramsey theory diffhist +26,029 Etone talk contribs (Created page with "== Ramsey's Theorem == === Ramsey's theorem for graph === {{Theorem|Ramsey's Theorem| :Let <math>k,\ell</math> be positive integers. Then there exists an integer <math>R(k,\ell)</math> satisfying: :If <math>n\ge R(k,\ell)</math>, for any coloring of edges of <math>K_n</math> with two colors red and blue, there exists a red <math>K_k</math> or a blue <math>K_\ell</math>. }} {{Proof| We show that <math>R(k,\ell)</math> is finite by induction on <math>k+\ell</math>. For the...") |