Question

How far can we take this probabilistic argument?

score 118 · Answer 1 · 2026-03-23 14:01:42

118

Views

How far can we take this probabilistic argument?

Published on 23 Mar 2026 - 14:01

score 228 · Answer 2 · 2020-06-24 11:23:04

228

Views

Interpretation of martingales in graphs.

Published on 24 Jun 2020 - 11:23

score 132 · Answer 3 · 2020-06-25 04:58:35

132

Views

$S_1, \dots, S_6 \subseteq \{1,2,\dots,21\},$ prove either $|S_i \cap S_j| \ge 5$ or $|S_i^C \cap S_j^C| \ge 5$ for some $i,j.$

Published on 25 Jun 2020 - 4:58

score 30 · Answer 4 · 2026-03-25 07:49:23

30

Views

Value $p$ that makes the random hypergraph $H^{(k)}(n,p)$ a good cover?

Published on 25 Mar 2026 - 7:49

score 96 · Answer 5 · 2026-03-25 07:45:32

96

Views

Application of a lemma to prove Pippenger's 1989 Theorem.

Published on 25 Mar 2026 - 7:45

score 51 · Answer 6 · 2026-03-25 07:45:02

51

Views

Probability of a vertex not belonging to a set of edges in a random hypergraph.

Published on 25 Mar 2026 - 7:45

score 56 · Answer 7 · 2020-07-15 20:26:02

56

Views

Solution verification: sum at least $4N/7$ times odd

Published on 15 Jul 2020 - 20:26

score 470 · Answer 8 · 2026-03-25 11:04:47

470

Views

Prove that all $k$-uniform hypergraphs $H$ with $e(H) \leq \frac{4^{k-1}}{3^{k}}$ admit a rainbow 4-colouring

Published on 25 Mar 2026 - 11:04

score 58 · Answer 9 · 2020-07-20 08:43:58

58

Views

Prove the codeword lengths $l_1,l_2\ldots,l_n$ of a uniquely decipherable code satisfy $\sum_{i=1}^{n} 2^{-l_i} \leq 1$.

Published on 20 Jul 2020 - 8:43

score 197 · Answer 10 · 2020-07-22 14:21:20

197

Views

Why doesn’t this work: proof for the lower bound of the size $\sigma(k)$ of the smallest tournament with the Schütte property $S_k$?

Published on 22 Jul 2020 - 14:21

score 254 · Answer 11 · 2020-07-23 13:12:39

254

Views

If $v_1,v_2,\ldots,v_n\in \mathbb{R}^n$ s.t $\|v_k\|=1$, then $\exists\epsilon_k=\pm 1$ s.t. $\left\|\sum_{k=1}^n \epsilon_k v_k\right\|\le \sqrt{n}$.

Published on 23 Jul 2020 - 13:12

score 365 · Answer 12 · 2020-07-24 02:24:20

365

Views

Why the clique numbers of almost all graphs are concentrated at two values?

Published on 24 Jul 2020 - 2:24

score 165 · Answer 13 · 2020-07-29 13:17:29

165

Views

A tournament on $k2^k$ vertices always contains a dominating set of size $k$.

Published on 29 Jul 2020 - 13:17

score 34 · Answer 14 · 2016-07-12 19:27:43

34

Views

can we have probabilistic interpretation of $L(1,( \frac{\cdot }{ p}))^{-1}$

Published on 12 Jul 2016 - 19:27

score 56 · Answer 15 · 2016-07-23 20:03:37

56

Views

probabilistic method for random algorithm that decide language membership

Published on 23 Jul 2016 - 20:03

List Question

How far can we take this probabilistic argument?

Interpretation of martingales in graphs.

$S_1, \dots, S_6 \subseteq \{1,2,\dots,21\},$ prove either $|S_i \cap S_j| \ge 5$ or $|S_i^C \cap S_j^C| \ge 5$ for some $i,j.$

Value $p$ that makes the random hypergraph $H^{(k)}(n,p)$ a good cover?

Application of a lemma to prove Pippenger's 1989 Theorem.

Probability of a vertex not belonging to a set of edges in a random hypergraph.

Solution verification: sum at least $4N/7$ times odd

Prove that all $k$-uniform hypergraphs $H$ with $e(H) \leq \frac{4^{k-1}}{3^{k}}$ admit a rainbow 4-colouring

Prove the codeword lengths $l_1,l_2\ldots,l_n$ of a uniquely decipherable code satisfy $\sum_{i=1}^{n} 2^{-l_i} \leq 1$.

Why doesn’t this work: proof for the lower bound of the size $\sigma(k)$ of the smallest tournament with the Schütte property $S_k$?

If $v_1,v_2,\ldots,v_n\in \mathbb{R}^n$ s.t $\|v_k\|=1$, then $\exists\epsilon_k=\pm 1$ s.t. $\left\|\sum_{k=1}^n \epsilon_k v_k\right\|\le \sqrt{n}$.

Why the clique numbers of almost all graphs are concentrated at two values?

A tournament on $k2^k$ vertices always contains a dominating set of size $k$.

can we have probabilistic interpretation of $L(1,( \frac{\cdot }{ p}))^{-1}$

probabilistic method for random algorithm that decide language membership

Trending Questions

Popular # Hahtags

Popular Questions