User contributions for Etone
Jump to navigation
Jump to search
15 May 2023
- 11:0311:03, 15 May 2023 diff hist +58 概率论与数理统计 (Spring 2023) →Concepts
- 11:0011:00, 15 May 2023 diff hist +91 概率论与数理统计 (Spring 2023) →Concepts
- 10:5810:58, 15 May 2023 diff hist +126 概率论与数理统计 (Spring 2023) →Concepts
- 10:4010:40, 15 May 2023 diff hist −1 概率论与数理统计 (Spring 2023) →Lectures
- 10:4010:40, 15 May 2023 diff hist +10 概率论与数理统计 (Spring 2023) →Lectures
- 08:5308:53, 15 May 2023 diff hist −16 概率论与数理统计 (Spring 2023) →Lectures Tag: Manual revert
- 08:5308:53, 15 May 2023 diff hist +16 概率论与数理统计 (Spring 2023) →Lectures Tag: Reverted
- 08:4208:42, 15 May 2023 diff hist +1,169 概率论与数理统计 (Spring 2023) →Concepts
- 08:3008:30, 15 May 2023 diff hist 0 概率论与数理统计 (Spring 2023) →Lectures
- 08:2808:28, 15 May 2023 diff hist +72 概率论与数理统计 (Spring 2023) →Lectures
- 06:3506:35, 15 May 2023 diff hist +4 组合数学 (Spring 2023) →Lecture Notes
- 06:3406:34, 15 May 2023 diff hist +64 组合数学 (Spring 2023) →Lecture Notes
11 May 2023
- 10:5710:57, 11 May 2023 diff hist +1,772 组合数学 (Spring 2023) →Concepts
10 May 2023
5 May 2023
- 09:1109:11, 5 May 2023 diff hist +1 组合数学 (Fall 2023)/Problem Set 1 →Problem 1 current
4 May 2023
- 10:5810:58, 4 May 2023 diff hist +103 概率论与数理统计 (Spring 2023) →Concepts
- 10:5710:57, 4 May 2023 diff hist +75 概率论与数理统计 (Spring 2023) →Concepts
- 10:5510:55, 4 May 2023 diff hist +130 概率论与数理统计 (Spring 2023) →Concepts
- 09:2409:24, 4 May 2023 diff hist +9 概率论与数理统计 (Spring 2023) →Concepts
- 09:2309:23, 4 May 2023 diff hist +1 概率论与数理统计 (Spring 2023) →Concepts
- 09:2209:22, 4 May 2023 diff hist +56 概率论与数理统计 (Spring 2023) →Concepts
- 09:2109:21, 4 May 2023 diff hist +21 概率论与数理统计 (Spring 2023) →Concepts
- 09:2109:21, 4 May 2023 diff hist +2,367 概率论与数理统计 (Spring 2023) →Concepts
- 08:5508:55, 4 May 2023 diff hist +18,939 N 组合数学 (Fall 2023)/Extremal graph theory Created page with "== Forbidden Cliques == Extremal graph theory studies the problems like "how many edges that a graph <math>G</math> can have, if <math>G</math> has some property?" === Mantel's theorem === We consider a typical extremal problem for graphs: the largest possible number of edges of '''triangle-free''' graphs, i.e. graphs contains no <math>K_3</math>. {{Theorem|Theorem (Mantel 1907)| :Suppose <math>G(V,E)</math> is graph on <math>n</math> vertice without triangles. Then <m..." current
- 08:5408:54, 4 May 2023 diff hist +90 组合数学 (Spring 2023) →Lecture Notes
- 08:5008:50, 4 May 2023 diff hist +149 概率论与数理统计 (Spring 2023) →Lectures
28 April 2023
27 April 2023
- 15:5615:56, 27 April 2023 diff hist +7 组合数学 (Fall 2023)/The probabilistic method →Lovász Local Lemma current
- 15:5515:55, 27 April 2023 diff hist +7 组合数学 (Fall 2023)/The probabilistic method →Lovász Local Lemma
- 15:5515:55, 27 April 2023 diff hist +10 组合数学 (Fall 2023)/The probabilistic method →Lovász Local Lemma
- 15:5315:53, 27 April 2023 diff hist −2 组合数学 (Fall 2023)/The probabilistic method →Coloring large-girth graphs
- 15:5315:53, 27 April 2023 diff hist +27,129 N 组合数学 (Fall 2023)/The probabilistic method Created page with "== The Probabilistic Method == The probabilistic method provides another way of proving the existence of objects: instead of explicitly constructing an object, we define a probability space of objects in which the probability is positive that a randomly selected object has the required property. The basic principle of the probabilistic method is very simple, and can be stated in intuitive ways: *If an object chosen randomly from a universe satisfies a property with posi..."
- 15:5215:52, 27 April 2023 diff hist +93 组合数学 (Spring 2023) →Lecture Notes
25 April 2023
21 April 2023
19 April 2023
- 04:2904:29, 19 April 2023 diff hist +193 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法 current
18 April 2023
- 17:1117:11, 18 April 2023 diff hist −24 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 17:1117:11, 18 April 2023 diff hist −85 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 17:0917:09, 18 April 2023 diff hist +266 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 17:0517:05, 18 April 2023 diff hist −45 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 17:0217:02, 18 April 2023 diff hist +9 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 17:0117:01, 18 April 2023 diff hist +322 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →一阶矩方法
- 16:4916:49, 18 April 2023 diff hist +119 概率论与数理统计 (Spring 2023) →Lectures
- 16:4216:42, 18 April 2023 diff hist −7 概率论与数理统计 (Spring 2023) →Lectures
- 16:4016:40, 18 April 2023 diff hist +113 概率论与数理统计 (Spring 2023) →Lectures
- 16:0116:01, 18 April 2023 diff hist +3 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法
- 15:5915:59, 18 April 2023 diff hist +7 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法
- 15:5215:52, 18 April 2023 diff hist +1 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法
- 15:5115:51, 18 April 2023 diff hist +158 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法
- 15:4915:49, 18 April 2023 diff hist +5 概率论与数理统计 (Spring 2023)/Threshold of k-clique in random graph →二阶矩方法