Question

In random graph what do we mean by almost every graph in G(n,p) has a property Q?

score 133 · Answer 1 · 2020-10-09 15:31:32

133

Views

In random graph what do we mean by almost every graph in G(n,p) has a property Q?

Published on 09 Oct 2020 - 15:31

score 122 · Answer 2 · 2020-10-13 10:57:53

122

Views

Efficient Algorithm for finding a large sum-free subset.

Published on 13 Oct 2020 - 10:57

score 104 · Answer 3 · 2020-10-20 04:40:40

104

Views

Regular Graph with a Partition Half of Neighbors Are in the Partition and Half Are Not

Published on 20 Oct 2020 - 4:40

score 364 · Answer 4 · 2020-10-28 06:36:59

364

Views

The probabilistic method exercise 2.7.4

Published on 28 Oct 2020 - 6:36

score 473 · Answer 5 · 2020-10-28 12:52:42

473

Views

Exercise 2.7.5 of the probabilistic method

Published on 28 Oct 2020 - 12:52

score 130 · Answer 6 · 2020-11-12 15:01:33

130

Views

Lower bound for minimum vertices in tournament

Published on 12 Nov 2020 - 15:01

score 82 · Answer 7 · 2020-11-23 12:44:13

82

Views

Prove that there exist a set $ S⊆V $ for a graph G which contains a matching M, such that there are $ frac{|E|+m}{2} $ between S and V\S

Published on 23 Nov 2020 - 12:44

score 668 · Answer 8 · 2020-11-23 14:54:29

668

Views

Show that any graph has an independent set of size at least $\frac{n^2}{2m+n}$

Published on 23 Nov 2020 - 14:54

score 1.1k · Answer 9 · 2020-12-23 12:15:53

1.1k

Views

off diagonal Ramsey number (4,k) lower bound probabilistic method asymptotic reasoning

Published on 23 Dec 2020 - 12:15

score 814 · Answer 10 · 2026-03-25 20:12:45

814

Views

three-uniform hypergraph on $n$ vertices with at least $n/3$ edges contains an independent set of size at least $\frac{2n^{3/2}}{3\sqrt{3m}}$

Published on 25 Mar 2026 - 20:12

score 713 · Answer 11 · 2020-12-29 21:16:44

there is a positive constant $c$ such that for any $n$ real numbers $a_i$ with $\sum a_i^2=1$, $\mathbb P[|\sum \epsilon_i a_i|\le1]\ge c$

score 221 · Answer 12 · 2020-12-30 17:08:28

221

Views

$\epsilon$-regular pair of vertex sets definition

Published on 30 Dec 2020 - 17:08

score 98 · Answer 13 · 2021-01-05 11:31:34

98

Views

hint on a solved old exam question on probabilistic methods calcualation

Published on 05 Jan 2021 - 11:31

score 169 · Answer 14 · 2026-03-25 20:12:57

169

Views

Is there a logic with quantifier "almost always".

Published on 25 Mar 2026 - 20:12

score 306 · Answer 15 · 2021-01-17 09:25:32

306

Views

there exists a $c>0$ such that every $3$-regular bipartite graph is a $(2n,3,c)$-expander

Published on 17 Jan 2021 - 9:25

List Question

In random graph what do we mean by almost every graph in G(n,p) has a property Q?

Efficient Algorithm for finding a large sum-free subset.

Regular Graph with a Partition Half of Neighbors Are in the Partition and Half Are Not

The probabilistic method exercise 2.7.4

Exercise 2.7.5 of the probabilistic method

Lower bound for minimum vertices in tournament

Prove that there exist a set $ S⊆V $ for a graph G which contains a matching M, such that there are $ frac{|E|+m}{2} $ between S and V\S

Show that any graph has an independent set of size at least $\frac{n^2}{2m+n}$

off diagonal Ramsey number (4,k) lower bound probabilistic method asymptotic reasoning

three-uniform hypergraph on $n$ vertices with at least $n/3$ edges contains an independent set of size at least $\frac{2n^{3/2}}{3\sqrt{3m}}$

there is a positive constant $c$ such that for any $n$ real numbers $a_i$ with $\sum a_i^2=1$, $\mathbb P[|\sum \epsilon_i a_i|\le1]\ge c$

$\epsilon$-regular pair of vertex sets definition

hint on a solved old exam question on probabilistic methods calcualation

Is there a logic with quantifier "almost always".

there exists a $c>0$ such that every $3$-regular bipartite graph is a $(2n,3,c)$-expander

Trending Questions

Popular # Hahtags

Popular Questions